{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:13:18Z","timestamp":1729609998720,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/glocom.2005.1578035","type":"proceedings-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T11:24:16Z","timestamp":1138188256000},"page":"5 pp.-2106","source":"Crossref","is-referenced-by-count":0,"title":["A heuristic logical topology design algorithm for multi-hop dynamic traffic grooming in WDM optical networks"],"prefix":"10.1109","author":[{"family":"Chunsheng Xin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Bin Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Xiaojun Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Jikai Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3945"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/49.974667"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1094894"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3031"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/90.541317"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/49.510907"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/90.392387"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.829641"},{"key":"9","article-title":"Logical topology design for dynamic traffic grooming in mesh WDM optical networks","author":"xin","year":"2005","journal-title":"Proc IEEE ICC"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.810319"},{"article-title":"A procedure for determining a family of minimal cost flow patterns","year":"1961","author":"busacker","key":"11"},{"key":"12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"bellman","year":"0","journal-title":"Quart Appl Math"}],"event":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","start":{"date-parts":[[2005,12,2]]},"location":"St. Louis, MO, USA","end":{"date-parts":[[2005,12,2]]}},"container-title":["GLOBECOM '05. IEEE Global Telecommunications Conference, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10511\/33288\/01578035.pdf?arnumber=1578035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T11:21:51Z","timestamp":1555413711000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1578035\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/glocom.2005.1578035","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}