Seminar by Kishore Kothapalli
Maintenance and Routing in Overlay Networks
Kishore Kothapalli
Johns Hopkins University
Date: Tuesday, Feb 28, 2006
Time: Noon
Venue: CS 102 Abstract:
Overlay networks provide a logical interconnection topology over an existing physical network. Study of overlay networks arises in many areas such as peer-to-peer (P2P) networks, and in wireless ad hoc networks and sensor networks. Due to the wide range of applications, formal study of overlay networks is required to understand many issues that arise in overlay networks.
In this talk, we focus on overlay networks for P2P systems. We present a network called Pagoda that is designed to operate under heterogeneous environments. The Pagoda network has constant degree, logarithmic diameter and 1/logarithmic expansion, matching the properties of known randomized constructions. However, in contrast to these networks, the Pagoda is deterministic and therefore guarantees these properties. We show how to support peer join/leave operation and how to support concurrent multicasting efficiently.
Later, we present a unified approach to arrive at a supervised P2P system. Here, we assume that we are provided with a low-powered specially designated node called the supervisor that guides the topology of the network. We show that our approach results in better constructions and can allow rapid peer join/leave and rapid repair. We also show how to provide robustness guarantees.