Brief Announcement: On Self-Adjusting Skip List Networks

Avin, Chen; Salem, Iosif; Schmid, Stefan

doi:10.4230/LIPIcs.DISC.2019.35

File

LIPIcs.DISC.2019.35.pdf

Filesize: 386 kB
3 pages

Document Identifiers

DOI: 10.4230/LIPIcs.DISC.2019.35
URN: urn:nbn:de:0030-drops-113423

Author Details

Chen Avin

Communication Systems Engineering Department, Ben Gurion University of the Negev, Beersheva, Israel

Iosif Salem

Faculty of Computer Science, University of Vienna, Austria

Stefan Schmid

Faculty of Computer Science, University of Vienna, Austria

Cite AsGet BibTex

Chen Avin, Iosif Salem, and Stefan Schmid. Brief Announcement: On Self-Adjusting Skip List Networks. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 35:1-35:3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.DISC.2019.35

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.

Subject Classification

ACM Subject Classification

Networks → Topology analysis and generation

Keywords

self-adjusting networks
skip lists
working set
online algorithms

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

References

Chen Avin and Stefan Schmid. Toward demand-aware networking: a theory for self-adjusting networks. ACM SIGCOMM Computer Communication Review, 48(5):31-40, 2019.
Amitabha Bagchi, Adam L Buchsbaum, and Michael T Goodrich. Biased skip lists. Algorithmica, 42(1):31-48, 2005.
Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, and S Muthukrishnan. A data structure for a sequence of string accesses in external memory. ACM TALG, 3(1):6, 2007.
William Pugh. Skip lists: a probabilistic alternative to balanced trees. Communications of the ACM, 33(6):668-676, 1990.
Stefan Schmid et al. Splaynet: Towards locally self-adjusting networks. IEEE/ACM Transactions on Networking (TON), 24(3):1421-1433, 2016.