| Title | : | A Framework for Sparse Robust Addressable Networks |
| Speaker | : | Sumathi S (IITM) |
| Details | : | Wed, 20 Sep, 2017 2:00 PM @ A M Turing Hall |
| Abstract: | : | A peer-to-peer (P2P) network consists of nodes that may join or leave the network at any time step. These nodes connect with each other via logical overlay edges that is usually built on top of an existing network (usually the Internet). Typically, P2P networks undergo heavy churn, that is, they experience a large amount of node joins/leave every time step. Heavy churn can lead to loss of data and disconnected networks, making search and retrieval difficult. For example, in popular applications like Bittorrent, building stable connections is essential for fast and efficient retrieval of data.
Our goal is to build robust overlays that are capable of tolerating very heavy churn. To this end, we present, Spartan (SPARse conTent Addressable Networks), a framework for building a robust P2P overlay which is capable of withstanding churn. Spartan is also a framework upon which it is possible to build and maintain other distributed data structures which facilitates fast data retrieval. In a network of n nodes, Spartan is a fully distributed overlay that provides for the search, index and addressing of as many as O(n/log n) data items, all reachable within O(log n) time steps. A key advantage is that many of the protocols designed for high churn networks can be adapted easily to work in Spartan, thus allowing it to be an ideal overlay for P2P networks. |
