Efficient broadcast using selective flooding
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
P-Grid: a self-organizing structured P2P system
ACM SIGMOD Record
A peer-to-peer approach to resource location in Grid environments
Grid resource management
Analysis of search and replication in unstructured peer-to-peer networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the Performance of Flooding-Based Resource Discovery
IEEE Transactions on Parallel and Distributed Systems
Structure management for scalable overlay service construction
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Debunking some myths about structured and unstructured overlays
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
In Search of Simplicity: A Self-Organizing Group Communication Overlay
SASO '07 Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems
SmartGRID: A Fully Decentralized Grid Scheduling Framework Supported by Swarm Intelligence
GCC '08 Proceedings of the 2008 Seventh International Conference on Grid and Cooperative Computing
Proactive information caching for efficient resource discovery in a self-structured grid
BADS '09 Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems
A grid information service based on peer-to-peer
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Bio-Inspired P2P Systems: The Case of Multidimensional Overlay
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special Section: Extended Version of SASO 2011 Best Paper
Behavioral modeling and formal verification of a resource discovery approach in Grid computing
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
One of the key success factors enabling the deployment of large scale grid systems is the existence of efficient resource discovery mechanisms. Accordingly, the main issues to be addressed by such a grid information system are those of scalability and minimal network overhead. In this respect, we propose a solution based on proactive information caching supported by a self-structured overlay topology. The proposed approach features a fully distributed ant-inspired self-organized overlay construction that maintains a bounded diameter overlay, and a selective flooding-based discovery algorithm that exploits local caches to reduce the number of visited nodes. To improve the caching scheme while retaining minimal bandwidth consumption, cache contents are periodically exchanged between neighboring nodes using an epidemic replication mechanism that is based on a gossiping algorithm, thus allowing nodes to have a more general view of the network and its resources. Extensive experimentation provides evidence that the average number of hops required to efficiently locate resources is limited and that our framework performs well with respect to hit rate and network overhead.