TY - GEN
T1 - Brief announcement
T2 - 26th International Symposium on Distributed Computing, DISC 2012
AU - Schmid, Stefan
AU - Avin, Chen
AU - Scheideler, Christian
AU - Haeupler, Bernhard
AU - Lotker, Zvi
PY - 2012/11/9
Y1 - 2012/11/9
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84868342336&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-33651-5_47
DO - 10.1007/978-3-642-33651-5_47
M3 - Conference contribution
AN - SCOPUS:84868342336
SN - 9783642336508
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 439
EP - 440
BT - Distributed Computing - 26th International Symposium, DISC 2012, Proceedings
Y2 - 16 October 2012 through 18 October 2012
ER -