A comparison of multicast pull models

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

Volumn 2461, Issue , 2002, Pages 808-819

  Pruhs, Kirk ^a   Uthaisombut, Patchrawat ^a  

^a UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MULTICASTING;

OPTIMAL SCHEDULE; OUT OF ORDER; QOS MEASURE; WEB SERVERS;

QUALITY OF SERVICE;

EID: 84938059309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_70     Document Type: Conference Paper

References (13)

1. S. Aacharya, and S. Muthukrishnan, "Scheduling on-demand broadcasts: new metrics and algorithms", ACM/IEEE International Conference on Mobile Computing and Networking, 1998. 813
2. A. Bar-Noy, R. Bhatia, J. Naor, and B. Schieber, "Minimizing service and operation costs of periodic scheduling", 11-20, SODA 1998. 813
3. Y. Bartal, and S. Muthukrishnan, "Minimizing maximum response time in scheduling broadcasts", 558-559, SODA, 2000. 810, 811, 812, 813
4. Digital Fountain website, http://www.digitalfountain.com. 808
5. DirecPC website, http://www.direcpc.com. 808
6. J. Edmonds and K. Pruhs, "Broadcast scheduling: when fairness is fine", SODA, 2002. 810, 811, 813
7. T. Erlebach and A. Hall, "Hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow", SODA, 2002. 813
8. R. Gandhi, S. Khuller, Y.A. Kim, and Y.C. Wan, "Algorithms for Minimimzing Response Time in Broadcast Scheduling", To appear in IPCO, 2002. 813
9. B. Kalyanasundaram, and K. Pruhs, "Speed is as powerful as clairvoyance", JACM, 2000. 810
10. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai, "Scheduling broadcasts in wireless networks", European Symposium on Algorithms (ESA), 2000. 813
11. C. Kenyon, N. Schabanel and N. Young, "Polynomial-time approximation schemes for data broadcast", 659-666, STOC 2000. 813
12. J. Kurose and K. Ross, Computer Networking: A Top Down Approach Featuring the Internet, Addison Wesley Longman, 2001. 809
13. C. Phillips, C. Stein, E. Torng, and J. Wein "Optimal time-critical scheduling via resource augmentation", ACM Symposium on Theory of Computing, 140-149, 1997. 810