Brief announcement: splaynets

  • Authors:

  • Stefan Schmid;Chen Avin;Christian Scheideler;Bernhard Haeupler;Zvi Lotker

  • Affiliations:

  • TU Berlin & T-Labs, Germany;BGU, Israel;U. Paderborn, Germany;MIT;BGU, Israel

  • Venue:
  • DISC'12 Proceedings of the 26th international conference on Distributed Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper initiates the study of self-adjusting distributed data structures or networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to the routing requests. We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties.