Brief announcement: SplayNets: Towards self-adjusting distributed data structures

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

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

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.

Original languageEnglish
Title of host publicationDistributed Computing - 26th International Symposium, DISC 2012, Proceedings
Pages439-440
Number of pages2
DOIs
StatePublished - 9 Nov 2012
Event26th International Symposium on Distributed Computing, DISC 2012 - Salvador, Brazil
Duration: 16 Oct 201218 Oct 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7611 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference26th International Symposium on Distributed Computing, DISC 2012
Country/TerritoryBrazil
CitySalvador
Period16/10/1218/10/12

Fingerprint

Dive into the research topics of 'Brief announcement: SplayNets: Towards self-adjusting distributed data structures'. Together they form a unique fingerprint.

Cite this