{"id":"https://openalex.org/W2159018180","doi":"https://doi.org/10.1109/tnet.2010.2099666","title":"Traffic-Oblivious Routing in the Hose Model","display_name":"Traffic-Oblivious Routing in the Hose Model","publication_year":2011,"publication_date":"2011-01-28","ids":{"openalex":"https://openalex.org/W2159018180","doi":"https://doi.org/10.1109/tnet.2010.2099666","mag":"2159018180"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2010.2099666","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2010.2099666","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-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/A5108507325","display_name":"Murali Kodialam","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Murali Kodialam","raw_affiliation_strings":["Bell Laboratories, Alcatel-Lucent, Murray Hill, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Alcatel-Lucent, Murray Hill, NJ, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079816803","display_name":"T. V. Lakshman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"T. V. Lakshman","raw_affiliation_strings":["Bell Laboratories, Alcatel-Lucent, Murray Hill, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Alcatel-Lucent, Murray Hill, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091546931","display_name":"Sudipta Sengupta","orcid":"https://orcid.org/0009-0001-6331-9524"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sudipta Sengupta","raw_affiliation_strings":["Microsoft Research Limited, Redmond, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.431,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.84140921,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"19","issue":"3","first_page":"774","last_page":"787"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9997000098228455,"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.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994999766349792,"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.7573331594467163},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.7143698930740356},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6369718909263611},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6047515869140625},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5389377474784851},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5282465815544128},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5091413855552673},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5088289380073547},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4838680028915405},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.4661484956741333},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4145752191543579},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4000631868839264},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2237163782119751}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7573331594467163},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.7143698930740356},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6369718909263611},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6047515869140625},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5389377474784851},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5282465815544128},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5091413855552673},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5088289380073547},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4838680028915405},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.4661484956741333},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4145752191543579},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4000631868839264},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2237163782119751}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnet.2010.2099666","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2010.2099666","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1501204926","https://openalex.org/W1651117873","https://openalex.org/W1963547452","https://openalex.org/W1971443646","https://openalex.org/W1977545325","https://openalex.org/W2035652501","https://openalex.org/W2060591526","https://openalex.org/W2068811470","https://openalex.org/W2094410510","https://openalex.org/W2104254326","https://openalex.org/W2105787370","https://openalex.org/W2107997203","https://openalex.org/W2123138012","https://openalex.org/W2125987572","https://openalex.org/W2130106218","https://openalex.org/W2136173851","https://openalex.org/W2143213750","https://openalex.org/W2148662748","https://openalex.org/W2152226783","https://openalex.org/W2155694415","https://openalex.org/W2162467679","https://openalex.org/W2170595412","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W4253436398","https://openalex.org/W2068473861","https://openalex.org/W1538003338","https://openalex.org/W2364686261","https://openalex.org/W1984835167","https://openalex.org/W2351097701","https://openalex.org/W2556128816","https://openalex.org/W2162880363","https://openalex.org/W2607223747"],"abstract_inverted_index":{"Routing":[0],"traffic":[1,24,100,127,146,172,202,300],"subject":[2],"to":[3,36,46,91,240,281,299],"hose":[4,27,126,145,171],"model":[5],"constraints":[6,48],"has":[7,16,30],"been":[8,17],"of":[9,63,85,105,125,144,151,170,177,212,219,221,223,237,242,268,273,283],"much":[10],"recent":[11],"research":[12,263],"interest.":[13],"Two-phase":[14],"routing":[15,23,65,95,124,143,169,214,239,246,270,277,295],"proposed":[18,154],"as":[19],"a":[20,115,135,148,162,183,217],"mechanism":[21],"for":[22,121,139,147,166,173,192,257],"in":[25,33,43,155],"the":[26,39,60,83,94,99,103,152,174,178,200,208,224,228,235,258,284],"model.":[28],"It":[29],"desirable":[31,61],"properties":[32,62],"being":[34,44],"able":[35,45],"statically":[37],"preconfigure":[38],"transport":[40],"network":[41,264],"and":[42,78,188,247,261,278],"handle":[47],"imposed":[49],"by":[50],"specialized":[51],"service":[52,253],"overlays.":[53],"In":[54,102],"this":[55,106,193],"paper,":[56],"we":[57,108,113,133,160,205,233],"investigate":[58],"whether":[59],"two-phase":[64,142,168,213,238,269,294],"come":[66],"with":[67],"any":[68,304],"resource":[69,307],"overhead":[70],"compared":[71],"to:":[72],"1)":[73],"direct":[74,129,243,274],"source-destination":[75,130,244,275],"path":[76,245,276],"routing;":[77],"2)":[79],"optimal":[80,225,248,285],"scheme":[81,153,249,286],"among":[82],"class":[84],"all":[86,288],"schemes":[87],"that":[88,207,222,241,272,282,293],"are":[89],"allowed":[90],"even":[92],"make":[93],"dynamically":[96],"dependent":[97],"on":[98,199,250,287],"matrix.":[101],"pursuit":[104],"endeavor,":[107],"achieve":[109],"several":[110],"milestones.":[111],"First,":[112],"develop":[114,134,161],"polynomial-size":[116,136,163,229],"linear":[117],"programming":[118],"(LP)":[119],"formulation":[120,138,165,187],"maximum":[122,140],"throughput":[123,141,209,236,267],"along":[128],"paths.":[131],"Second,":[132],"LP":[137,164,186,230],"generalized":[149,175],"version":[150,176],"our":[156],"previous":[157,310],"work.":[158],"Third,":[159],"minimum-cost":[167],"scheme.":[179,226],"We":[180,291],"also":[181],"give":[182],"second":[184],"(simpler)":[185],"fast":[189],"combinatorial":[190],"algorithm":[191],"problem":[194],"using":[195],"an":[196],"upper":[197],"bound":[198],"end-to-end":[201],"demand.":[203],"Fourth,":[204],"prove":[206],"(and":[210],"cost)":[211],"is":[215,279],"within":[216],"factor":[218],"2":[220],"Using":[227],"formulations":[231],"developed,":[232],"compare":[234],"actual":[251],"Internet":[252],"provider":[254],"topologies":[255],"collected":[256],"Rocketfuel":[259],"project":[260],"three":[262],"topologies.":[265,290],"The":[266],"matches":[271],"close":[280],"evaluated":[289],"conclude":[292],"achieves":[296],"its":[297],"robustness":[298],"variation":[301],"without":[302],"imposing":[303],"appreciable":[305],"additional":[306],"requirements":[308],"over":[309],"approaches.":[311]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}