An efficient approach for incorporating underlay awareness in P2P networks for guaranteed availabilities
by Madhu Kumar S.D., Umesh Bellur
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 4, No. 2, 2010

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.

Online publication date: Mon, 25-Jan-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email