Sharing video on demand

Discrete Applied Mathematics

Volumn 129, Issue 1, 2003, Pages 3-30

  Bar Noy, Amotz ^a   Garay, Juan A ^b   Herzberg, Amir ^c  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

Competitive analysis; On line algorithms; Resource allocation; Video on demand

Indexed keywords

EID: 84867938330     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00231-7     Document Type: Conference Paper

References (21)

1. S. Aggarwal, J.A. Garay, A. Herzberg, Adaptive video on demand, Proceedings of the Third Annual European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 979, Corfu, Greece, September 1995, Springer, Berlin, 1995, pp. 538-553.
2. S. Albers, The influence of lookahead in competitive paging algorithms, Proceedings of the First Annual European Symposium on Algorithms, Lecture Notes in Computer Science, Springer, Berlin, 1993, pp. 1-12.
3. E. Arkin, and E. Silverberg Scheduling jobs with fixed start and end time Discrete Appl. Math. 18 1987 1 8
4. B. Awerbuch, Y. Azar, A. Fiat, T. Leighton, Making commitments in the face of uncertainty: how to pick a winner almost every time, Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, Philadelphia, PA, May 1996, pp. 519-530.
5. I. Ben-Arroyo Hartman, Optimal k-coloring and k-nesting of intervals, Proceedings of the First Israeli Symposium on Theory of Computing and Systems, Haifa, Israel, 1992.
6. C. Bouras, V. Kapoulas, T. Pantziou, P. Spirakis, Randomized adaptive video on demand, personal communication; Short abstract in Proceedings of the 15th Annual ACM Symposium on the Principles of Distributed Computing, Philadelphia, PA, 1996, p. 179.
7. J.A. Garay, I.S. Gopal, Call preemption in communication networks, Proceedings of the IEEE INFOCOM '92, Florence, Italy, May 1992, pp. 1043-1050.
8. R.L. Graham Bounds on multiprocessing anomalies SIAM J. Appl. Math. 17 1969 263 269
9. C.J. Horton 110 channels without boundaries: why restrict options? Comm. Eng. Design 19/1 1993 29 30
10. J. Koegel, and A. Syta Routing of multi-media connections in hybrid networks Proc. SPIE - Internat. Soc. Opt. Eng. 1786 1993 2 10
11. R.J. Lipton, A. Tomkins, Online interval scheduling, Proceedings of the Fifth ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, January 1994, pp. 302-311.
12. S.M. McCarthy Integrating telco interoffice fiber transport with coaxial distribution Proc. SPIE - Internat. Soc. Opt. Eng. 1786 1993 23 33
13. J. McManus, K. Ross, Video on demand over ATM: constant rate transmission and transport, Proceedings of the INFOCOM '96, Vol. 3, IEEE Press, London, 1996, pp. 1357-1362.
14. K. Metz Next generation CATV networks Proc. SPIE - Internat. Soc. Opt. Eng. 1786 1993 184 189
15. O. Penttinen, L. Ojala, T. Pyssysalo, Modelling of an adaptive video on demand scheduling algorithm using stochastic well-formed colored petri nets, Proceedings of the Multimedia and Concurrency Workshop - International Conference on the Applications and Theory of Petri Nets, ICATPN '97, Toulouse, France, June 1997, pp. 17-30.
16. S. Plotkin. Competitive routing of virtual circuits in ATM networks, IEEE Journal of Selected Areas in Communications, special issue on Advances in the Fundamentals of Networking (invited paper), August 1995, pp. 1128-1136. < http://theory.stanford.edu/people/plotkin/routing.html .
17. J. Salehi, Z. Zhang, J. Kurose, D. Towsley, Supporting stored video: reducing rate variability and end-to-end resource requirements through optimal smoothing, Proceedings of the ACM Sigmetrics Conference, 1996.
18. C. Sell Video on demand internal trial Proc. SPIE - Internat. Soc. Opt. Eng. 1786 1993 168 175
19. D. Shmoys, J. Wein, D. Williamson, Scheduling parallel machines on-line, Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, San Juan, Puerto Rico, October 1991, pp. 131-140.
20. D. Sleator, and R. Tarjan Amortized efficiency of list update and paging rules Commun. ACM 32 1985 652 686
21. E. Torng, A unified analysis of paging and caching, Proceedings of the 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, October 1995, pp. 194-203.