A comparison of multicast pull models

Algorithmica (New York)

Volumn 42, Issue 3-4, 2005, Pages 289-307

  Pruhs, Kirk R ^a   Uthaisombut, Patchrawat ^a  

^a Learning Research and Development Ctr   (United States)

Author keywords

Broadcast; Client server; Multicast; Resource augmentation; Scheduling

Indexed keywords

BROADCASTING; QUALITY OF SERVICE; SATELLITES; SCHEDULING; SERVERS; WORLD WIDE WEB;

BROADCAST; CLIENT-SERVER; MULTICAST; RESOURCE AUGMENTATION;

MULTICASTING;

EID: 22344453478     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-005-1170-1     Document Type: Conference Paper

References (13)

1. S. Aacharya and S. Muthukrishnan, Scheduling on-demand broadcasts: new metrics and algorithms, Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking, pp. 43-54, 1998.
2. A. Bar-Noy, R. Bhatia, J. Naor, and B. Schieber, Minimizing service and operation costs of periodic scheduling, Proceedings of the ACM/SIAM Symposium on Discrete Algorithms, pp. 11-20, 1998.
3. Y. Bartal and S. Muthukrishnan, Minimizing maximum response time in scheduling broadcasts, Proceedings of the ACM/SIAM Symposium on Discrete Algorithms, pp. 558-559, 2000.
4. Digital Fountain website, http://www.digitalfountain.com.
5. DirecPC website, http://www.direcpc.com.
6. J. Edmonds and K. Pruhs, Broadcast scheduling: when fairness is fine, Proceedings of the ACM/SIAM Symposium on Discrete Algorithms, pp. 421-430, 2002.
7. T. Erlebach and A. Hall, Hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow, Proceedings of the ACM/SIAM Symposium on Discrete Algorithms, pp. 194-202, 2002.
8. R. Gandhi, S. Khuller, Y. Kim, and Y.-C. Wan, Approximation algorithms for broadcast scheduling, Proceedings of the International Integer Programming and Combinatorial Optimization Conference, pp. 425-438, 2002.
9. B. Kalyanasundaram and K. Pruhs, Speed is as powerful as clairvoyance, Journal of the ACM, 47(4), 617-643, 2000.
10. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai, Scheduling broadcasts in wireless networks, Journal of Scheduling, 4(6), 339-354, 2000.
11. C. Kenyon, N. Schabanel, and N. Young, Polynomial-time approximation schemes for data broadcast, Proceedings of the ACM Symposium on Theory of Computing, pp. 659-666, 2000.
12. J. Kurose and K. Ross, Computer Networking: A Top Down Approach Featuring the Internet, Addison-Wesley Longman, Reading, MA/Harlow 2001.
13. C. Phillips, C. Stein, E. Torng, and J. Wein Optimal time-critical scheduling via resource augmentation, Algorimica, 32(2), 163-200, 2002.