Adapting publish/subscribe middleware to achieve Gnutella-like functionality
Proceedings of the 2001 ACM symposium on Applied computing
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
A Scalable Protocol for Content-Based Routing in Overlay Networks
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Canon in G Major: Designing DHTs with Hierarchical Structure
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
XNET: A Reliable Content-Based Publish/Subscribe System
SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
Arigatoni: A Simple Programmable Overlay Network
JVA '06 Proceedings of the IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing
Virtual Organizations in Arigatoni
Electronic Notes in Theoretical Computer Science (ENTCS)
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Hi-index | 0.00 |
Arigatoni is a structured multi-layer overlay network providing various services with variable guarantees, and promoting an intermittent participation to the virtual organization where peers can appear, disappear and organize themselves dynamically. Arigatoni mainly concerns with how resources are declared and discovered in the overlay, allowing global computers to make a secure, PKI-based, use of global aggregated computational power, storage, information resources, etc. Arigatoni provides fully decentralized, asynchronous and scalable resource discovery, and provides mechanisms for dealing with dynamic virtual organizations. This paper introduces a non trivial improvement of the original resource discovery protocol by allowing to register and to ask for multiple instances. Simulations show that it is efficient and scalable.