{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T11:49:29Z","timestamp":1772020169438,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0140-3664(02)00217-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"834-844","source":"Crossref","is-referenced-by-count":7,"title":["NetLets: measurement-based routing daemons for low end-to-end delays over networks"],"prefix":"10.1016","volume":"26","author":[{"given":"Nageswara S.V.","family":"Rao","sequence":"first","affiliation":[]},{"given":"Young-Cheol","family":"Bang","sequence":"additional","affiliation":[]},{"given":"Sridhar","family":"Radhakrishnan","sequence":"additional","affiliation":[]},{"given":"Qishi","family":"Wu","sequence":"additional","affiliation":[]},{"given":"S.","family":"Sitharama Iyengar","sequence":"additional","affiliation":[]},{"given":"Hyunseung","family":"Choo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(02)00217-7_BIB1","unstructured":"Active networks, http:\/\/www.sds.lcs.mit.edu\/activeware."},{"issue":"11","key":"10.1016\/S0140-3664(02)00217-7_BIB2","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1016\/S0140-3664(00)00158-4","article-title":"on update algorithms for quickest paths","volume":"23","author":"Bang","year":"2000","journal-title":"Computer Communications"},{"key":"10.1016\/S0140-3664(02)00217-7_BIB3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/6.803593","article-title":"Diversifying Internet delivery","volume":"November","author":"Carpenter","year":"1999","journal-title":"IEEE Spectrum"},{"issue":"2","key":"10.1016\/S0140-3664(02)00217-7_BIB4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","article-title":"The quickest path problem","volume":"17","author":"Chen","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0140-3664(02)00217-7_BIB5","series-title":"Technical Report, University of Washington, October","author":"Collins","year":"1998"},{"key":"10.1016\/S0140-3664(02)00217-7_BIB6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/6.866285","article-title":"The cost of quality in Internet-style networks","volume":"September","author":"Dutta-Roy","year":"2000","journal-title":"IEEE Spectrum"},{"key":"10.1016\/S0140-3664(02)00217-7_BIB7","series-title":"QoS Strategies for Multiservice Networks","author":"Huston","year":"2001"},{"key":"10.1016\/S0140-3664(02)00217-7_BIB8","series-title":"Network Working Group, RFC 2330, May","author":"Paxson","year":"1998"},{"issue":"5","key":"10.1016\/S0140-3664(02)00217-7_BIB9","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/90.649563","article-title":"End-to-End Routing Behavior in the Internet","volume":"5","author":"Paxson","year":"1997","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S0140-3664(02)00217-7_BIB10","series-title":"Computer Networks: A Systems Approach","author":"Peterson","year":"2000"},{"issue":"6","key":"10.1016\/S0140-3664(02)00217-7_BIB11","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","article-title":"Algorithms for the quickest path problem and the enumeration of quickest paths","volume":"18","author":"Rosen","year":"1991","journal-title":"Computers and Operations Research"},{"issue":"5","key":"10.1016\/S0140-3664(02)00217-7_BIB12","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1109\/4234.625044","article-title":"Algorithm for minimum end-to-end delay paths","volume":"1","author":"Rao","year":"1997","journal-title":"IEEE Communication Letters"},{"key":"10.1016\/S0140-3664(02)00217-7_BIB13","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1109\/ICCCN.1998.739912","article-title":"On routing algorithms with end-to-end delay guarantees","author":"Rao","year":"1998","journal-title":"Proceedings of International Conference on Computer Communications and Networks"},{"key":"10.1016\/S0140-3664(02)00217-7_BIB14","first-page":"11","article-title":"QoS routing via multiple paths using bandwidth reservation","volume":"1","author":"Rao","year":"1998","journal-title":"Proceedings of IEEE INFOCOM98: The Conference on Computer Communications"},{"key":"10.1016\/S0140-3664(02)00217-7_BIB15","series-title":"Proceedings of ninth International Conference on Advanced Computing and Communications","author":"Rao","year":"2001"},{"key":"10.1016\/S0140-3664(02)00217-7_BIB16","unstructured":"N.S.V. Rao, NetLets: End-to-end QoS mechanisms for distributed computing in wide-area networks using two-paths, Proceedings of International Conference on Internet Computing, pp. 475\u2013478, ORNL Draft, , http:\/\/saturn.epm.ornl.gov\/~nrao."},{"key":"10.1016\/S0140-3664(02)00217-7_BIB17","unstructured":"N.S.V. Rao, Probabilistic end-to-end delay guarantees in a class of networks, ORNL Draft, , http:\/\/saturn.epm.ornl.gov\/~nrao."},{"issue":"1","key":"10.1016\/S0140-3664(02)00217-7_BIB18","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/40.748796","article-title":"Detour: Informed Internet Routing and Transport","volume":"19","author":"Savage","year":"1999","journal-title":"IEEE Micro"},{"key":"10.1016\/S0140-3664(02)00217-7_BIB19","series-title":"Proceedings of the 1999 AcM SIGCOMM Conference, Cambridge, MA, September","author":"Savage","year":"1999"},{"key":"10.1016\/S0140-3664(02)00217-7_BIB20","series-title":"Internet QoS: Architectures and Mechanisms for Quality of Service","author":"Wang","year":"2001"},{"key":"10.1016\/S0140-3664(02)00217-7_BIB21","unstructured":"Web100 concept paper, 1999, http:\/\/www.web100.org."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402002177?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402002177?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T18:30:59Z","timestamp":1554402659000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366402002177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0140366402002177"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(02)00217-7","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}