@inproceedings{d6ca63fbfabc4cc58e7f059db7b7d445,
title = "Brief announcement: On self-adjusting skip list networks",
abstract = "This paper explores the design of dynamic network topologies which adjust to the workload they serve, in an online manner. Such self-adjusting networks (SANs) are enabled by emerging optical technologies, and can be found, e.g., in datacenters. SANs can be used to reduce routing costs by moving frequently communicating nodes topologically closer. This paper presents SANs which provide, for the first time, provable working set guarantees: the routing cost between node pairs is proportional to how recently these nodes communicated last time. Our SANs rely on skip lists (which serve as the topology) and provide additional interesting properties such as local routing.",
keywords = "Online algorithms, Self-adjusting networks, Skip lists, Working set",
author = "Chen Avin and Iosif Salem and Stefan Schmid",
note = "Publisher Copyright: {\textcopyright} Chen Avin, Iosif Salem, and Stefan Schmid.; 33rd International Symposium on Distributed Computing, DISC 2019 ; Conference date: 14-10-2019 Through 18-10-2019",
year = "2019",
month = oct,
day = "8",
doi = "10.4230/LIPIcs.DISC.2019.35",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "35:1----35:3",
editor = "Jukka Suomela",
booktitle = "33rd International Symposium on Distributed Computing, DISC 2019",
address = "Germany",
}