Resource Discovery in the Arigatoni Overlay Network

Arigatoni is a lightweight Overlay Network for dynamic and generic Resource Discovery. Entities in Arigatoni are organized in Colonies. A colony is a simple virtual organization composed by exactly one leader, offering some broker-like services, and some set of Individuals. Individuals are subcolonies of individuals, or basic units called Global Computers. Global computers communicate by first registering to the colony and then by mutually asking and offering services. The leader, called Global Broker, has the job to analyze service requests/responses coming from its own colony or arriving from a surrounding colony, and to route requests/responses to other individuals. After this discovery phase, individuals get in touch with each others without any further intervention from the system, typically in a P2P fashion. Communications over the behavioral units of the overlay network are performed by a simple Global Internet Protocol. Arigatoni provides fully decentralized, asynchronous and scalable resource discovery, that can be used for various purposes from P2P applications to more sophisticated Grid applications. The main focus of this paper is to present the resource discovery algorithm used in Arigatoni, that is reminiscent to some algorithms employed in the publish/subscribe paradigm. We show some simulations that show that resource discovery in Arigatoni is efficient and scalable.

[1]  Luigi Liquori,et al.  Arigatoni: A Simple Programmable Overlay Network , 2006, IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing (JVA'06).

[2]  Dennis Heimbigner,et al.  Adapting publish/subscribe middleware to achieve Gnutella-like functionality , 2001, SAC.

[3]  Pascal Felber,et al.  XNET: a reliable content-based publish/subscribe system , 2004, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004..

[4]  Luigi Liquori,et al.  Resource Discovery in the Arigatoni Model , 2010, IICS.

[5]  Luigi Liquori,et al.  Virtual Organizations in Arigatoni , 2007, Electron. Notes Theor. Comput. Sci..

[6]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[7]  Guruduth Banavar,et al.  An efficient multicast protocol for content-based publish-subscribe systems , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[8]  Pascal Felber,et al.  A scalable protocol for content-based routing in overlay networks , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..

[9]  David S. Rosenblum,et al.  Design and evaluation of a wide-area event notification service , 2001, TOCS.

[10]  Anne-Marie Kermarrec,et al.  The many faces of publish/subscribe , 2003, CSUR.

[11]  Raphael Chand.  Large scale diffusion of information in publish/subscribe systems , 2005 .

[12]  S RosenblumDavid,et al.  Design and evaluation of a wide-area event notification service , 2001 .