Parallel and Distributed Processing Symposium, International (2003)
Apr. 22, 2003 to Apr. 26, 2003
Ittai Abraham , Hebrew University
Baruch Awerbuch , Johns Hopkins University
Yossi Azar , Tel Aviv University
Yair Bartal , Hebrew University
Dahlia Malkhi , Hebrew University
Elan Pavlov , Hebrew University
This paper presents a generic scheme for a central, yet untackled issue in overlay dynamic networks: maintaining stability over long life and against malicious adversaries. The generic scheme maintains desirable properties of the underlying structure including low diameter, and efficient routing mechanism, as well as balanced node dispersal. These desired properties are maintained in a decentralized manner without resorting to global updates or periodic stabilization protocols even against an adaptive adversary that controls the arrival and departure of nodes.
Y. Bartal, B. Awerbuch, E. Pavlov, Y. Azar, D. Malkhi and I. Abraham, "A Generic Scheme for Building Overlay Networks in Adversarial Scenarios," Parallel and Distributed Processing Symposium, International(IPDPS), Nice, France, 2003, pp. 40b.