An efficient approach for incorporating underlay awareness in P2P networks for guaranteed availabilities

Authors:
Madhu Kumar S.D.;Umesh Bellur
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai – 400 076, India.;Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai – 400 076, India
Venue:
International Journal of Communication Networks and Distributed Systems
Year:
2010

Citing 6
Cited 1

The Case for Resilient Overlay Networks

HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Underlay-aware overlay networks

Underlay-aware overlay networks
A Distributed Algorithm for Underlay Aware and Available Overlay Formation in Event Broker Networks for Publish/Subscribe Systems

ICDCSW '07 Proceedings of the 27th International Conference on Distributed Computing Systems Workshops
Availability models for underlay aware overlay networks

Proceedings of the second international conference on Distributed event-based systems
A Taxonomy of QoS-Aware, Adaptive Event-Dissemination Middleware

IEEE Internet Computing
Self-stabilizing publish/subscribe systems: algorithms and evaluation

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing

SAVEUS: SAving Victims in Earthquakes through Unified Systems

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unstructured P2P overlays are employed by diverse applications like event dissemination. Many of these applications need the overlay to be highly available for guaranteeing QoS (such as delivery guarantees) to their clients. We demonstrate that underlay awareness i.e., knowledge of the structure of the underlying network, is necessary in such overlays for the availability of overlay paths. We model underlay aware overlays as a multilevel graph and with the help of graph theoretic concepts, existing and new, prove that the problem of formation of overlay networks with guaranteed availability is NP-complete. We show that, despite this complexity, underlay aware overlay networks for guaranteed availability can be formed and maintained efficiently. Such overlays use knowledge of the underlay and operate under a specified set of constraints which are relevant in large-scale networks. Using these constraints, we outline distributed algorithms for formation and maintenance of overlay networks of k degree of availability.