Brief Announcement: SplayNets Towards Self-Adjusting Distributed Data Structures

Brief Announcement: SplayNets Towards Self-Adjusting Distributed Data Structures

Content
Grafik
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.

Grafik Top
Authors
  • Schmid, Stefan
  • Avin, Chen
  • Scheideler, Christian
  • Haeupler, Bernhard
  • Lotker, Zvi
Grafik Top
Supplemental Material
Shortfacts
Category
 Paper in Conference Proceedings or in Workshop Proceedings (Other)
Event Title
 26th International Symposium on Distributed Computing (DISC)
Divisions
 Communication Technologies
Subjects
 Informatik Allgemeines
Event Location
 Salvador, Brazil
Event Type
 Conference
Event Dates
 October 2012
Date
 2012
Export
Grafik Top
Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
EPrints Logo
CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.