{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T17:12:09Z","timestamp":1761930729059,"version":"build-2065373602"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2002.1019317","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T18:04:13Z","timestamp":1056564253000},"page":"715-722","source":"Crossref","is-referenced-by-count":9,"title":["A new class of QoS routing strategies based on network graph reduction"],"prefix":"10.1109","volume":"2","author":[{"given":"C.","family":"Casetti","sequence":"first","affiliation":[]},{"given":"R.","family":"Lo Cigno","sequence":"additional","affiliation":[]},{"given":"M.","family":"Mellia","sequence":"additional","affiliation":[]},{"given":"M.","family":"Munafo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Georgia Teach-Internetwork Topology Models","year":"0","key":"17"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965901"},{"journal-title":"ANCLES - A Network Call-Level Simulator","year":"0","key":"16"},{"key":"13","article-title":"Multi-protocol label switching architecture","author":"rosen","year":"2001","journal-title":"RFC 3031"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2001.923650"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/190314.190330"},{"key":"12","article-title":"An adaptive routing algorithm for best-effort traffic in integrated-services networks","author":"casetti","year":"0","journal-title":"16th International Teletraffic Congress (ITC-16) Edinburgh UK June 1999"},{"key":"3","article-title":"Routing traffic with quality-of-service guarantees in integrated services networks","author":"ma","year":"0","journal-title":"8th IEEE\/ACM International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV'98) England July 1998"},{"key":"2","first-page":"206","article-title":"Routing high-bandwidth traffic in max-min fair share networks","author":"ma","year":"1996","journal-title":"Proceedings of the ACM Sigcomm'96"},{"key":"1","first-page":"1228","article-title":"QoS routing for supporting multimedia applications","volume":"14","author":"wang","year":"1996","journal-title":"IEEE JSAC"},{"article-title":"Data networks","year":"1992","author":"bertsekas","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316225"},{"key":"6","article-title":"QoS routing mechanisms and OSPF extensions","author":"apostolopoulos","year":"1999","journal-title":"RFC 2676"},{"key":"5","article-title":"Quality of service based routing: A performance perspective","author":"apostolopoulos","year":"0","journal-title":"ACM SIGCOMM'98 Vancouver Canada Sept 1998"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35388-3_37"},{"key":"9","article-title":"Use of OSI IS-IS for routing in TCP\/IP and dual environments","author":"callon","year":"1990","journal-title":"RFC 1195"},{"key":"8","article-title":"Open shortest path first version 2","author":"moy","year":"1998","journal-title":"RFC 2328"}],"event":{"name":"IEEE Information Communications Conference (INFOCOM 2002)","acronym":"INFCOM-02","location":"New York, NY, USA"},"container-title":["Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7943\/21922\/01019317.pdf?arnumber=1019317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T16:26:47Z","timestamp":1489163207000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1019317\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/infcom.2002.1019317","relation":{},"subject":[]}}