Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
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
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
SETI@home: an experiment in public-resource computing
Communications of the ACM
IEEE Internet Computing
Gossip versus Deterministically Constrained Flooding on Small Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Efficient Epidemic-Style Protocols for Reliable and Scalable Multicast
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
A Robust Protocol for Building Superpeer Overlay Topologies
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
The Organic Grid: Self-Organizing Computation on a Peer-to-Peer Network
ICAC '04 Proceedings of the First International Conference on Autonomic Computing
Efficient broadcast in P2P grids
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid - Volume 01
One hop lookups for peer-to-peer overlays
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
A scalable and robust framework for distributed applications
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Cost-effective broadcast for fully decentralized peer-to-peer networks
Computer Communications
Automatic document organization in a p2p environment
ECIR'06 Proceedings of the 28th European conference on Advances in Information Retrieval
| Hi-index | 0.00 |
We present an efficient algorithm for job submissions in Peer-to-Peer (desktop) grids based on limited multicasts. Our approach combines the advantages of two overlay architectures: Chord-like structured networks and unstructured networks with epidemic communication. To predict the multicast properties and to optimize its distribution schedule, we present a probabilistic model of the process of information propagation within the overlay. We show the efficiency and the fault-tolerance of our proposed method and demonstrate the high accuracy of the predictive model.