{"id":"https://openalex.org/W2864233770","doi":"https://doi.org/10.1109/tnet.2022.3174118","title":"Push-Down Trees: Optimal Self-Adjusting Complete Trees","display_name":"Push-Down Trees: Optimal Self-Adjusting Complete Trees","publication_year":2022,"publication_date":"2022-05-19","ids":{"openalex":"https://openalex.org/W2864233770","doi":"https://doi.org/10.1109/tnet.2022.3174118","mag":"2864233770"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2022.3174118","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2022.3174118","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/A5010846539","display_name":"Chen Avin","orcid":"https://orcid.org/0000-0002-6647-8002"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Chen Avin","raw_affiliation_strings":["School of Electrical and Computer Engineering, Ben Gurion University of the Negev, Be’er Sheva, Israel"],"raw_orcid":"https://orcid.org/0000-0002-6647-8002","affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Ben Gurion University of the Negev, Be’er Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059765803","display_name":"Kaushik Mondal","orcid":"https://orcid.org/0000-0002-9606-9293"},"institutions":[{"id":"https://openalex.org/I119241673","display_name":"Indian Institute of Technology Ropar","ror":"https://ror.org/02qkhhn56","country_code":"IN","type":"education","lineage":["https://openalex.org/I119241673"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kaushik Mondal","raw_affiliation_strings":["Department of Mathematics, Indian Institute of Technology Ropar, Rupnagar, India"],"raw_orcid":"https://orcid.org/0000-0002-9606-9293","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology Ropar, Rupnagar, India","institution_ids":["https://openalex.org/I119241673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066080641","display_name":"Stefan Schmid","orcid":"https://orcid.org/0000-0002-7798-1711"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]},{"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":["AT","DE"],"is_corresponding":false,"raw_author_name":"Stefan Schmid","raw_affiliation_strings":["INET, Faculty IV (EECS), TU Berlin, Berlin, Germany","Faculty of Computer Science, University of Vienna, Vienna, Austria"],"raw_orcid":"https://orcid.org/0000-0002-7798-1711","affiliations":[{"raw_affiliation_string":"INET, Faculty IV (EECS), TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"Faculty of Computer Science, University of Vienna, Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4008,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.5857469,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"30","issue":"6","first_page":"2419","last_page":"2432"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994000196456909,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.7957868576049805},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7162755727767944},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.6579182147979736},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5682143568992615},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5379666686058044},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5350825190544128},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5086577534675598},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4875738024711609},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4784450829029083},{"id":"https://openalex.org/keywords/tree-network","display_name":"Tree network","score":0.47000652551651},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4374486804008484},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.42916956543922424},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4223971366882324},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3728235960006714},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30313172936439514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16020864248275757},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14542105793952942}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7957868576049805},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7162755727767944},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.6579182147979736},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5682143568992615},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5379666686058044},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5350825190544128},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5086577534675598},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4875738024711609},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4784450829029083},{"id":"https://openalex.org/C2781010653","wikidata":"https://www.wikidata.org/wiki/Q12056602","display_name":"Tree network","level":3,"score":0.47000652551651},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4374486804008484},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.42916956543922424},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4223971366882324},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3728235960006714},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30313172936439514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16020864248275757},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14542105793952942},{"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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnet.2022.3174118","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2022.3174118","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":[{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":72,"referenced_works":["https://openalex.org/W1492304870","https://openalex.org/W1543942291","https://openalex.org/W1565963762","https://openalex.org/W1857009450","https://openalex.org/W1864036958","https://openalex.org/W1956214747","https://openalex.org/W1979499253","https://openalex.org/W1989791077","https://openalex.org/W2006254254","https://openalex.org/W2016857845","https://openalex.org/W2017036528","https://openalex.org/W2017619076","https://openalex.org/W2019174300","https://openalex.org/W2029413772","https://openalex.org/W2040706084","https://openalex.org/W2041645394","https://openalex.org/W2062832101","https://openalex.org/W2083051477","https://openalex.org/W2099111195","https://openalex.org/W2101352979","https://openalex.org/W2103885358","https://openalex.org/W2124700175","https://openalex.org/W2130055503","https://openalex.org/W2130531694","https://openalex.org/W2131695772","https://openalex.org/W2141810662","https://openalex.org/W2173777449","https://openalex.org/W2300956567","https://openalex.org/W2315437335","https://openalex.org/W2418208970","https://openalex.org/W2478708596","https://openalex.org/W2486960733","https://openalex.org/W2614467483","https://openalex.org/W2743429249","https://openalex.org/W2744462874","https://openalex.org/W2810723790","https://openalex.org/W2819181356","https://openalex.org/W2918204453","https://openalex.org/W2919562786","https://openalex.org/W2949092636","https://openalex.org/W2962819996","https://openalex.org/W2963809841","https://openalex.org/W3002057986","https://openalex.org/W3006030140","https://openalex.org/W3006074501","https://openalex.org/W3009595907","https://openalex.org/W3046344355","https://openalex.org/W3120138566","https://openalex.org/W3122708175","https://openalex.org/W3137830407","https://openalex.org/W3144786718","https://openalex.org/W3147460469","https://openalex.org/W3159909636","https://openalex.org/W3174005996","https://openalex.org/W3203638966","https://openalex.org/W4232093111","https://openalex.org/W4235670058","https://openalex.org/W4245777296","https://openalex.org/W4281688558","https://openalex.org/W4297816311","https://openalex.org/W4323654125","https://openalex.org/W6629393471","https://openalex.org/W6632490965","https://openalex.org/W6639168177","https://openalex.org/W6645147959","https://openalex.org/W6679509431","https://openalex.org/W6684402220","https://openalex.org/W6698254323","https://openalex.org/W6737734972","https://openalex.org/W6760882819","https://openalex.org/W6763733944","https://openalex.org/W6793088514"],"related_works":["https://openalex.org/W2208110155","https://openalex.org/W1996806106","https://openalex.org/W2781235162","https://openalex.org/W2058681277","https://openalex.org/W2090027528","https://openalex.org/W2047204419","https://openalex.org/W2951573806","https://openalex.org/W2088826026","https://openalex.org/W96431103","https://openalex.org/W4372272740"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"a":[3,33,55,67,103,113,123,134,159],"fundamental":[4],"algorithmic":[5],"problem":[6,52,65],"related":[7],"to":[8,31,81,179],"the":[9,19,36,51,119,156,180,189],"design":[10],"of":[11,38,53,106,182],"demand-aware":[12],"networks:":[13],"networks":[14],"whose":[15],"topologies":[16],"adjust":[17],"toward":[18],"traffic":[20],"patterns":[21],"they":[22],"serve,":[23],"in":[24],"an":[25,142,170,183],"online":[26,88,129],"manner.":[27],"The":[28,64],"goal":[29],"is":[30,66,100,122,176],"strike":[32],"tradeoff":[34],"between":[35],"benefits":[37],"such":[39,141],"adjustments":[40],"(shorter":[41],"routes)":[42],"and":[43,77,95,131,186],"their":[44],"costs":[45],"(reconfigurations).":[46],"In":[47],"particular,":[48],"we":[49],"consider":[50],"designing":[54],"self-adjusting":[56,74,82],"tree":[57,144],"network":[58,75],"which":[59,139],"serves":[60],"single-source,":[61],"multi-destination":[62],"communication.":[63],"central":[68],"building":[69],"block":[70],"for":[71,90,127],"more":[72],"general":[73],"designs":[76],"has":[78],"interesting":[79],"connections":[80],"datastructures.":[83],"We":[84,116],"present":[85,133],"two":[86],"constant-competitive":[87],"algorithms":[89],"this":[91],"problem,":[92],"one":[93,96],"randomized":[94,135],"deterministic.":[97],"Our":[98,162],"approach":[99],"based":[101],"on":[102],"natural":[104],"notion":[105],"Most":[107],"Recently":[108],"Used":[109],"(MRU)":[110],"tree,":[111,157,172,185],"maintaining":[112],"working":[114,120,190],"set.":[115],"prove":[117],"that":[118],"set":[121,191],"cost":[124,175,181],"lower":[125,192],"bound":[126],"any":[128],"algorithm,":[130],"then":[132],"algorithm":[136,164],"RANDOM-":[137],"PUSH":[138],"approximates":[140],"MRU":[143,171,184],"at":[145],"low":[146],"cost,":[147],"by":[148],"pushing":[149],"less":[150],"recently":[151],"used":[152],"communication":[153],"partners":[154],"down":[155],"along":[158],"random":[160],"walk.":[161],"deterministic":[163],"Move-Half":[165],"does":[166],"not":[167],"directly":[168],"maintain":[169],"but":[173],"its":[174],"still":[177],"proportional":[178],"also":[187],"matches":[188],"bound.":[193]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}