{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:33:08Z","timestamp":1725564788430},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540244677"},{"type":"electronic","value":"9783540305828"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30582-8_36","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T06:10:32Z","timestamp":1283839832000},"page":"342-351","source":"Crossref","is-referenced-by-count":8,"title":["RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths"],"prefix":"10.1007","author":[{"given":"Hyun Gi","family":"Ahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tae-Jin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min Young","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyunseung","family":"Choo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Architecture of Optical Transport Network, ITU-T Recommendation, G. 872 (2001)"},{"key":"36_CR2","unstructured":"Advanced Networking for Research and Education, Online, Available: \n                    \n                      http:\/\/abilene.internet2.edu\/"},{"issue":"5","key":"36_CR3","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/90.469957","volume":"3","author":"A. Ramaswami","year":"1995","unstructured":"Ramaswami, A., Sivarajan, K.: Routing and Wavelength Assignment in All-Optical Network. IEEE\/ACM Transactions on Networking\u00a03(5), 489\u2013500 (1995)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"1","key":"36_CR4","first-page":"47","volume":"1","author":"H. Zang","year":"2000","unstructured":"Zang, H., Jue, J.P., Mukherjee, B.: A Review of Routing and Wavelength Assignment Approaches for Wavelength-routed Optical WDM Networks. Optical Networks Magazine\u00a01(1), 47\u201360 (2000)","journal-title":"Optical Networks Magazine"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1109\/4234.1001667","volume":"5","author":"P. Manohar","year":"2002","unstructured":"Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and Wavelength Assignment in Optical Networks from Edge Disjoint Path Algorithms. IEEE Communications Letter\u00a05, 211\u2013213 (2002)","journal-title":"IEEE Communications Letter"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Kirovski, D., Potkonjak, M.: Efficient Coloring of a Large Spectrum of Graphs. In: Proc. 35th Conf. Design Automation, pp. 427\u2013432 (1998)","DOI":"10.1145\/277044.277165"},{"issue":"8","key":"36_CR7","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1109\/JSAC.2003.816622","volume":"21","author":"J. Kuri","year":"2003","unstructured":"Kuri, J., Puech, N., Gagnaire, M., Dotaro, E., Douville, R.: Routing and Wavelength Assignment of Scheduled Lightpath Demands. IEEE Journal on Selected Areas in Communications\u00a021(8), 1231\u20131240 (2003)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Kuri, J., Puech, N., Gagnaire, M., Dotaro, E.: Routing Foreseeable Lightpath Demands Using a Tabu Search Meta-heuristic. In: Proc. GLOBECOM 2002, Taipei, Taiwan, pp. 2803\u20132807 (2002)","DOI":"10.1109\/GLOCOM.2002.1189140"},{"key":"36_CR9","volume-title":"Approximation Algorithms for Disjoint Paths Problems, Ph. D. dissertation","author":"J. Kleinberg","year":"1996","unstructured":"Kleinberg, J.: Approximation Algorithms for Disjoint Paths Problems, Ph. D. dissertation. MIT, Cambridge (1996)"},{"key":"36_CR10","unstructured":"Clausen, J.: Branch and Bound Algorithm-Principles and Examples, Online, Available: \n                    \n                      http:\/\/www.imm.dtu.dk\/jha\/"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1018952429396","volume":"90","author":"J. Clausen","year":"1999","unstructured":"Clausen, J., Perregaard, M.: On the Best Search Strategy in Parallel Branch-and- Bound-Best-First-Search vs. Lazy Depth-First-Search. Annals of Operations Research\u00a0(90), 1\u201317 (1999)","journal-title":"Annals of Operations Research"},{"key":"36_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer-Academic, MA (1997)"}],"container-title":["Lecture Notes in Computer Science","Information Networking. Convergence in Broadband and Mobile Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30582-8_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:31:37Z","timestamp":1620012697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30582-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540244677","9783540305828"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30582-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}