Distributed construction of random expander networks

Author

Law, Ching ; Siu, Kai-Yeung

Author_Institution

Massachusetts Inst. of Technol., Cambridge, MA, USA

Volume

3

fYear

2003

Firstpage

2133

Abstract

A novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles is presented. The protocol is completely decentralized as no globally-known server is required. The constructed topologies are expanders with O(log_d n) diameter with high probability. Our construction is highly scalable because both the processing and the space requirements at each node grow logarithmically with the network size. A new node can join the network in O(log_d n) time with O(d log_d n) messages. A node can leave in O(1) time with O(d) messages. The protocol is robust against an offline adversary selecting the sequence of the join and leave operations. We also discuss a layered construction of the random expander networks in which any node can be located in O(log n) time. The random expander networks have applications in community discovery, distributed lookup service, and dynamic connectivity.

Keywords

computer networks; distributed algorithms; network topology; protocols; Hamilton cycle; community discovery; decentralized protocol; distributed algorithm; distributed lookup service; dynamic connectivity; globally-known server; network size; node space requirement; overlay network; random expander network layered construction; Construction industry; Distributed algorithms; Eigenvalues and eigenfunctions; Graph theory; Network servers; Network topology; Peer to peer computing; Protocols; Robustness; Sampling methods;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies

ISSN

0743-166X

Print_ISBN

0-7803-7752-4

Type

conf

DOI

10.1109/INFCOM.2003.1209234

Filename

1209234