A Distributed and Oblivious Heap

A Distributed and Oblivious Heap

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(log2 n) and network diameter O(log n), n being the total number of nodes in the system.

Grafik Top
Authors
  • Scheideler, Christian
  • Schmid, Stefan
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
36th International Colloquium on Automata, Languages and Programming (ICALP)
Divisions
Communication Technologies
Subjects
Informatik Allgemeines
Event Location
Rhodes, Greece
Event Type
Conference
Event Dates
July 2009
Date
2009
Export
Grafik Top