{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:33:01Z","timestamp":1729650781919,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/softcom.2013.6671866","type":"proceedings-article","created":{"date-parts":[[2013,12,3]],"date-time":"2013-12-03T16:58:14Z","timestamp":1386089894000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["Disjoint paths pair computation procedure for SDH\/SONET networks"],"prefix":"10.1109","author":[{"given":"A. M.","family":"Hassan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorn","family":"Altmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Telecommunication Standard Primer","year":"0","key":"19"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2006.1607870"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2043538"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.815844"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2003.1188281"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.836112"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2005.1381883"},{"key":"11","article-title":"Multi-constraint-pruning: An algorithm for finding K shortest paths subject to multiple constraints","volume":"2008","author":"ziang","year":"2008","journal-title":"IEICE 08 SB 0083 APCC"},{"key":"12","article-title":"Path computation for traffic engineering in MPLS networks","author":"banerjee","year":"2001","journal-title":"Springer"},{"key":"21","article-title":"Control Plane Framework Emergence and its Deployment Cost Estimation","author":"hassan","year":"2012","journal-title":"Telecommunications Internet and Media Techno Economics (CTTE) 2010 9th Conference on"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2005.1470804"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ONDM.2012.6210200"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1364\/JON.5.000509"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/OFC.2005.192573"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1106159"},{"key":"7","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TCOMM.2003.809779","article-title":"Diverse routing in optical mesh networks","volume":"51","author":"hu","year":"2003","journal-title":"IEEE Transaction on Communication"},{"key":"6","article-title":"Path computation element communication protocol","author":"vasseur","year":"2009","journal-title":"RFC 5440"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2004.1262160"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.aeue.2005.10.006"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2006.28"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1093\/ietcom\/e90-b.8.1922"}],"event":{"name":"2013 21st International Conference on Software, Telecommunications and Computer Networks - (SoftCOM 2013)","start":{"date-parts":[[2013,9,18]]},"location":"Split-Primosten, Croatia","end":{"date-parts":[[2013,9,20]]}},"container-title":["2013 21st International Conference on Software, Telecommunications and Computer Networks - (SoftCOM 2013)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6657883\/6671843\/06671866.pdf?arnumber=6671866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T23:35:19Z","timestamp":1498088119000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6671866\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/softcom.2013.6671866","relation":{},"subject":[],"published":{"date-parts":[[2013,9]]}}}