{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:04:34Z","timestamp":1751634274048},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616801"},{"type":"electronic","value":"9783540706670"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61680-2_73","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:11:17Z","timestamp":1330294277000},"page":"431-444","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["On-line competitive algorithms for call admission in optical networks"],"prefix":"10.1007","author":[{"given":"Baxuch","family":"Awerbuch","sequence":"first","affiliation":[]},{"given":"Yossi","family":"Azar","sequence":"additional","affiliation":[]},{"given":"Amos","family":"Fiat","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[]},{"given":"Adi","family":"Ros\u00e9n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"32_CR1","unstructured":"A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswani, B. Schieber, and M. Sudan. Efficient routing and scheduling algorithms for optical networks. In Proceedings of the 5th Annual ACM-SIAM Symposuim on Discrete Algorithms, pages 412\u2013423, 1994."},{"key":"32_CR2","unstructured":"B. Awerbuch, Y. Azar, and S. Plotkin. Throughput competitive on-line routing. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science, November 1993."},{"key":"32_CR3","unstructured":"B. Awerbuch, Y. Bartal, A. Fiat, and A. Ros\u00e9n. Competitive nonpreemptive call control. In Proceedings of 5th AGM-SIAM Symposium on Discrete Algorithms, 1994."},{"key":"32_CR4","unstructured":"B. Awerbuch, R. Gawlick, F.T. Leighton, and Y. Rabani. On-line admission control and circuit routing for high performance computing and communication. In Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science, 1994"},{"key":"32_CR5","unstructured":"Y. Aumann, Y. Rabani. Improved bounds for all-optical routing. In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"S. Ben-David, A. Borodin, R.M. Karp, G. Tardos, A. Widgerson. On the power of randomization in on-line algorithms. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990.","DOI":"10.1145\/100216.100268"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Y. Bartal, A. Fiat, S. Leonardi. Lower bounds for on-line graph problems with application to on-line circuit and optical routing. In Proceedings of the 28th ACM Symposium on Theory of Computing, 1996.","DOI":"10.1145\/237814.238001"},{"key":"32_CR8","unstructured":"R.A. Barry and P.A. Humblet. Bounds on the number of wavelengths needed in wdm networks. In LEOS'92 Summer Topical Mtg. Digest, pages 114\u2013127, 1992."},{"key":"32_CR9","unstructured":"R.A. Barry and P.A. Humblet. On the number of wavelengths and switches in all optical networks. IEEE Trans. Comm., 1993."},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Manuscript, 1996.","DOI":"10.1007\/3-540-63165-8_207"},{"key":"32_CR11","unstructured":"J. Kleinberg, E. Tardos. Disjoint paths in densely embedded graphs. In Proceedings of the 36th IEEE Annual Symposium on Foundations of Computer Science, 1995."},{"key":"32_CR12","unstructured":"R.J. Lipton, A. Tomkins. On-line interval scheduling. In Proceedings of the 5th ACM-Siam Symposium on Discrete Algorithms, 1994."},{"key":"32_CR13","unstructured":"M. Mihail, C. Kaklamanis, and S. Rao. Efficient Access to Optical Bandwidth. In Proceedings of the 36th IEEE Annual Symposium on Foundations of Computer Science, pages 548\u2013557, 1995."},{"key":"32_CR14","unstructured":"R.K. Pankay. Architectures for linear light-wave networks. PhD thesis, MIT, 1992."},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"G.R. Pieris and G.H. Sasaki. A linear lightwave benes network. IEEE\/ACM Trans. on Networking, 1993.","DOI":"10.1109\/90.251896"},{"key":"32_CR16","unstructured":"Y. Rabani. Path coloring on the mesh. In Proceedings of the 37th IEEE Annual Symposium on Foundations of Computer Science, 1996. To appear."},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"P. Raghavan and U. Upfal. Efficient routing in all optical networks. In Proceedings of the 26th Annual Symposium on Theory of Computing, pages 133\u2013143, 1994.","DOI":"10.1145\/195058.195119"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"D. Sleator, R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of ACM 28, 1985.","DOI":"10.1145\/2786.2793"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '96"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61680-2_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:47:12Z","timestamp":1558270032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61680-2_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616801","9783540706670"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-61680-2_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"6 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}