ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Future Generation Computer Systems
Volume 24, Issue 1, January 2008, Pages 31-38
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (478 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.future.2007.02.009    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier Ltd All rights reserved.

Powerful resource discovery for Arigatoni overlay networkstar, open

Raphael Chanda, E-mail The Corresponding Author, Michel Cosnardb, E-mail The Corresponding Author and Luigi Liquorib, Corresponding Author Contact Information, E-mail The Corresponding Author, E-mail The Corresponding Author

aUniversity of Geneva, Switzerland bInria Sophia Antipolis, France

Received 26 January 2007; 
revised 16 February 2007; 
accepted 27 February 2007. 
Available online 21 March 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Arigatoni is a structured multi-layer overlay network providing various services with variable guarantees, and promoting an intermittent participation in the overlay since peers can appear, disappear and organize themselves dynamically. Arigatoni provides fully decentralized, asynchronous and scalable resource discovery; it also provides mechanisms for dealing with an overlay with a dynamic topology. This paper introduces a nontrivial improvement of the resource discovery protocol by allowing the registration and request of multiple instances of the same service, service conjunctions, and multiple services. Adding multiple instances is a nontrivial task since the discovery protocol must keep track (when routing requests) of peers that accept to serve and peers that deny the service. Adding service conjunctions allows a single peer to offer different services at the same time. Simulations show that it is efficient and scalable.

Keywords: Overlay networks; Resource discovery; Virtual organizations; Dynamic graphs; Peer-to-peer; Global computing; Grid computing

Article Outline

1. Introduction
2. Resource discovery protocol RDP V3
3. RDP pseudo-code
4. Protocol evaluation
5. Related work and conclusions
5.1. Discussion on closest overlay architectures (from [7])
5.2. Conclusions
Acknowledgements
References
Vitae


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.