{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:20:10Z","timestamp":1740133210729,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"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\/ACM Trans. Networking"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1109\/tnet.2015.2411056","type":"journal-article","created":{"date-parts":[[2015,4,20]],"date-time":"2015-04-20T14:47:53Z","timestamp":1429541273000},"page":"1109-1124","source":"Crossref","is-referenced-by-count":3,"title":["Embedding IP Unique Shortest Path Topology on a Wavelength-Routed Network: Normal and Survivable Design"],"prefix":"10.1109","volume":"24","author":[{"given":"Gaurav","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4109-0658","authenticated-orcid":false,"given":"Deep","family":"Medhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061987"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1971162.1971168"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1141277.1141368"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS.2010.5488482"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9381-5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/net.20163"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2014.34"},{"key":"ref36","article-title":"A novel mathematical model for the unique shortest path routing problem","author":"zhang","year":"2008","journal-title":"ArXiv Preprint ArXiv 0807 0038"},{"key":"ref35","first-page":"829","article-title":"Dual-based link weight determination towards single shortest path solutions for OSPF networks","author":"srivastava","year":"2005","journal-title":"Proc Int Teletraffic Congr"},{"key":"ref34","article-title":"A CP-LP hybrid method for unique shortest path routing optimization","author":"petterson","year":"2007","journal-title":"Proc Int Network Optimization Conf"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2307\/2371086"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2013.092813.130397"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003045"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(80)90022-2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2184300"},{"key":"ref14","first-page":"35","article-title":"Algorithms for the logical topology design in WDM all-optical networks","volume":"1","author":"leonardi","year":"2000","journal-title":"Opt Networks Mag"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016084518565"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1997.635136"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/49.725186"},{"key":"ref18","first-page":"726","article-title":"Survivable networks based on optimal routing and WDM self-healing rings","volume":"2","author":"fumagalli","year":"1999","journal-title":"Proc IEEE InfoCom"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.751462"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(02)00036-6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"ref27","article-title":"Overview and principles of Internet traffic engineering","volume":"3272","author":"awduche","year":"2002","journal-title":"Internet RFC"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/35.868148"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref6"},{"key":"ref29","first-page":"107","article-title":"A Lagrangian approach for integrated network design and routing in IP networks","author":"bley","year":"2003","journal-title":"Proc Int Network Optim Conf"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/90.879346"},{"journal-title":"Combinatorial Optimization Algorithms and Complexity","year":"1982","author":"lawler","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916717"},{"key":"ref2","article-title":"Avoiding equal cost multipath treatment in MPLS networks","volume":"4928","author":"swallow","year":"2007","journal-title":"Internet RFC"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/BROADNETS.2004.79"},{"journal-title":"Avoiding Ties in Shortest Path First Routing","year":"2002","author":"roughan","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.751461"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1364\/JOCN.4.000053"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062014"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355737"},{"key":"ref24","first-page":"73","article-title":"A survey of virtual topology design algorithms for wavelength-routed optical networks","volume":"1","author":"dutta","year":"2000","journal-title":"Opt Networks Mag"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2002396.2002403"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICUMT.2012.6459748"},{"key":"ref26","first-page":"1885","article-title":"Logical topology augmentation for survivable mapping in IP-over-WDM networks","author":"liu","year":"2005","journal-title":"Proc IEEE Globecom"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICBN.2005.1589752"},{"key":"ref25","first-page":"2771","article-title":"Survivable routing in WDM networks—logical ring in arbitrary physical topology","author":"sen","year":"2002","journal-title":"Proc Int Conf Commun"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/7452693\/7089324.pdf?arnumber=7089324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:44:49Z","timestamp":1641987889000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7089324\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":43,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2015.2411056","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2016,4]]}}}