Multicast pull scheduling: When fairness is fine

Algorithmica (New York)

Volumn 36, Issue 3, 2003, Pages 315-330

  Edmonds, Jeff ^a   Pruhs, Kirk ^b  

^a YORK UNIVERSITY   (Canada)

^b Learning Research and Development Ctr   (United States)

Author keywords

Broadcast; Multicast; Resource augmentation; Scheduling

Indexed keywords

APPROXIMATION THEORY; BROADCASTING; CLIENT SERVER COMPUTER SYSTEMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; JOB ANALYSIS; MULTICASTING; SCHEDULING;

COMPETITIVE ALGORITHM; MULTICAST PULL SCHEDULING; RESOURCE AUGMENTATION;

ALGORITHMS;

EID: 0942290217     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1018-5     Document Type: Article

References (13)

1. S. Aacharya and S. Muthukrishnan, Scheduling on-demand broadcasts: new metrics and algorithms, Proc. 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, Proc. ACM/SIAM Symposium on Discrete Algorithms, pp. 11-20, 1998.
3. Y. Bartal and S. Muthukrishnan, Minimizing maximum response time in scheduling broadcasts, Proc. ACM/SIAM Symposium on Discrete Algorithms, pp. 558-559, 2000.
4. DirecPC website, http://www.direcpc.com.
5. J. Edmonds, Scheduling in the dark, Theoretical Computer Science, 235(1), 109-141, 2000.
6. T. Erlebach and A. Hall, NP-hardness of broadcast scheduling and inapproximatability of of single-source unsplittable min-cost flow, Proc. ACM/SIAM Symposium on Discrete Algorithms, pp. 194-202, 2002.
7. R. Gandhi, S. Khuller, Y. Kim, and Y.-C. Wan, Approximation algorithms for broadcast scheduling, Proc. Conference on Integer Programming and Combinatorial Optimization, pp. 425-438, 2002.
8. B. Kalyanasundaram and K. Pruhs, Speed is as powerful as clairvoyance, Journal of the ACM, 47(4), 617-643, 2000.
9. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai, Scheduling broadcasts in wireless networks, Journal of Scheduling, 4(6), 339-354, 2000.
10. C. Kenyon, N. Schabanel, and N. Young, Polynomial-time approximation schemes for data broadcast, Proc. ACM Symposium on Theory of Computing, pp. 659-666, 2000.
11. C. Phillips, C. Stein, E. Torng, and J. Wein, Optimal time-critical scheduling via resource augmentation, Algorimica, 32(2), 163-200, 2002.
12. K. Pruhs and P. Uthaisombut, A comparison of multicast pull models, Proc. European Symposium on Algorithms, pp. 808-819, 2002.
13. N. Schabanel, The data broadcast problem with preemption, Proc. Symposium on Theoretical Aspects of Computer Science, pp. 181-192, Lecture Notes in Computer Science, vol. 1770, Springer-Verlag, Berlin, 2000.