{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:15:00Z","timestamp":1742976900645,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664277"},{"type":"electronic","value":"9783540483182"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48318-7_21","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T20:20:56Z","timestamp":1193343656000},"page":"258-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks"],"prefix":"10.1007","author":[{"given":"Athanasios","family":"Bouganis","sequence":"first","affiliation":[]},{"given":"Ioannis","family":"Caragiannis","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,27]]},"reference":[{"key":"21_CR1","unstructured":"A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan. Efficient Routing and Scheduling Algorithms for Optical Networks. In Proc. of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 94), pp. 412-423, 1994."},{"key":"21_CR2","unstructured":"Y. Aumann, Y. Rabani. Improved Bounds for All Optical Routing. In Proc. of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 95), pp. 567\u2013576, 1995."},{"key":"21_CR3","unstructured":"B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, U. Vaccaro. Graph Problems arising from Wavelength Routing in All-Optical Networks. 2nd Workshop on Optics and Computer Science (WOCS 97), 1997."},{"key":"21_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/3-540-61440-0_160","volume-title":"Proc. of the 22nd International Colloquium on Automata, Languages, and Programming (ICALP 96)","author":"J.-C. Bermond","year":"1996","unstructured":"J.-C. Bermond, L. Gargano, S. Perennes, A. Rescigno, U. Vaccaro. Efficient Collective Communication in Optical Networks. In Proc. of the 22nd International Colloquium on Automata, Languages, and Programming (ICALP 96), LNCS 1099, Springer-Verlag, pp. 574\u2013585, 1996."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"A.Z. Broder, A. Frieze, and E. Upfal. Existence and Construction of Edge Disjoint Paths on Expander Graphs. In Proc. of the 24th Annual ACM Symposium on the Theory of Computing (STOC 92), pp. 140\u2013149, 1992.","DOI":"10.1145\/129712.129727"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"E. Dijkstra. A Note on Two Problems in Connection with Graphs. Num. Math., 1:269\u2013271, 1959.","journal-title":"Num. Math."},{"key":"21_CR7","unstructured":"T. Erlebach, K. Jansen. Scheduling of Virtual Connections in Fast Networks. In Proc. of the 4th Workshop on Parallel Systems and Algorithms (PASA 96), pp. 13\u201332, 1996."},{"key":"21_CR8","unstructured":"T. Erlebach, K. Jansen. Call Scheduling in Trees, Rings, and Meshes. In Proc. Of the Hawaii Int. Conf. on Syst. Sciences (HICSS 97), 1997."},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M.R. Garey","year":"1980","unstructured":"M.R. Garey, D.S. Johnson, G.L. Miller, C.H. Papadimitriou. The Complexity of Coloring Circular Arcs and Chords. SIAM Journ. Alg. Disc. Meth., vol. 1, no. 2, (1980), pp. 216\u2013227.","journal-title":"SIAM Journ. Alg. Disc. Meth."},{"key":"21_CR10","series-title":"Lect Notes Comput Sci","first-page":"460","volume-title":"Proc. of the 4th European Symposium on Algorithms (ESA 96)","author":"C. Kaklamanis","year":"1997","unstructured":"C. Kaklamanis, P. Persiano. EfficientWavelength Routing on Directed Fiber Trees. In Proc. of the 4th European Symposium on Algorithms (ESA 96), LNCS 1136, Springer Verlag, 1997, pp. 460\u2013470."},{"key":"21_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-63165-8_205","volume-title":"Proc. of the 24th Internation Colloquium on Automata, Languages, and Programming (ICALP 97)","author":"C. Kaklamanis","year":"1997","unstructured":"C. Kaklamanis, P. Persiano, T. Erlebach, K. Jansen. Constrained Bipartite Edge Coloring with Applications toWavelength Routing. In Proc. of the 24th Internation Colloquium on Automata, Languages, and Programming (ICALP 97), LNCS 1256, Springer Verlag, 1997, pp. 493\u2013504."},{"key":"21_CR12","unstructured":"V. Kumar, E. Schwabe. Improved Access to Optical Bandwidth in Trees. In Proc. of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 97), 1997, pp. 437\u2013444."},{"key":"21_CR13","unstructured":"M. Mihail, C. Kaklamanis, S. Rao. Efficient Access to Optical Bandwidth. In Proc. of the 36th Annual Symposium on Foundations of Computer Science (FOCS 95), 1995, pp. 548\u2013557."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511814075"},{"key":"21_CR15","unstructured":"R.K. Pankaj. Architectures for Linear Lightwave Networks. PhD. Thesis, Dept. of EECS, MIT, 1992."},{"key":"21_CR16","unstructured":"Y. Rabani. Path Coloring on the Mesh. In Proc. of the 37th Annual Symposium on Foundations of Computer Science (FOCS 96), 1996."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"P. Raghavan, E. Upfal. Efficient Routing in All-Optical Networks. In Proc. of the 26th Annual Symposium on Theory of Computing (STOC 94), 1994, pp. 133\u2013143.","DOI":"10.1145\/195058.195119"},{"key":"21_CR18","unstructured":"R. Ramaswami, K. Sivarajan. Optical Networks. Morgan Kaufmann, 1998."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48318-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T09:04:27Z","timestamp":1587805467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48318-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664277","9783540483182"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48318-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}