Brief announcement: On self-adjusting skip list networks

Chen Avin, Iosif Salem, Stefan Schmid

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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.

Original languageEnglish
Title of host publication33rd International Symposium on Distributed Computing, DISC 2019
EditorsJukka Suomela
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771269
DOIs
StatePublished - 1 Oct 2019
Event33rd International Symposium on Distributed Computing, DISC 2019 - Budapest, Hungary
Duration: 14 Oct 201918 Oct 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume146
ISSN (Print)1868-8969

Conference

Conference33rd International Symposium on Distributed Computing, DISC 2019
Country/TerritoryHungary
CityBudapest
Period14/10/1918/10/19

Keywords

  • Online algorithms
  • Self-adjusting networks
  • Skip lists
  • Working set

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Brief announcement: On self-adjusting skip list networks'. Together they form a unique fingerprint.

Cite this