{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T10:00:00Z","timestamp":1766484000672,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2004.1354541","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T04:34:02Z","timestamp":1103776442000},"page":"705-715","source":"Crossref","is-referenced-by-count":4,"title":["On finding disjoint paths in single and dual link cost networks"],"prefix":"10.1109","volume":"1","author":[{"family":"Dahai Xu","sequence":"first","affiliation":[]},{"family":"Yang Chen","sequence":"additional","affiliation":[]},{"family":"Yizhi Xiong","sequence":"additional","affiliation":[]},{"family":"Chunming Qiao","sequence":"additional","affiliation":[]},{"family":"Xin He","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","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 Transactions on Communications"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1117\/12.436053"},{"key":"15","first-page":"140","article-title":"Efficient distributed path selection for shared restoration connections","author":"li","year":"2002","journal-title":"INFOCOM'02"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.966150"},{"key":"13","first-page":"302","article-title":"Distributed partial information management (DPIM) schemes for survivable networks - Part I","author":"qiao","year":"2002","journal-title":"INFOCOM'02"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2002.1181421"},{"key":"11","article-title":"Survivable networks: Algorithms for diverse routing","author":"bhandari","year":"1999","journal-title":"Kluwer"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832265"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1137\/0205048"},{"key":"20","doi-asserted-by":"crossref","DOI":"10.1109\/INFCOM.1994.337532","article-title":"Optimal diverse routing in telecommunications fiber networks","author":"bhandari","year":"1994","journal-title":"INFOCOM 94"},{"journal-title":"Introduction to Algorithms","year":"1990","author":"corman","key":"22"},{"journal-title":"Flows in Networks","year":"1962","author":"ford","key":"23"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1364\/ONA.1998.MN2"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2003.808767"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/OFC.2002.1036545"},{"key":"3","first-page":"109","article-title":"Approaches for capacity and revenue optimization in survivable WDM network","volume":"10","author":"sridharan","year":"2001","journal-title":"Journal of High Speed Networks"},{"key":"2","first-page":"699","article-title":"Approximating optimal spare capacity allocation by successive survivable routing","author":"liu","year":"2001","journal-title":"INFOCOM'01"},{"key":"10","first-page":"303","article-title":"Survivability of lightwave networks - Path lengths in WDM protection scheme","volume":"10","author":"sen","year":"2001","journal-title":"Journal of High Speed Networks"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.845540"},{"key":"7","article-title":"Solving asymmetrically weighted optimal or near-optimal disjoint path-pair for the survivable optical networks","author":"laborczi","year":"2001","journal-title":"Third International Workshop on Design of Reliable Communication Networks (DRCN\ufffd-01)"},{"key":"6","article-title":"Spare capacity allocation method, analysis and algorithms","author":"liu","year":"2001","journal-title":"School of Information Sciences and Engineering"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040204"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140209"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90024-7"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220705"}],"event":{"name":"IEEE INFOCOM 2004","acronym":"INFCOM-04","location":"Hong Kong, PR China"},"container-title":["IEEE INFOCOM 2004"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9369\/29751\/01354541.pdf?arnumber=1354541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T09:42:56Z","timestamp":1497606176000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1354541\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/infcom.2004.1354541","relation":{},"subject":[]}}