{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T06:04:11Z","timestamp":1730268251808,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2004.1354544","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T09:34:02Z","timestamp":1103794442000},"page":"739-749","source":"Crossref","is-referenced-by-count":6,"title":["A simple polynomial time framework for reduced-path decomposition in multi-path routing"],"prefix":"10.1109","volume":"1","author":[{"given":"V.S.","family":"Mirrokni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Thottan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Uzunalioglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","article-title":"On the scalability tradeoffs in mpls and ip routing","author":"yilmaz","year":"2002","journal-title":"Technical Report"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/65.826369"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301262"},{"key":"ref11","first-page":"884","article-title":"Minimum interfere routing with applications to (mpls) traffic engineering","author":"kar","year":"2000","journal-title":"Proc IEEE InfoCom"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"journal-title":"Approximation algorithms for disjoint paths problems","year":"1996","author":"kleinberg","key":"ref13"},{"key":"ref14","first-page":"68","article-title":"Single-source unsplittable flow problem","author":"kleinberg","year":"1996","journal-title":"IEEE Symposium on Foundations of Computer Science"},{"key":"ref15","first-page":"184","article-title":"Improved bounds for the unsplittable flow problem","author":"kolman","year":"2002","journal-title":"Proc 13th Annu ACM-SIAM Symp Discrete Algorithms SODA 02"},{"key":"ref16","article-title":"Distributed network monitoring with bounded link utilization","author":"li","year":"2003","journal-title":"Proc IEEE InfoCom"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2001.948886"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/90.532863"},{"key":"ref19","first-page":"1077","article-title":"A case study of multiservice. multipriorilty traffic engineering design for data networks","author":"mitra","year":"1999","journal-title":"Proc IEEE Globecom"},{"key":"ref28","article-title":"Mpls optimized multipath mpls-omp","author":"villamizar","year":"1999","journal-title":"Internet draft"},{"key":"ref4","article-title":"Applicability statement for traffic engineering with mpls","author":"boyle","year":"0","journal-title":"IETF RFC 3346"},{"key":"ref27","first-page":"332","article-title":"Speeding-up linear programming using fast matrix multiplication","author":"pravin","year":"1989","journal-title":"In in the proceeding 30th symp of Foundations of Computer Science FOCS"},{"key":"ref3","first-page":"101","article-title":"On the k-splitlable flow problem","author":"baier","year":"2002","journal-title":"In the proceeding of ESA 1002 10th Annual European Symposium of Algorithms"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743461"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"year":"0","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/90.929850"},{"key":"ref7","first-page":"156","article-title":"Traffic model for usa long distance optimal network","author":"dwivedi","year":"2000","journal-title":"Proc Optical Fiber Communication Conference"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208706"},{"key":"ref9","article-title":"Exploring the trade-off between label size and stack depth in mpls routing","author":"gupta","year":"2003","journal-title":"Proc IEEE InfoCom"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/inte.30.1.26.11621"},{"key":"ref20","article-title":"On selection of paths for multi-path routing","author":"nelakuditi","year":"2001","journal-title":"IWQoS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"article-title":"Combinatorial Optimization: Algorithms and Complexity","year":"1998","author":"papadimitriou","key":"ref21"},{"key":"ref24","article-title":"Profile-based routing and traffic engineering","volume":"25","author":"suri","year":"2002","journal-title":"Computer Communications"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208953"},{"key":"ref26","article-title":"Sequin: An sump-based mpls, diffserv network monitoring system","author":"thouan","year":"2003","journal-title":"Bell Labs Technical Journal"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.2.250"}],"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\/01354544.pdf?arnumber=1354544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T18:22:21Z","timestamp":1489515741000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1354544\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/infcom.2004.1354544","relation":{},"subject":[]}}