SplayNet: Towards locally self-adjusting networks

Stefan Schmid, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker

Research output: Contribution to journalArticlepeer-review

27 Scopus citations

Abstract

This paper initiates the study of locally self-adjusting networks: networks whose topology adapts dynamically and in a decentralized manner, to the communication pattern \sigma. Our vision can be seen as a distributed generalization of the self-adjusting datastructures introduced by Sleator and Tarjan, 1985: In contrast to their splay trees which dynamically optimize the lookup costs from a single node (namely the tree root), we seek to minimize the routing cost between arbitrary communication pairs in the network. As a first step, we study distributed binary search trees (BSTs), which are attractive for their support of greedy routing. We introduce a simple model which captures the fundamental tradeoff between the benefits and costs of self-adjusting networks. We present the SplayNet algorithm and formally analyze its performance, and prove its optimality in specific case studies. We also introduce lower bound techniques based on interval cuts and edge expansion, to study the limitations of any demand-optimized network. Finally, we extend our study to multi-tree networks, and highlight an intriguing difference between classic and distributed splay trees.

Original languageEnglish
Article number7066977
Pages (from-to)1421-1433
Number of pages13
JournalIEEE/ACM Transactions on Networking
Volume24
Issue number3
DOIs
StatePublished - 1 Jun 2016

Keywords

  • Distributed datastructures
  • Network design
  • Online algorithms and amortized analysis
  • Peer-to-peer computing
  • Splay trees

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'SplayNet: Towards locally self-adjusting networks'. Together they form a unique fingerprint.

Cite this