{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T04:40:48Z","timestamp":1786509648431,"version":"build-2736575974"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T00:00:00Z","timestamp":1548633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2019,1,28]]},"abstract":"<jats:p>The physical topology is emerging as the next frontier in an ongoing effort to render communication networks more flexible. While first empirical results indicate that these flexibilities can be exploited to reconfigure and optimize the network toward the workload it serves and, e.g., providing the same bandwidth at lower infrastructure cost, only little is known today about the fundamental algorithmic problems underlying the design of reconfigurable networks. This paper initiates the study of the theory of demand-aware, self-adjusting networks. Our main position is that self-adjusting networks should be seen through the lense of self-adjusting datastructures. Accordingly, we present a taxonomy classifying the different algorithmic models of demand-oblivious, fixed demand-aware, and reconfigurable demand-aware networks, introduce a formal model, and identify objectives and evaluation metrics. We also demonstrate, by examples, the inherent advantage of demand-aware networks over state-of-the-art demand-oblivious, fixed networks (such as expanders). We conclude by observing that the usefulness of self-adjusting networks depends on the spatial and temporal locality of the demand; as relevant data is scarce, we call for community action.<\/jats:p>","DOI":"10.1145\/3310165.3310170","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T13:16:22Z","timestamp":1548767782000},"page":"31-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":54,"title":["Toward demand-aware networking"],"prefix":"10.1145","volume":"48","author":[{"given":"Chen","family":"Avin","sequence":"first","affiliation":[{"name":"Ben Gurion University, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"University of Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,1,28]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Datacenter traffic control: Understanding techniques and trade-offs,\" IEEE Communications Surveys & Tutorials","author":"Noormohammadpour M.","year":"2017","unstructured":"M. Noormohammadpour and C. S. Raghavendra , \" Datacenter traffic control: Understanding techniques and trade-offs,\" IEEE Communications Surveys & Tutorials , 2017 . M. Noormohammadpour and C. S. Raghavendra, \"Datacenter traffic control: Understanding techniques and trade-offs,\" IEEE Communications Surveys & Tutorials, 2017."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2378956.2378964"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524466"},{"key":"e_1_2_1_4_1","first-page":"583","article-title":"Scaling distributed machine learning with the parameter server","volume":"14","author":"Mu Li","year":"2014","unstructured":"Mu Li et al ., \" Scaling distributed machine learning with the parameter server .,\" in Proc. USENIX OSDI , vol. 14 , pp. 583 -- 598 , 2014 . Mu Li et al., \"Scaling distributed machine learning with the parameter server.,\" in Proc. USENIX OSDI, vol. 14, pp. 583--598, 2014.","journal-title":"Proc. USENIX OSDI"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787508"},{"key":"e_1_2_1_6_1","volume-title":"Forecast and methodology","author":"Cisco","year":"2015","unstructured":"Cisco, \" Cisco global cloud index : Forecast and methodology , 2015 --2020,\" White Paper , 2015. Cisco, \"Cisco global cloud index: Forecast and methodology, 2015--2020,\" White Paper, 2015."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3005745.3005747"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592577"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658943"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098836"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851223"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098838"},{"key":"e_1_2_1_14_1","first-page":"1","volume-title":"USENIX Symposium on Networked Systems Design and Implementation (NSDI)","volume":"14","author":"Liu H.","year":"2014","unstructured":"H. Liu , F. Lu , A. Forencich , R. Kapoor , M. Tewari , G. M. Voelker , G. Papen , A. C. Snoeren , and G. Porter , \" Circuit switching under the radar with reactor.,\" in Proc . USENIX Symposium on Networked Systems Design and Implementation (NSDI) , vol. 14 , pp. 1 -- 15 , 2014 . H. Liu, F. Lu, A. Forencich, R. Kapoor, M. Tewari, G. M. Voelker, G. Papen, A. C. Snoeren, and G. Porter, \"Circuit switching under the radar with reactor.,\" in Proc. USENIX Symposium on Networked Systems Design and Implementation (NSDI), vol. 14, pp. 1--15, 2014."},{"key":"e_1_2_1_15_1","volume-title":"Integrating microsecond circuit switching into the data center","author":"Farrington G. P. R. S. N.","year":"2013","unstructured":"G. P. R. S. N. Farrington , A. F. P. Chen-Sun , T. R. Y. F. G. Papen , and A. Vahdat , \" Integrating microsecond circuit switching into the data center ,\" 2013 . G. P. R. S. N. Farrington, A. F. P. Chen-Sun, T. R. Y. F. G. Papen, and A. Vahdat, \"Integrating microsecond circuit switching into the data center,\" 2013."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342440"},{"key":"e_1_2_1_17_1","volume-title":"ACM Workshop on Hot Topics in Networks (HotNets)","author":"Kandula S.","year":"2009","unstructured":"S. Kandula , J. Padhye , and P. Bahl , \" Flyways to de-congest data center networks,\" in Proc . ACM Workshop on Hot Topics in Networks (HotNets) , 2009 . S. Kandula, J. Padhye, and P. Bahl, \"Flyways to de-congest data center networks,\" in Proc. ACM Workshop on Hot Topics in Networks (HotNets), 2009."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626328"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934911"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868447.1868455"},{"key":"e_1_2_1_21_1","volume-title":"IEEE INFOCOM","author":"Jia S.","year":"2017","unstructured":"S. Jia , X. Jin , G. Ghasemiesfeh , J. Ding , and J. Gao , \" Competitive analysis for online scheduling in software-defined optical wan,\" in Proc . IEEE INFOCOM , 2017 . S. Jia, X. Jin, G. Ghasemiesfeh, J. Ding, and J. Gao, \"Competitive analysis for online scheduling in software-defined optical wan,\" in Proc. IEEE INFOCOM, 2017."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018442"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2253120"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264563"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264289"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0121057"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214041"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447347"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1070838.1070856"},{"key":"e_1_2_1_31_1","volume-title":"Expander graphs and their applications,\" ulletin of the American Mathematical Society","author":"Hoory S.","year":"2006","unstructured":"S. Hoory , N. Linial , and A. Wigderson , \" Expander graphs and their applications,\" ulletin of the American Mathematical Society , vol. 43 , 2006 . S. Hoory, N. Linial, and A. Wigderson, \"Expander graphs and their applications,\" ulletin of the American Mathematical Society, vol. 43, 2006."},{"key":"e_1_2_1_32_1","volume-title":"International Symposium on Distributed Computing (DISC)","author":"Avin C.","year":"2017","unstructured":"C. Avin , K. Mondal , and S. Schmid , \" Demand-aware network designs of bounded degree,\" in Proc . International Symposium on Distributed Computing (DISC) , 2017 . C. Avin, K. Mondal, and S. Schmid, \"Demand-aware network designs of bounded degree,\" in Proc. International Symposium on Distributed Computing (DISC), 2017."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934904"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_47"},{"key":"e_1_2_1_35_1","first-page":"1190","volume-title":"IEEE INFOCOM","volume":"3","author":"Ratnasamy S.","year":"2002","unstructured":"S. Ratnasamy , M. Handley , R. Karp , and S. Shenker , \" Topologically aware overlay construction and server selection,\" in Proc . IEEE INFOCOM , vol. 3 , pp. 1190 -- 1199 , 2002 . S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, \"Topologically aware overlay construction and server selection,\" in Proc. IEEE INFOCOM, vol. 3, pp. 1190--1199, 2002."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2096149.2096152"},{"key":"e_1_2_1_37_1","volume-title":"30th International Symposium on Distributed Computing (DISC)","author":"Avin C.","year":"2016","unstructured":"C. Avin , A. Loukas , M. Pacut , and S. Schmid , \" Online balanced repartitioning,\" in Proc . 30th International Symposium on Distributed Computing (DISC) , 2016 . C. Avin, A. Loukas, M. Pacut, and S. Schmid, \"Online balanced repartitioning,\" in Proc. 30th International Symposium on Distributed Computing (DISC), 2016."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/568522.568523"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking.2018.8696623"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993854"},{"key":"e_1_2_1_41_1","volume-title":"IFIP Networking","author":"Rost M.","year":"2018","unstructured":"M. Rost and S. Schmid , \" Charting the complexity landscape of virtual network embeddings,\" in Proc . IFIP Networking , 2018 . M. Rost and S. Schmid, \"Charting the complexity landscape of virtual network embeddings,\" in Proc. IFIP Networking, 2018."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2410313"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230718.3230722"},{"key":"e_1_2_1_44_1","volume-title":"rdan: Toward robust demand-aware network designs,\" in Information Processing Letters (IPL)","author":"Avin C.","year":"2018","unstructured":"C. Avin , A. Hercules , A. Loukas , and S. Schmid , \" rdan: Toward robust demand-aware network designs,\" in Information Processing Letters (IPL) , 2018 . C. Avin, A. Hercules, A. Loukas, and S. Schmid, \"rdan: Toward robust demand-aware network designs,\" in Information Processing Letters (IPL), 2018."},{"key":"e_1_2_1_45_1","article-title":"Splaynet: Towards locally self-adjusting networks","author":"Schmid S.","unstructured":"S. Schmid , C. Avin , C. Scheideler , M. Borokhovich , B. Haeupler , and Z. Lotker , \" Splaynet: Towards locally self-adjusting networks ,\" IEEE\/ACM Transactions on Networking (ToN), to appear. S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, and Z. Lotker, \"Splaynet: Towards locally self-adjusting networks,\" IEEE\/ACM Transactions on Networking (ToN), to appear.","journal-title":"IEEE\/ACM Transactions on Networking (ToN), to appear."},{"key":"e_1_2_1_46_1","volume-title":"International Symposium on Distributed Computing (DISC)","author":"Peres B.","year":"2017","unstructured":"B. Peres , O. Goussevskaia , S. Schmid , and C. Avin , \" Concurrent self-adjusting distributed tree networks,\" in Proc . International Symposium on Distributed Computing (DISC) , 2017 . B. Peres, O. Goussevskaia, S. Schmid, and C. Avin, \"Concurrent self-adjusting distributed tree networks,\" in Proc. International Symposium on Distributed Computing (DISC), 2017."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787472"},{"key":"e_1_2_1_48_1","volume-title":"Repetita: Repeatable experiments for performance evaluation of traffic-engineering algorithms,\" arXiv preprint arXiv:1710.08665","author":"Gay S.","year":"2017","unstructured":"S. Gay , P. Schaus , and S. Vissicchio , \" Repetita: Repeatable experiments for performance evaluation of traffic-engineering algorithms,\" arXiv preprint arXiv:1710.08665 , 2017 . S. Gay, P. Schaus, and S. Vissicchio, \"Repetita: Repeatable experiments for performance evaluation of traffic-engineering algorithms,\" arXiv preprint arXiv:1710.08665, 2017."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3310165.3310170","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3310165.3310170","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:15Z","timestamp":1750212795000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3310165.3310170"}},"subtitle":["a theory for self-adjusting networks"],"short-title":[],"issued":{"date-parts":[[2019,1,28]]},"references-count":49,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,1,28]]}},"alternative-id":["10.1145\/3310165.3310170"],"URL":"https:\/\/doi.org\/10.1145\/3310165.3310170","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2019,1,28]]},"assertion":[{"value":"2019-01-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}