{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:56:39Z","timestamp":1725551799998},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260448"},{"type":"electronic","value":"9783540321187"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11428862_187","type":"book-chapter","created":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T17:59:23Z","timestamp":1270835963000},"page":"1120-1124","source":"Crossref","is-referenced-by-count":9,"title":["Traffic Grooming Based on Shortest Path in Optical WDM Mesh Networks"],"prefix":"10.1007","author":[{"given":"Yeo-Ran","family":"Yoon","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":"187_CR1","volume-title":"Optical Networks: A Practical Perspective","author":"R. Ramaswami","year":"1998","unstructured":"Ramaswami, R., Sivarajan, K.N.: Optical Networks: A Practical Perspective. Morgan Kaufmann, San Francisco (1998)"},{"key":"187_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-540-25978-7_49","volume-title":"Information Networking. Networking Technologies for Broadband and Mobile Networks","author":"A.S. Rodionov","year":"2004","unstructured":"Rodionov, A.S., Choo, H.: On generating random network structures: Connected Graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol.\u00a03090, pp. 483\u2013491. Springer, Heidelberg (2004)"},{"issue":"3","key":"187_CR3","first-page":"24","volume":"2","author":"S. Thiagarajan","year":"2001","unstructured":"Thiagarajan, S., Somani, A.K.: Capacity fairness ofWDMnetworks with grooming capability. Opt. Networks Mag.\u00a02(3), 24\u201331 (2001)","journal-title":"Opt. Networks Mag."},{"key":"187_CR4","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":"187_CR5","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 an optical WDM mesh network. IEEE J. Select. Areas Commun.\u00a020, 122\u2013133 (2002)","journal-title":"IEEE J. Select. Areas Commun."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11428862_187","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T11:19:11Z","timestamp":1552475951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11428862_187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260448","9783540321187"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11428862_187","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}