direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publications by Type: Conference and Workshop Publications

see also conference papers, workshop papers, demos, and posters. (under construction)

A Distributed and Oblivious Heap
Citation key SS-DOH-09
Author Scheideler, Christian and Schmid, Stefan
Title of Book 36th International Colloquium on Automata, Languages and Programming (ICALP)
Pages 571–582
Year 2009
ISBN 978-3-642-02929-5
ISSN 0302-9743
DOI http://dx.doi.org/10.1007/978-3-642-02930-1_47
Location Rhodes, Greece
Address Berlin / Heidelberg, Germany
Volume 5556
Month July
Publisher Springer
Series Lecture Notes in Computer Science (LNCS)
Abstract This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends on the nodes currently in the network but not on the past. This allows for fast join and leave operations which is desirable in open distributed systems with high levels of churn and frequent faults. In fact, a node fault or departure can be fixed in SHELL in a constant number of communication rounds, which significantly improves the best previous bound for distributed heaps. SHELL has interesting applications. First, we describe a robust distributed information system which is resilient to Sybil attacks of arbitrary scale. Second, we show how to organize heterogeneous nodes of arbitrary non-uniform capabilities in an overlay network such that the paths between any two nodes do not include nodes of lower capacities. This property is useful, e.g., for streaming. All these features can be achieved without sacrificing scalability: our heap has a de Bruijn like topology with node degree O(log^2 n) and network diameter O(log n), n being the total number of nodes in the system.
Link to publication Download Bibtex entry

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

Under Construction

This page/section is
still under construc-
tion. Please try again
later.