{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:20:48Z","timestamp":1740133248914,"version":"3.37.3"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1109\/tnet.2022.3174118","type":"journal-article","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T20:24:10Z","timestamp":1652991850000},"page":"2419-2432","source":"Crossref","is-referenced-by-count":2,"title":["Push-Down Trees: Optimal Self-Adjusting Complete Trees"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-6647-8002","authenticated-orcid":false,"given":"Chen","family":"Avin","sequence":"first","affiliation":[{"name":"School of Electrical and Computer Engineering, Ben Gurion University of the Negev, Be’er Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-9606-9293","authenticated-orcid":false,"given":"Kaushik","family":"Mondal","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Ropar, Rupnagar, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"INET, Faculty IV (EECS), TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.19"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098836"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626328"},{"key":"ref32","article-title":"A survey of reconfigurable optical networks","author":"hall","year":"2021","journal-title":"Optical Switching and Networking"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592577"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3489048.3522635"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644918"},{"key":"ref36","article-title":"Flyways to de-congest data center networks","author":"kandula","year":"2009","journal-title":"Proc The 10th ACM Workshop on Hot Topics in Networks (Hotnets)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1136-8"},{"key":"ref34","article-title":"Reconfigurable optical networks will move supercomputerdata 100x faster","author":"hampson","year":"2021","journal-title":"Proc IEEE Spectr"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9489-2"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3351452.3351464"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934911"},{"key":"ref2","first-page":"199","article-title":"A competitive analysis of the list update problem with lookahead","author":"albers","year":"1994","journal-title":"Mathematical Foundations of Computer Science"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2253120"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1233341.1233413"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref21"},{"article-title":"A lower bound framework for binary search trees with rotations","year":"2005","author":"derryberry","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447347"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3230718.3230722"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2021.3075326"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/1868447.1868455"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/2377677.2377761"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/1963559.1963561"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658943"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/0218004"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90150-8"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1364\/JOCN.379487"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"},{"key":"ref10","first-page":"1","article-title":"Toward demand-aware networking: A theory for self-adjusting networks","author":"avin","year":"2018","journal-title":"Proc ACM SIGCOMM Comput Commun Rev (CCR)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3310165.3310170"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461786"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.3"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3406221"},{"key":"ref14","first-page":"1","article-title":"Static optimality and dynamic search-optimality in lists and trees","author":"blum","year":"2002","journal-title":"Proc 17th Ann ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref15","first-page":"75","article-title":"Costly circuits, submodular schedules and approximate carathéodory theorems","author":"venkatakrishnan","year":"2016","journal-title":"Proc ACM Sigmetrics Int Conf Meas Model Comput Sci"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13731-0_5"},{"key":"ref17","first-page":"1106","article-title":"Dynamic optimality for skip lists and b-trees","author":"bose","year":"2008","journal-title":"Proc 17th Ann ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.32"},{"key":"ref19","article-title":"The landscape of bounds for binary search trees","author":"chalermsook","year":"2016","journal-title":"arXiv 1603 04892"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00142-Y"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00230-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394205"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029563"},{"key":"ref8","first-page":"1","article-title":"Demand-aware network designs of bounded degree","author":"avin","year":"2017","journal-title":"Proc Int Symp Distrib Comput (DISC)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-019-00351-5"},{"key":"ref49","first-page":"17","article-title":"Jellyfish: Networking data centers, randomly","volume":"12","author":"singla","year":"2012","journal-title":"Proc USENIX Symp Networked Syst Design Implement (NSDI)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737431"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2410313"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737417"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787508"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-34675-5"},{"key":"ref42","first-page":"1","article-title":"Expanding across time to deliver bandwidth efficiency and low latency","author":"mellette","year":"2020","journal-title":"Proc 17th USENIX Symp Netw Syst Design Implement ([NSDI )"},{"key":"ref41","first-page":"399","article-title":"F10: A fault-tolerant engineered network","author":"liu","year":"2013","journal-title":"Proc 10th USENIX Symp Netw Syst Design Implement ( NSDI )"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2021.102238"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098838"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/90\/9990997\/09778214.pdf?arnumber=9778214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T19:19:06Z","timestamp":1673896746000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/document\/9778214\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":58,"journal-issue":{"issue":"6"},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/tnet.2022.3174118","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2022,12]]}}}