{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:53:30Z","timestamp":1762271610640},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603139"},{"type":"electronic","value":"9783540449133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60313-1_169","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:17:00Z","timestamp":1330280220000},"page":"538-553","source":"Crossref","is-referenced-by-count":8,"title":["Adaptive Video on Demand"],"prefix":"10.1007","author":[{"given":"Sudhanshu","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"Garay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Herzberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"40_CR1","unstructured":"B. Awerbuch, Y. Azar and A. Fiat. Tight Competitive ALgorithms for On-Line Max Cover or How to Beat Murphy's Law. Personal communication."},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Azar and S. Plotkin. Throughput-Competitive On-Line Routing. Proc. 34th Annual IEEE Symp. on Found. of Computer Science, 32\u201340, 1993.","DOI":"10.1109\/SFCS.1993.366884"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"J. Aspnes, Y. Azar, A. Fiat, S. Plotkin and O. Waarts. On-Line Load Balancing with Applications to Machine Scheduling and Virtual Circuit Routing. Proc. 25th Annual ACM Symp. on Theory of Computing, 623\u2013631, 1993.","DOI":"10.1145\/167088.167248"},{"key":"40_CR4","unstructured":"B. Awerbuch, Y. Bartal, A. Fiat and A. Rosen. Competitive Non-Preemptive Call Control. Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, 312\u2013320, Arlington, VA, January 1993."},{"key":"40_CR5","unstructured":"A. Bar-Noy, J. Garay and A. Herzberg. Sharing Video on Demand. Unpublished manuscript."},{"key":"40_CR6","first-page":"263","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"R.L. Graham. Bounds on multiprocessing anomalies. SIAM Journal of Applied Mathematics, 17:263\u2013269, 1969.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"J. A. Garay and I. S. Gopal. Call Preemption in Communication Networks. Proc. INFOCOM '92, 1043\u20131050, Florence, Italy, May 1992.","DOI":"10.1109\/INFCOM.1992.263457"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"J.A. Garay, I. Gopal, S. Kutten, Y. Mansour and M. Yung. Efficient On-line Call Control Algorithms. Proc. 2nd Israeli Symp. on Theory of Computing and Systems, Netania, Israel, 285\u2013293, June 1993.","DOI":"10.1109\/ISTCS.1993.253460"},{"key":"40_CR9","first-page":"29","volume":"19\/1","author":"C. J. Horton","year":"1993","unstructured":"Colin J. Horton. 110 channels without boundaries: why restrict options? Communications Engineering and Design, 19\/1:29\u201330, January 1993.","journal-title":"Communications Engineering and Design"},{"key":"40_CR10","first-page":"23","volume":"1786","author":"S. M. McCarthy","year":"1993","unstructured":"Steven M. McCarthy. Integrating Telco Interoffice Fiber Transport with Coaxial Distribution. Proc. SPIE \u2014 Int. Soc. Opt. Eng., 1786:23\u201333, November 1993.","journal-title":"Proc. SPIE \u2014 Int. Soc. Opt. Eng."},{"key":"40_CR11","first-page":"2","volume":"1786","author":"J. Koegel","year":"1993","unstructured":"John Koegel and Andrzej Syta. Routing of multi-media connections in hybrid networks. Proc. SPIE \u2014 Int. Soc. Opt. Eng., 1786:2\u201310, November 1993.","journal-title":"Proc. SPIE \u2014 Int. Soc. Opt. Eng."},{"key":"40_CR12","unstructured":"Richard J. Lipton and Andrew Tomkins. Online Interval Scheduling. Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, Arlington, VA, 302\u2013311, January 1994."},{"key":"40_CR13","first-page":"184","volume":"1786","author":"K. Metz","year":"1993","unstructured":"Kenneth Metz. Next generation catv networks. Proc. SPIE \u2014 Int. Soc. Opt. Eng., 1786:184\u2013189, November 1993.","journal-title":"Proc. SPIE \u2014 Int. Soc. Opt. Eng."},{"key":"40_CR14","first-page":"168","volume":"1786","author":"C. Sell","year":"1993","unstructured":"Chris Sell. Video on demand internal trial. Proc. SPIE \u2014 Int. Soc. Opt. Eng., 1786:168\u2013175, November 1993.","journal-title":"Proc. SPIE \u2014 Int. Soc. Opt. Eng."},{"key":"40_CR15","first-page":"652","volume":"32","author":"D. D. Sleator","year":"1985","unstructured":"Daniel D. Sleator and Robert E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 32:652\u2013686, 1985.","journal-title":"Communications of the ACM"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"D. Shmoys and J. Wein and D. Williamson. Scheduling Parallel Machines On-line. Proc. 32nd IEEE Symp. on Foundtations of Computer Science, 131\u2013140, October 1991.","DOI":"10.1109\/SFCS.1991.185361"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60313-1_169.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:37:09Z","timestamp":1619573829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60313-1_169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603139","9783540449133"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-60313-1_169","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}