Abstract
Emerging networked systems become increasingly flexible and “reconfigurable”. This introduces an opportunity to adjust networked systems in a demand-aware manner, leveraging spatial and temporal locality in the workload for online optimizations. However, it also introduces a tradeoff: while more frequent adjustments can improve performance, they also entail higher reconfiguration costs.
This paper initiates the formal study of linear networks which self-adjust to the demand in an online manner, striking a balance between the benefits and costs of reconfigurations. We show that the underlying algorithmic problem can be seen as a distributed generalization of the classic dynamic list update problem known from self-adjusting datastructures: in a network, requests can occur between node pairs. This distributed version turns out to be significantly harder than the classical problem in generalizes. Our main results are a \(\varOmega (\log {n})\) lower bound on the competitive ratio, and a (distributed) online algorithm that is \(\mathcal {O}(\log {n})\)-competitive if the communication requests are issued according to a linear order.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Avin, C., Loukas, A., Pacut, M., Schmid, S.: Online balanced repartitioning. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 243–256. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53426-7_18
Avin, C., Schmid, S.: Toward demand-aware networking: a theory for self-adjusting networks. In: ACM SIGCOMM Computer Communication Review (CCR) (2018)
Ghobadi, M., et al.: Projector: agile reconfigurable data center interconnect. In: Proceedings of ACM SIGCOMM, pp. 216–229 (2016)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Avin, C., van Duijn, I., Schmid, S. (2019). Self-adjusting Linear Networks. In: Censor-Hillel, K., Flammini, M. (eds) Structural Information and Communication Complexity. SIROCCO 2019. Lecture Notes in Computer Science(), vol 11639. Springer, Cham. https://doi.org/10.1007/978-3-030-24922-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-24922-9_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-24921-2
Online ISBN: 978-3-030-24922-9
eBook Packages: Computer ScienceComputer Science (R0)