Reliable multicast and its probabilistic model for job submission in peer-to-peer grids

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Merz, P., & Gorunova, K. (2005). Reliable multicast and its probabilistic model for job submission in peer-to-peer grids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3806 LNCS, pp. 504–511). https://doi.org/10.1007/11581062_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free