{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:01:23Z","timestamp":1725559283461},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260431"},{"type":"electronic","value":"9783540321149"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11428848_73","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T17:44:33Z","timestamp":1279129473000},"page":"559-567","source":"Crossref","is-referenced-by-count":7,"title":["Traffic Grooming Algorithm Using Shortest EDPs Table in WDM Mesh Networks"],"prefix":"10.1007","author":[{"given":"Seungsoo","family":"Lee","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":"73_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1007\/978-3-540-24693-0_138","volume-title":"NETWORKING 2004. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications","author":"H. Choo","year":"2004","unstructured":"Choo, H., Son, M., Chung, M.Y., Lee, T.J.: Shared Protection by Concatenated Rings in Optical WDM Networks. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol.\u00a03042, pp. 1476\u20131482. Springer, Heidelberg (2004)"},{"key":"73_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1109\/4234.1001667","volume":"6","author":"P. Manohar","year":"2002","unstructured":"Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and Wavelength Assignment in Optical Network From Edge Disjoint Path Algorithms. IEEE Communications Letters\u00a06, 211\u2013213 (2002)","journal-title":"IEEE Communications Letters"},{"key":"73_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/3-540-45036-X_14","volume-title":"Web Communication Technologies and Internet-Related Social Issues - HSI 2003","author":"M.H. Kim","year":"2003","unstructured":"Kim, M.H., Choo, H., Yae, B.H., Lee, J.H.: A Practical RWA Algorithm Based on Lookup Table for Edge Disjoint Paths. In: Chung, C.-W., Kim, C.-k., Kim, W., Ling, T.-W., Song, K.-H. (eds.) HSI 2003. LNCS, vol.\u00a02713, pp. 138\u2013147. Springer, Heidelberg (2003)"},{"key":"73_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1007\/978-3-540-24688-6_147","volume-title":"Computational Science - ICCS 2004","author":"H. Choo","year":"2004","unstructured":"Choo, H., Shakhov, V.V.: Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol.\u00a03038, pp. 1138\u20131145. Springer, Heidelberg (2004)"},{"key":"73_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/TNET.2003.810310","volume":"11","author":"H. Zhu","year":"2003","unstructured":"Zhu, H., Zang, H., Zhu, K., Mukherjee, B.: A novel, generic graph model for traffic grooming in heterogeneous WDM mesh networks. IEEE\/ACM Trans. Networking\u00a011, 285\u2013299 (2003)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"73_CR6","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/49.974667","volume":"20","author":"K. Zhu","year":"2002","unstructured":"Zhu, K., Mukherjee, B.: Traffic grooming in WDM optical mesh networks. IEEE Journal on Selected Areas in Communications\u00a020, 122\u2013133 (2002)","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11428848_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,16]],"date-time":"2019-03-16T19:04:29Z","timestamp":1552763069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11428848_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260431","9783540321149"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11428848_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}