{"id":"https://openalex.org/W2103348200","doi":"https://doi.org/10.1137/s009753979935061x","title":"General Dynamic Routing with Per-Packet Delay Guarantees of <i>O</i>(Distance + 1/Session Rate)","display_name":"General Dynamic Routing with Per-Packet Delay Guarantees of <i>O</i>(Distance + 1/Session Rate)","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2103348200","doi":"https://doi.org/10.1137/s009753979935061x","mag":"2103348200"},"language":"en","primary_location":{"id":"doi:10.1137/s009753979935061x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979935061x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5077188973","display_name":"Matthew Andrews","orcid":"https://orcid.org/0000-0002-0977-9685"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Matthew Andrews","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014057564","display_name":"Antonio Fern\u00e1ndez Anta","orcid":"https://orcid.org/0000-0001-6501-2377"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Antonio Fern\u00e1ndez","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009970116","display_name":"Mor Harchol\u2010Balter","orcid":"https://orcid.org/0000-0003-1721-6759"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mor Harchol-Balter","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113572159","display_name":"Tom Leighton","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tom Leighton","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5060590657","display_name":"Lisa Zhang","orcid":"https://orcid.org/0000-0002-4255-9609"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lisa Zhang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5077188973"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2431,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.84317435,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"30","issue":"5","first_page":"1594","last_page":"1623"},"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.9998999834060669,"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.9998999834060669,"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.9998999834060669,"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.9990000128746033,"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/network-packet","display_name":"Network packet","score":0.6566423177719116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6425115466117859},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.610558032989502},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5544713735580444},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5345861911773682},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5269164443016052},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4959467351436615},{"id":"https://openalex.org/keywords/end-to-end-delay","display_name":"End-to-end delay","score":0.4577045440673828},{"id":"https://openalex.org/keywords/session","display_name":"Session (web analytics)","score":0.42896395921707153},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4257052540779114},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4214160144329071},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29489666223526},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21333923935890198},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19314011931419373}],"concepts":[{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6566423177719116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6425115466117859},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.610558032989502},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5544713735580444},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5345861911773682},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5269164443016052},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4959467351436615},{"id":"https://openalex.org/C37624559","wikidata":"https://www.wikidata.org/wiki/Q5375776","display_name":"End-to-end delay","level":3,"score":0.4577045440673828},{"id":"https://openalex.org/C2779182362","wikidata":"https://www.wikidata.org/wiki/Q17126187","display_name":"Session (web analytics)","level":2,"score":0.42896395921707153},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4257052540779114},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4214160144329071},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29489666223526},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21333923935890198},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19314011931419373},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s009753979935061x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979935061x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":20,"referenced_works":["https://openalex.org/W1519375772","https://openalex.org/W1986632072","https://openalex.org/W2021539905","https://openalex.org/W2022392080","https://openalex.org/W2026782279","https://openalex.org/W2042587503","https://openalex.org/W2047038465","https://openalex.org/W2084427019","https://openalex.org/W2090921949","https://openalex.org/W2092153172","https://openalex.org/W2105197773","https://openalex.org/W2113322651","https://openalex.org/W2120938471","https://openalex.org/W2155303087","https://openalex.org/W2169230919","https://openalex.org/W2176566884","https://openalex.org/W2493844837","https://openalex.org/W3015891365","https://openalex.org/W3163287424","https://openalex.org/W4238270389"],"related_works":["https://openalex.org/W2195904091","https://openalex.org/W2381415338","https://openalex.org/W2365404242","https://openalex.org/W4360764540","https://openalex.org/W2370319203","https://openalex.org/W4241844845","https://openalex.org/W4231657010","https://openalex.org/W2365866555","https://openalex.org/W2385305544","https://openalex.org/W2041279370"],"abstract_inverted_index":{"A":[0,197],"central":[1],"issue":[2,17],"in":[3,59,241,251,313],"the":[4,22,40,121,124,145,149,165,169,187,208,218,237,246,256,302,309,314],"design":[5],"of":[6,12,75,95,127,147,171,180,199,225,239,260,295,311,333],"modern":[7],"communication":[8],"networks":[9,23],"is":[10,18,39,77,133,191,202,236,245,301,308],"that":[11,123,175],"providing":[13],"performance":[14,35],"guarantees.":[15],"This":[16,189,253],"particularly":[19],"important":[20],"if":[21],"support":[24],"real-time":[25],"traffic":[26],"such":[27],"as":[28,46,155],"voice":[29],"and":[30,161,243,268,306,345],"video.":[31],"The":[32],"most":[33,135],"critical":[34],"parameter":[36],"to":[37,52,90,100,120,156,288,321],"bound":[38,179,190,224,259],"delay":[41,160,178,223,339],"experienced":[42],"by":[43],"a":[44,60,66,73,87,92,107,172,177,222,276,330],"packet":[45,105,159,287],"it":[47],"travels":[48],"from":[49],"its":[50,53,289,296],"source":[51],"destination.":[54],"We":[55,64,143,167,220,273],"study":[56],"dynamic":[57],"routing":[58,210],"connection-oriented":[61],"packet-switching":[62],"network.":[63,315],"consider":[65],"network":[67],"with":[68,182,281],"arbitrary":[69],"topology":[70],"on":[71,111,231],"which":[72],"set":[74],"sessions":[76,128,150],"defined.":[78],"For":[79],"each":[80,152],"session":[81,304,327],"i,":[82],"packets":[83,214,230],"are":[84,215],"injected":[85],"at":[86,106,134,151,164,186,217],"rate":[88,126,305],"ri":[89],"follow":[91],"predetermined":[93],"path":[94,232],"length":[96],"di":[97,235],".":[98,272],"Due":[99],"limited":[101],"bandwidth,":[102],"only":[103,183],"one":[104],"time":[108],"may":[109,117],"advance":[110],"an":[112,203],"edge":[113,132],"(link).":[114],"Session":[115],"paths":[116],"overlap":[118],"subject":[119],"constraint":[122],"total":[125],"using":[129],"any":[130,138],"particular":[131],"$1-\\varepsilon$":[136],"for":[137,194,207,229],"constant":[139],"$\\varepsilon":[140],"\\in":[141],"(0,1)$.":[142],"address":[144],"problem":[146],"scheduling":[148],"switch,":[153],"so":[154],"minimize":[157],"worst-case":[158],"queue":[162],"buildup":[163],"switches.":[166,188],"show":[168],"existence":[170],"periodic":[173,195],"schedule":[174,206],"achieves":[176],"O(1/ri+di)":[181],"constant-size":[184],"queues":[185],"asymptotically":[192,204],"optimal":[193,205],"schedules.":[196],"consequence":[198],"this":[200,336],"result":[201],"static":[209],"problem,":[211],"wherein":[212],"all":[213],"present":[216,275],"outset.":[219],"obtain":[221],"O(ci":[226],"+":[227,262,343],"di)":[228,344],"Pi,":[233],"where":[234,264,298,326],"number":[238,310],"edges":[240,250,312],"Pi":[242],"ci":[244],"maximum":[247],"congestion":[248],"along":[249],"Pi.":[252],"improves":[254],"upon":[255],"previous":[257],"known":[258],"O(c":[261],"d),":[263],"d":[265],"=":[266,270],"maxidi":[267],"c":[269],"maxici":[271],"also":[274],"simple":[277],"distributed":[278],"algorithm":[279],"that,":[280],"high":[282],"probability,":[283],"delivers":[284],"every":[285],"session-i":[286],"destination":[290],"within":[291],"O(1/ri+di\\log(m/rmin":[292],"))":[293],"steps":[294],"injection,":[297],"r":[299],"min":[300],"minimum":[303],"m":[307],"Our":[316],"results":[317],"can":[318],"be":[319],"generalized":[320],"(leaky-bucket":[322],"constrained)":[323],"bursty":[324],"traffic,":[325],"i":[328],"tolerates":[329],"burst":[331],"size":[332],"bi.":[334],"In":[335],"case,":[337],"our":[338],"bounds":[340],"become":[341],"O(bi/ri":[342],"O(bi/ri+di\\log(m/rmin":[346],")),":[347],"respectively.":[348]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}