Brief Announcement: SplayNets

Towards Self-Adjusting Distributed Data Structures
  • Stefan Schmid
  • Chen Avin
  • Christian Scheideler
  • Bernhard Haeupler
  • Zvi Lotker
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7611)

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.

Keywords

Node Degree Distribute Hash Table Local Transformation Binary Search Tree Request Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Sleator, D., Tarjan, R.: Self-adjusting binary search trees. JACM 32(3), 652–686 (1985)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Stefan Schmid
    • 1
  • Chen Avin
    • 2
  • Christian Scheideler
    • 3
  • Bernhard Haeupler
    • 4
  • Zvi Lotker
    • 2
  1. 1.TU Berlin & T-LabsGermany
  2. 2.BGUIsrael
  3. 3.U. PaderbornGermany
  4. 4.MITUSA

Personalised recommendations