{"id":"https://openalex.org/W2060934803","doi":"https://doi.org/10.1145/2755573.2755588","title":"Better Deterministic Online Packet Routing on Grids","display_name":"Better Deterministic Online Packet Routing on Grids","publication_year":2015,"publication_date":"2015-06-12","ids":{"openalex":"https://openalex.org/W2060934803","doi":"https://doi.org/10.1145/2755573.2755588","mag":"2060934803"},"language":"en","primary_location":{"id":"doi:10.1145/2755573.2755588","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2755573.2755588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures","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/A5064059676","display_name":"Guy Even","orcid":"https://orcid.org/0000-0001-5407-330X"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Guy Even","raw_affiliation_strings":["Tel Aviv Univ., Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel Aviv Univ., Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007248799","display_name":"Moti Medina","orcid":"https://orcid.org/0000-0002-5572-3754"},"institutions":[{"id":"https://openalex.org/I4210094115","display_name":"Laboratoire d'Informatique Algorithmique: Fondements et Applications","ror":"https://ror.org/00pbqgm18","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Moti Medina","raw_affiliation_strings":["LIAFA, Universit\u00e9 Paris Diderot, Paris, France"],"affiliations":[{"raw_affiliation_string":"LIAFA, Universit\u00e9 Paris Diderot, Paris, France","institution_ids":["https://openalex.org/I4210094115","https://openalex.org/I204730241"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016261142","display_name":"Boaz Patt-Shamir","orcid":"https://orcid.org/0000-0001-8398-8218"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Boaz Patt-Shamir","raw_affiliation_strings":["Tel Aviv Univ., Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel Aviv Univ., Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5064059676"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":1.3993,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.8409144,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"284","last_page":"293"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","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/T12288","display_name":"Optimization and Search Problems","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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9987999796867371,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9980999827384949,"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.773256778717041},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7683368921279907},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7356284856796265},{"id":"https://openalex.org/keywords/dsrflow","display_name":"DSRFLOW","score":0.6791839003562927},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5943397283554077},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5760610699653625},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5464004278182983},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5435043573379517},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5279231071472168},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.4824683964252472},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.44399896264076233},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36932530999183655},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.3049788475036621},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.29402726888656616},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.19976940751075745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19809779524803162},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.15289068222045898},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.06644779443740845}],"concepts":[{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.773256778717041},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7683368921279907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7356284856796265},{"id":"https://openalex.org/C193794138","wikidata":"https://www.wikidata.org/wiki/Q5206182","display_name":"DSRFLOW","level":5,"score":0.6791839003562927},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5943397283554077},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5760610699653625},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5464004278182983},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5435043573379517},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5279231071472168},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.4824683964252472},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.44399896264076233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36932530999183655},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.3049788475036621},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.29402726888656616},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.19976940751075745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19809779524803162},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.15289068222045898},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.06644779443740845},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2755573.2755588","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2755573.2755588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.mpg.de:item_2395440","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-002C-62C1-4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1479750681","https://openalex.org/W1510288372","https://openalex.org/W1518321476","https://openalex.org/W1521788396","https://openalex.org/W1571253810","https://openalex.org/W1978600208","https://openalex.org/W1984290406","https://openalex.org/W1991616475","https://openalex.org/W2022758041","https://openalex.org/W2063643261","https://openalex.org/W2121839513","https://openalex.org/W2124548639","https://openalex.org/W2127811362","https://openalex.org/W2139739478","https://openalex.org/W2142339200","https://openalex.org/W2157099159","https://openalex.org/W4206478994"],"related_works":["https://openalex.org/W2058681277","https://openalex.org/W2087343661","https://openalex.org/W2951573806","https://openalex.org/W1996806106","https://openalex.org/W2090027528","https://openalex.org/W1963663039","https://openalex.org/W2208110155","https://openalex.org/W4241266436","https://openalex.org/W96431103","https://openalex.org/W2047204419"],"abstract_inverted_index":{"We":[0,96,163],"consider":[1],"the":[2,40,102,142],"following":[3],"fundamental":[4],"routing":[5,41],"problem.":[6],"An":[7],"adversary":[8],"inputs":[9],"packets":[10,30,51,93],"arbitrarily":[11],"at":[12,34,81,90],"sources,":[13],"each":[14],"packet":[15,147],"with":[16,126],"an":[17,61,67],"arbitrary":[18],"destination.":[19,56],"Traffic":[20],"is":[21,43,60,101,148,156],"constrained":[22],"by":[23],"link":[24],"capacities":[25],"and":[26,29,85,115,129,158],"buffer":[27],"sizes,":[28],"may":[31],"be":[32,161],"dropped":[33,150],"any":[35,176],"time.":[36],"The":[37,118],"goal":[38],"of":[39],"algorithm":[42,65,122,136,170,174],"to":[44,54,160,167,171],"maximize":[45],"throughput,":[46],"i.e.,":[47],"route":[48],"as":[49,52],"many":[50],"possible":[53],"their":[55],"Our":[57,135],"main":[58],"result":[59],"O(log":[62,99],"n)-competitive":[63],"deterministic":[64,121],"for":[66,107,123,175],"n-node":[68],"uni-directional":[69,178],"line":[70],"network":[71],"(i.e.,":[72],"1-dimensional":[73],"grid),":[74],"requiring":[75],"only":[76],"that":[77,86,98,144],"buffers":[78,114,128],"can":[79,88],"store":[80],"least":[82,91],"5":[83,92],"packets,":[84],"links":[87,131],"deliver":[89],"per":[94],"step.":[95],"note":[97],"n)":[100],"best":[103,119],"ratio":[104],"known,":[105],"even":[106,110],"randomized":[108],"algorithms,":[109],"when":[111],"allowed":[112],"large":[113],"wide":[116],"links.":[117],"previous":[120],"this":[124],"problem":[125],"constant-size":[127],"constant-capacity":[130],"was":[132],"O(log5":[133],"n)-competitive.":[134],"works":[137],"like":[138],"admission-control":[139],"algorithms":[140],"in":[141],"sense":[143],"if":[145],"a":[146,172],"not":[149],"immediately":[151],"upon":[152],"arrival,":[153],"then":[154],"it":[155],"\"accepted\"":[157],"guaranteed":[159],"delivered.":[162],"also":[164],"show":[165],"how":[166],"extend":[168],"our":[169],"polylog-competitive":[173],"constant-dimension":[177],"grid.":[179]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}