{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T22:28:02Z","timestamp":1677018482689},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"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 Trans. Rel."],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1109\/tr.2010.2103592","type":"journal-article","created":{"date-parts":[[2011,1,10]],"date-time":"2011-01-10T20:53:59Z","timestamp":1294692839000},"page":"88-93","source":"Crossref","is-referenced-by-count":4,"title":["Addressing the Most Reliable Edge-Disjoint Paths With a Delay Constraint"],"prefix":"10.1109","volume":"60","author":[{"given":"Ruen Chze","family":"Loh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sieteng","family":"Soh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihai","family":"Lazarescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00066-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/513800.513802"},{"key":"ref10","first-page":"121","article-title":"Finding the most reliable edge-disjoint-path-set in a communication network","author":"loh","year":"2007","journal-title":"Proc PEECS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e90-d.2.465"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354543"},{"key":"ref11","first-page":"346","article-title":"BRITE: Universal topology generation from a user's perspective","author":"medina","year":"2001","journal-title":"Proc IEEE MASCOTS"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2009.24"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/TNET.2007.900712","article-title":"Polynomial time approximation algorithms for multi-constrained QoS routing","volume":"16","author":"xue","year":"2008","journal-title":"IEEE\/ACM Trans Networking"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-006-0731-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/PRDC.2008.16"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.612"}],"container-title":["IEEE Transactions on Reliability"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/24\/5721872\/05685290.pdf?arnumber=5685290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:46:56Z","timestamp":1633909616000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5685290\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":11,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tr.2010.2103592","relation":{},"ISSN":["0018-9529","1558-1721"],"issn-type":[{"value":"0018-9529","type":"print"},{"value":"1558-1721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}