{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T00:10:23Z","timestamp":1750896623340,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1109\/infcom.2003.1208931","type":"proceedings-article","created":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T21:26:50Z","timestamp":1078176410000},"page":"938-947 vol.2","source":"Crossref","is-referenced-by-count":8,"title":["Efficient QoS routing"],"prefix":"10.1109","author":[{"given":"S.","family":"Siachalou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Georgiadis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Real Networks","year":"0","key":"17"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.1.70"},{"journal-title":"The Power Law Simulator","year":"0","key":"16"},{"key":"13","article-title":"A new distributed routing algorithm with end-to-end delay guarantee","author":"sun","year":"1997","journal-title":"IWQoS'97"},{"key":"14","first-page":"1228","article-title":"QoS routing for supporting resource reservation","volume":"14","author":"wang","year":"1996","journal-title":"IEEE JSAC"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35170-4_12"},{"journal-title":"LEDA A Platform for Combinatorial and Geometric Computing","year":"2000","author":"mehlhorn","key":"12"},{"key":"3","article-title":"On finding multi-constrained paths","author":"chen","year":"1998","journal-title":"International Journal of Computational Geometry & Applications"},{"journal-title":"An Approximation Algorithm for Combinatorial Optimization Problems with Two Parameters","year":"1995","author":"blokh","key":"2"},{"journal-title":"Network Flows Theory Algorithms and Applications","year":"1993","author":"ahuja","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/IWQOS.2000.847940"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916276"},{"journal-title":"Computer and Intractability A Guide to the Theory of NP-Completeness","year":"1978","author":"garey","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(01)00069-4"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(01)00358-9"}],"event":{"name":"IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies","start":{"date-parts":[[2003,3,30]]},"location":"San Francisco, CA","end":{"date-parts":[[2003,4,3]]}},"container-title":["IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8585\/27206\/01208931.pdf?arnumber=1208931","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T21:46:15Z","timestamp":1568670375000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1208931\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/infcom.2003.1208931","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}