Comparing push- and pull-based broadcasting. Or: Would "microsoft watches" profit from a transmitter?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2647, Issue , 2003, Pages 148-164

  Hall, Alexander ^a   Täubig, Hanjo ^b  

^a ETH ZURICH   (Switzerland)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; FEEDBACK; SCHEDULING;

BROADCAST SCHEDULE; BROADCAST SCHEDULING; BROADCAST SCHEDULING PROBLEMS; CLASSIFICATION SCHEME; EXPERIMENTAL EVALUATION; GRAPHICAL INTERFACE; HIGH-BANDWIDTH CHANNELS; SCHEDULING PROBLEM;

SCHEDULING ALGORITHMS;

EID: 33746693577     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44867-5_12     Document Type: Review

References (38)

1. S. Acharya, R. Alonso, M. Franklin, and S. Zdonik. Broadcast disks: Data management for asymmetric communication environments. In Proceedings of the ACM SIGMOD Conference, pages 199-210, San Jose, CA, May 1995.
2. S. Acharya, M. Franklin, and S. Zdonik. Prefetching from a broadcast disk. In Proceedings of the 12th Int. Conference on Data Engineering (ICDE), pages 276-285, New Orleans, Louisiana, February 1996.
3. S. Acharya, M. Franklin, and S. Zdonik. Balancing push and pull for data broadcast. In Proceedings of the ACM SIGMOD, Tuscon, Arizona, May 1997.
4. S. Acharya and S. Muthukrishnan. Scheduling on-demand broadcasts: New metrics and algorithms. In Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), pages 43-54, Dallas, Texas, USA, October 1998. ACM Press.
5. D. Aksoy and M. Franklin. Scheduling for large-scale on-demand data broadcasting. In Proceedings of the IEEE INFOCOM Conference, pages 651-659, San Francisco, CA, March 1998.
6. D. Aksoy and M. Franklin. RxW: A scheduling approach for large-scale ondemand data broadcast. ACM/IEEE Transactions on Networking, 7(6):846-860, December 1999.
7. M. H. Ammar and J. W. Wong. The design of teletext broadcast cycles. Performance Evaluation, 5(4):235-242, Dec 1985.
8. M. H. Ammar and J. W. Wong. On the optimality of cyclic transmission in teletext systems. IEEE Transaction on Communication, COM, 35(1):68-73, Jan 1987.
9. A. Bar-Noy, R. Bhatia, J. Naor, and B. Schieber. Minimizing service and operation costs of periodic scheduling. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 11-20, San Francisco, California, January 1998. ACM Press.
10. P. Barford and M. Crovella. Generating representative web workloads for net work and server performance evaluation In Proceedings of ACM SIGMETRICS, Measurement and Modeling of Computer Systems, pages 151-160, Madison, Wisconsin, USA, June 1998. ACM Press.
11. Y. Bartal and S. Muthukrishnan. Minimizing maximum response time in scheduling broadcasts. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 558-559, San Francisco, California, January 2000. ACM Press.
12. M. A. Bender, S. Chakrabarti, and S. Muthukrishnan. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 270-279, San Francisco, California, January 1998. ACM Press.
13. J. Blazewicz, K. H. Ecker, E. Pesch, G. Schmidt, and J. Wȩglarz. Scheduling Computer and Manufacturing Processes. Springer-Verlag, 1996.
14. P. Brucker. Scheduling Algorithms. Springer-Verlag, 3rd edition, September 2001.
15. P. Chrétienne, E. G. Coffman, Jr., J. K. Lenstra, and Z. Liu. Scheduling Theory and its Applications. John Wiley & Sons, 1995.
16. M. Crovella, M. Harchol-Balter, and C. D. Murta. Task assignment in a distributed system: Improving performance by unbalancing load. In Proceedings of ACM SIGMETRICS, Measurement and Modeling of Computer Systems, pages 268-269, Madison, Wisconsin, USA, June 1998. ACM Press.
17. M. E. Crovella and A. Bestavros. Self-similarity in world wide web traffic: Evidence and possible causes. IEEE/ACM Transactions on Networking, 5(6):835-846, December 1997.
18. DirecPC. Website. www.direcpc.com.
19. J. Edmonds and K. Pruhs. Broadcast scheduling: When fairness is fine. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 421-430, San Francisco, California, January 2002. ACM Press.
20. T. Erlebach and A. Hall. NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 194-202, San Francisco, California, January 2002. ACM Press.
21. R. Gandhi, S. Khuller, Y.-A. Kim, and Y.-C. Wan. Algorithms for minimizing response time in broadcast scheduling. In Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization (IPCO), volume 2337 of LNCS, pages 425-438, Cambridge, MA, USA, May 2002. Springer-Verlag.
22. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math, 5:287-326, 1979.
23. S. Hameed and N. H. Vaidya. Efficient algorithms for scheduling data broadcast. Wireless Networks, 5(3):183-193, May 1999.
24. @Home Network. Website. www.home.net.
25. Institut für Algebra und Geometrie, Otto-von-Guericke-Universität Magdeburg. LiSA Homepage, lisa.math.uni-magdeburg.de.
26. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai. Scheduling broadcasts in wireless networks. In Proc. of the 8th Annual European Symposium on Algorithms (ESA), volume 1879 of LNCS, pages 290-301, Saarbrücken, Germany, September 2000. Springer-Verlag.
27. C. Kenyon and N. Schabanel. The data broadcast problem with non-uniform transmission times. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 547-556, January 1999.
28. C. Kenyon, N. Schabanel, and N. E. Young. Polynomial-time approximation scheme for data broadcast. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), pages 659-666, May 2000.
29. B. Meier. Simulation of algorithms for stochastic scheduling problems. Diploma thesis, Technische Universität München, February 2003.
30. Algorithmic Solutions Software GmbH. LEDA. www.algorithmic-solutions.com/.
31. Lehrstuhl für Effiziente Algorithmen. Sketch-it! Documentation. wwwmayr.informatik.tu-muenchen.de/scheduling/ scheduling-api/html/classes.html.
32. Lehrstuhl für Effiziente Algorithmen. Sketch-it! Homepage. wwwmayr.informatik.tu-muenchen.de/scheduling/.
33. LIMI/EA 2215, University of Brest. The Cheddar project: a free real time scheduling simulator. http://beru.univ-brest.fr/ singhoff/cheddar/.
34. Microsoft PressPass. Microsoft Presents Smart Personal Objects Technology (SPOT)-Based Wristwatches at CES. www.microsoft.com/presspass/press/2003/jan03/01-09SPOTWatchesPR.asp.
35. TrollTech, Norway. Qt. www.trolltech.com/products/qt/.
36. N. Schabanel. The data broadcast problem with preemption. In Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1770 of LNCS, pages 181-192, Lille, France, February 2000. Springer-Verlag.
37. H. Täubig. Simulation of multiprocessor scheduling problems. Diploma thesis, Technische Universität München, August 2000.
38. N. H. Vaidya and S. Hameed. Scheduling data broadcast in asymmetric communication environments. Wireless Networks, 5(3):171-182, May 1999.