{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T08:19:03Z","timestamp":1707466743234},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:00:00Z","timestamp":1404172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Mag."],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1109\/mcom.2014.6852098","type":"journal-article","created":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T19:52:48Z","timestamp":1406663568000},"page":"158-167","source":"Crossref","is-referenced-by-count":8,"title":["Multicast routing in WDM networks without splitters"],"prefix":"10.1109","volume":"52","author":[{"given":"D.D.","family":"Le","sequence":"first","affiliation":[]},{"given":"M.","family":"Molnar","sequence":"additional","affiliation":[]},{"given":"J.","family":"Palaysi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"All-Optical Multicast Routing Algorithms without Splitters","author":"danh le","year":"2013","journal-title":"Technical Report"},{"key":"ref3","first-page":"83","article-title":"Heuristic Algorithms for Finding Light-Forest of Multicast Routing on WDM Network","volume":"25","author":"din","year":"2009","journal-title":"J Inform Sci Eng"},{"key":"ref10","first-page":"611","article-title":"Light-Hierarchy: The Optimal Structure for Multicast Routing in WDM Mesh Networks","author":"zhou","year":"0","journal-title":"15th IEEE Symp Computers and Commun 2010"},{"key":"ref6","article-title":"Hierarchies to Solve Constrained Connected Spanning Problems","author":"molnar","year":"2011","journal-title":"Technical Report 11029"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.osn.2005.10.001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200007)35:4<260::AID-NET4>3.0.CO;2-P"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/net.20048"},{"key":"ref7","first-page":"573","article-title":"An Approximate Solution for the Steiner Problem in Graphs","volume":"24","author":"takahashi","year":"1980","journal-title":"Mathematica Japonica"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/49.887907"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/50.908787"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/50.908667"}],"container-title":["IEEE Communications Magazine"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/35\/6852071\/06852098.pdf?arnumber=6852098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:07:14Z","timestamp":1642003634000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6852098\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":11,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/mcom.2014.6852098","relation":{},"ISSN":["0163-6804","1558-1896"],"issn-type":[{"value":"0163-6804","type":"print"},{"value":"1558-1896","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7]]}}}