{"id":"https://openalex.org/W2153776688","doi":"https://doi.org/10.1109/infcom.2004.1354544","title":"A simple polynomial time framework for reduced-path decomposition in multi-path routing","display_name":"A simple polynomial time framework for reduced-path decomposition in multi-path routing","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2153776688","doi":"https://doi.org/10.1109/infcom.2004.1354544","mag":"2153776688"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2004.1354544","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2004.1354544","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2004","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075598023","display_name":"Vahab Mirrokni","orcid":"https://orcid.org/0000-0001-6705-5629"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"V.S. Mirrokni","raw_affiliation_strings":["Laboratory for Computer Science, Massachusetts Institute of Technology, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory for Computer Science, Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054336795","display_name":"Marina Thottan","orcid":null},"institutions":[{"id":"https://openalex.org/I176714629","display_name":"Bell (Canada)","ror":"https://ror.org/00xdg8m59","country_code":"CA","type":"company","lineage":["https://openalex.org/I176714629"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"M. Thottan","raw_affiliation_strings":["Center for Networking Research, Bell Labs"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Networking Research, Bell Labs","institution_ids":["https://openalex.org/I176714629"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051057723","display_name":"H\u00fcseyin Uzunalio\u011flu","orcid":null},"institutions":[{"id":"https://openalex.org/I176714629","display_name":"Bell (Canada)","ror":"https://ror.org/00xdg8m59","country_code":"CA","type":"company","lineage":["https://openalex.org/I176714629"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"H. Uzunalioglu","raw_affiliation_strings":["Advanced Network Planning, Bell Labs"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Advanced Network Planning, Bell Labs","institution_ids":["https://openalex.org/I176714629"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074925082","display_name":"Sanjoy Kumar Paul","orcid":"https://orcid.org/0000-0001-9523-179X"},"institutions":[{"id":"https://openalex.org/I176714629","display_name":"Bell (Canada)","ror":"https://ror.org/00xdg8m59","country_code":"CA","type":"company","lineage":["https://openalex.org/I176714629"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"S. Paul","raw_affiliation_strings":["Center for Networking Research, Bell Labs"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Networking Research, Bell Labs","institution_ids":["https://openalex.org/I176714629"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3735,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.8894091,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"739","last_page":"749"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7026262879371643},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5653153657913208},{"id":"https://openalex.org/keywords/multiprotocol-label-switching","display_name":"Multiprotocol Label Switching","score":0.5392462611198425},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5197736620903015},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.48971131443977356},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.4622582793235779},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.437637597322464},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4326302707195282},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.42710617184638977},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.420393705368042},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4179025888442993},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3810803294181824},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.2876794934272766},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20673465728759766},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1997145116329193},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17387238144874573},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.15579620003700256},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13219714164733887},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10242676734924316}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7026262879371643},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5653153657913208},{"id":"https://openalex.org/C129880937","wikidata":"https://www.wikidata.org/wiki/Q677023","display_name":"Multiprotocol Label Switching","level":3,"score":0.5392462611198425},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5197736620903015},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.48971131443977356},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.4622582793235779},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.437637597322464},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4326302707195282},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.42710617184638977},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.420393705368042},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4179025888442993},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3810803294181824},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.2876794934272766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20673465728759766},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1997145116329193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17387238144874573},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.15579620003700256},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13219714164733887},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10242676734924316}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2004.1354544","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2004.1354544","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2004","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1.1762","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.1762","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ieee-infocom.org/2004/Papers/15_5.PDF","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6200000047683716,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W54868700","https://openalex.org/W1532363302","https://openalex.org/W1591562949","https://openalex.org/W1948092788","https://openalex.org/W1965068506","https://openalex.org/W2022191808","https://openalex.org/W2024965364","https://openalex.org/W2035144082","https://openalex.org/W2053913299","https://openalex.org/W2069323107","https://openalex.org/W2074762809","https://openalex.org/W2079300367","https://openalex.org/W2100699015","https://openalex.org/W2100908985","https://openalex.org/W2103985627","https://openalex.org/W2105808107","https://openalex.org/W2113144894","https://openalex.org/W2121959042","https://openalex.org/W2129761485","https://openalex.org/W2129851433","https://openalex.org/W2132233231","https://openalex.org/W2139054829","https://openalex.org/W2141664506","https://openalex.org/W2153250951","https://openalex.org/W2161718593","https://openalex.org/W2162311977","https://openalex.org/W2172151912","https://openalex.org/W2611147814","https://openalex.org/W4285719527","https://openalex.org/W4322358105","https://openalex.org/W6602225317","https://openalex.org/W6631802880","https://openalex.org/W6656790322","https://openalex.org/W6669268651","https://openalex.org/W6681252616","https://openalex.org/W6683889351","https://openalex.org/W7008583937"],"related_works":["https://openalex.org/W2528191140","https://openalex.org/W2113320944","https://openalex.org/W2390890682","https://openalex.org/W2494652972","https://openalex.org/W2493189344","https://openalex.org/W3195816148","https://openalex.org/W3093940293","https://openalex.org/W2138676684","https://openalex.org/W3094029073","https://openalex.org/W2148577377"],"abstract_inverted_index":{"The":[0,107,184,230],"recent":[1],"reduction":[2],"in":[3,28,44,57,141,210,238],"telecommunications":[4],"spending":[5],"has":[6],"increased":[7],"the":[8,15,20,30,34,61,66,121,135,142,147,157,163,174,194,214,225],"importance":[9],"of":[10,33,68,95,105,124,137,166,176,186,216],"network":[11,22,35,69,91,160],"planning":[12,240],"to":[13,59,155,172,208],"improve":[14],"return":[16],"on":[17,19,48,112,213],"investment":[18],"existing":[21],"infrastructures.":[23],"Therefore,":[24],"tools":[25],"that":[26,88,120],"help":[27],"maximizing":[29],"bandwidth":[31,50,62,98],"efficiency":[32,51],"at":[36,127],"a":[37,82,102],"minimum":[38],"cost":[39],"are":[40,134],"essential.":[41],"Previous":[42],"work":[43],"this":[45,55],"area":[46],"focused":[47],"increasing":[49,60],"and":[52,71,132,139,162,234,247],"reliability.":[53],"In":[54],"work,":[56],"addition":[58],"efficiency,":[63],"we":[64,118,198],"address":[65,156,173],"complexity":[67],"management":[70],"operations.":[72],"This":[73,218],"issue":[74],"is":[75,110,126,188,232],"explicitly":[76],"addressed":[77],"by":[78],"our":[79],"novel":[80],"framework,":[81],"simple":[83],"polynomial":[84],"time":[85],"algorithm":[86],"(SimPol)":[87],"achieves":[89],"optimum":[90],"performance":[92,185],"(in":[93],"terms":[94],"congestion":[96,161,211,219],"or":[97],"consumption)":[99],"using":[100],"only":[101],"small":[103],"number":[104,123,165,215],"paths.":[106,167,183],"problem":[108,175],"formulation":[109,154],"based":[111],"splittable":[113],"multicommodity":[114],"flows.":[115],"Using":[116,193],"SimPol":[117,171,187],"show":[119],"total":[122,164],"paths":[125],"most":[128],"k+m,":[129],"where":[130],"k":[131],"m":[133],"numbers":[136],"demands":[138],"edges":[140],"network,":[143],"respectively.":[144],"We":[145,168],"extend":[146],"basic":[148],"framework":[149,231],"into":[150],"an":[151],"integer":[152,195],"programming":[153,196],"tradeoff":[158],"between":[159],"also":[169],"use":[170],"implementing":[177],"path/link":[178],"policies":[179],"such":[180,244],"as":[181,245],"bandwidth-limited":[182],"evaluated":[189],"through":[190],"extensive":[191],"simulations.":[192],"approach,":[197],"can":[199,235],"get":[200],"exactly":[201],"one":[202],"path":[203,228],"while":[204],"losing":[205],"about":[206],"10%":[207],"50%":[209],"depending":[212],"demands.":[217],"is,":[220],"however,":[221],"far":[222],"better":[223],"than":[224],"traditional":[226],"shortest":[227],"routing.":[229],"general":[233],"be":[236],"used":[237],"capacity":[239],"for":[241],"transport":[242],"networks":[243],"MPLS":[246],"ATM.":[248]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}