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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Schmid, S., Avin, C., Scheideler, C., Haeupler, B., & Lotker, Z. (2012). Brief announcement: SplayNets: Towards self-adjusting distributed data structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7611 LNCS, pp. 439–440). https://doi.org/10.1007/978-3-642-33651-5_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
