{"id":"https://openalex.org/W3165668704","doi":"https://doi.org/10.1145/3465456.3467626","title":"Convergence of a Packet Routing Model to Flows Over Time","display_name":"Convergence of a Packet Routing Model to Flows Over Time","publication_year":2021,"publication_date":"2021-07-18","ids":{"openalex":"https://openalex.org/W3165668704","doi":"https://doi.org/10.1145/3465456.3467626","mag":"3165668704"},"language":"en","primary_location":{"id":"doi:10.1145/3465456.3467626","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3465456.3467626","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM Conference on Economics and Computation","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":null,"display_name":"Leon Sering","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Leon Sering","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Laura Vargas Koch","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Laura Vargas Koch","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":null,"display_name":"Theresa Ziemke","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Theresa Ziemke","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":1.2652,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.82394553,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"797","last_page":"816"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.61080002784729},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5911999940872192},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5764999985694885},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5687999725341797},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.43860000371932983},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.430400013923645},{"id":"https://openalex.org/keywords/dsrflow","display_name":"DSRFLOW","score":0.4302999973297119},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4099999964237213},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.39629998803138733}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6492999792098999},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.61080002784729},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5911999940872192},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5764999985694885},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5687999725341797},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.43860000371932983},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.430400013923645},{"id":"https://openalex.org/C193794138","wikidata":"https://www.wikidata.org/wiki/Q5206182","display_name":"DSRFLOW","level":5,"score":0.4302999973297119},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4099999964237213},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4036000072956085},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.39629998803138733},{"id":"https://openalex.org/C44010500","wikidata":"https://www.wikidata.org/wiki/Q1422567","display_name":"Source routing","level":5,"score":0.3716999888420105},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.33640000224113464},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.32919999957084656},{"id":"https://openalex.org/C120317029","wikidata":"https://www.wikidata.org/wiki/Q874048","display_name":"Packet forwarding","level":3,"score":0.32120001316070557},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.3091999888420105},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3091000020503998},{"id":"https://openalex.org/C113508815","wikidata":"https://www.wikidata.org/wiki/Q193446","display_name":"Packet switching","level":3,"score":0.30820000171661377},{"id":"https://openalex.org/C2779313249","wikidata":"https://www.wikidata.org/wiki/Q7371615","display_name":"Flow routing","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.298799991607666},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.2928999960422516},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.2827000021934509},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C94600068","wikidata":"https://www.wikidata.org/wiki/Q7371621","display_name":"Routing domain","level":5,"score":0.26409998536109924},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2632000148296356},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3465456.3467626","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3465456.3467626","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM Conference on Economics and Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W32611880","https://openalex.org/W1966911053","https://openalex.org/W1972868509","https://openalex.org/W1993107764","https://openalex.org/W2007051395","https://openalex.org/W2019300822","https://openalex.org/W2039657689","https://openalex.org/W2106700782","https://openalex.org/W2177295793","https://openalex.org/W2794149032","https://openalex.org/W2962924813","https://openalex.org/W2963900600","https://openalex.org/W3021661673","https://openalex.org/W3101642740","https://openalex.org/W3127749509","https://openalex.org/W3161098815"],"related_works":[],"abstract_inverted_index":{"The":[0],"mathematical":[1,198,213],"approaches":[2,38],"for":[3,211,215],"modeling":[4],"dynamic":[5],"traffic":[6],"can":[7],"roughly":[8],"be":[9,158],"divided":[10],"into":[11],"two":[12],"categories:":[13],"discrete":[14,60],"packet":[15,55,98,106,137,167],"routing":[16,56,107,138,168],"models":[17,30],"and":[18,65,67,100,208],"continuous":[19],"flow":[20,64,111],"over":[21,79,112],"time":[22,80,101,113],"models.":[23],"Despite":[24],"very":[25,174],"vital":[26],"research":[27],"activities":[28],"on":[29,180],"in":[31,61,104,131,160],"both":[32],"categories,":[33],"the":[34,73,89,92,97,105,122,126,132,136,161,165,181,186,192,196],"connection":[35,50],"between":[36],"these":[37],"was":[39],"poorly":[40],"understood":[41],"so":[42],"far.":[43],"In":[44,117],"this":[45,49,201],"work":[46,194],"we":[47,86,119],"build":[48],"by":[51,68],"specifying":[52],"a":[53,110,205],"(competitive)":[54],"model,":[57,108],"which":[58],"is":[59,141,173,178,195],"terms":[62],"of":[63,77,91,128,135,142,185,200],"time,":[66],"proving":[69],"its":[70],"convergence":[71,93,123],"to":[72,151],"intensively":[74],"studied":[75],"model":[76,169],"flows":[78],"with":[81,114,170],"deterministic":[82,171],"queuing.":[83],"More":[84],"precisely,":[85],"prove":[87],"that":[88,121],"limit":[90],"process,":[94],"when":[95],"decreasing":[96],"size":[99],"step":[102],"length":[103],"constitutes":[109],"multiple":[115],"commodities.":[116],"addition,":[118],"show":[120],"result":[124],"implies":[125],"existence":[127],"approximate":[129],"equilibria":[130],"competitive":[133,155],"version":[134],"model.":[139],"This":[140],"significant":[143],"interest":[144],"as":[145,176],"exact":[146],"pure":[147],"Nash":[148],"equilibria,":[149],"similar":[150],"almost":[152],"all":[153],"other":[154],"models,":[156],"cannot":[157],"guaranteed":[159],"multi-commodity":[162],"setting.":[163],"Moreover,":[164],"introduced":[166],"queuing":[172],"application-oriented":[175],"it":[177,203],"based":[179],"network":[182],"loading":[183],"module":[184],"agent-based":[187],"transport":[188],"simulation":[189],"MATSim.":[190,216],"As":[191],"present":[193],"first":[197],"formalization":[199],"simulation,":[202],"provides":[204],"theoretical":[206],"foundation":[207],"an":[209],"environment":[210],"provable":[212],"statements":[214]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2021-06-07T00:00:00"}