Underlay Aware Resiliency in P2P Overlays

  • Authors:
  • S. D. Kumar;Umesh Bellur;V. K. Govindan

  • Affiliations:
  • Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai, India 400076;Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai, India 400076;Department of Computer Science and Engineering, National Institute of Technology Calicut, Calicut, India 673601

  • Venue:
  • ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Modern distributed applications that run on P2P overlays need the overlay to be resilient to failures in the underlying communications network. An example application is that of event dissemination where the P2P overlay (the event broker network) delivers events published by a client to subscribers based on subscription filters. Achieving high availability requires that the overlay be aware of, and utilize the path redundancies in the underlying physical network. In addition, the overlay should be self organizing, as broker nodes may dynamically join or leave the network and centralized control is not an option in large scale networks. In this paper, we present Trimarg, an efficient distributed algorithm for achieving a self organizing overlay with an availability degree of three. Our algorithm is based on a graph theoretic foundation for highly available overlay networks and is designed to handle the concurrency issues of a large scale distributed system. The resulting unstructured P2P overlay ensures 3-degree of availability in the presence of node and link failures in the underlying physical network. We have proved the correctness of the algorithm and analyzed its complexity to show that the time complexity is O (diameter *degree )2 of the network and the message complexity is O (diameter *degree ). Our algorithm is the first of its kind to deal with concurrency issues and self organizing capabilities of the resultant overlay.