Articoli correlati a On the Correctness of Gossip-Based Membership Protocols
Sinossi
Revision with unchanged content. The importance of scalability and fault-tolerance in modern distributed systems has led to considerable research in multi-cast gossip protocols. In a gossip protocol, each node forwards messages to a small set of "gossip partners" chosen at random from the entire group membership; traditional strong reliability guarantees are traded for probabilistic guaranties, potentially yielding greater scalability and fault tolerance. Nodes only stores a small random subset of the membership as maintaining complete membership views at each node is expensive. These protocols are subtle, and while they have been the subject of much simulation and analysis, formal proofs of key properties - in particular the probability of network partitioning - have remained elusive. In this thesis we give a new scalable gossip-based algorithm for local view maintenance, with a lower bound on the expected partition time. We develop probabilistic bounds on the indegree (hence the load) of individual nodes, argue that the undirected connectivity graph is an expander and that protocols lacking our reinforcement component eventually converge to star-like networks. Heavy churn and view randomness are also addressed.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sull?autore
André Allavena received his Diplôme d'Ingénieur in 2001from École Centrale Paris. After completing his Ph.D. inComputer Science at Cornell University, NY, under thedirection of Alan Demers and Turing Award recipientJohn Hopcroft, André pursued post-doctoral research atthe University of Waterloo, ON, Canada. He now works inthe software industry.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 49,00
EUR 23,00 per la spedizione da Germania a U.S.A.
Destinazione, tempi e costi
Risultati della ricerca per On the Correctness of Gossip-Based Membership Protocols
Immagini fornite dal venditore
On the Correctness of Gossip-Based Membership Protocols
Editore:
AV Akademikerverlag Jun 2012, 2012
ISBN 10: 3639432215
ISBN 13: 9783639432213
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Revision with unchanged content. The importance of scalability and fault-tolerance in modern distributed systems has led to considerable research in multi-cast gossip protocols. In a gossip protocol, each node forwards messages to a small set of 'gossip partners' chosen at random from the entire group membership; traditional strong reliability guarantees are traded for probabilistic guaranties, potentially yielding greater scalability and fault tolerance. Nodes only stores a small random subset of the membership as maintaining complete membership views at each node is expensive. These protocols are subtle, and while they have been the subject of much simulation and analysis, formal proofs of key properties - in particular the probability of network partitioning - have remained elusive. In this thesis we give a new scalable gossip-based algorithm for local view maintenance, with a lower bound on the expected partition time. We develop probabilistic bounds on the indegree (hence the load) of individual nodes, argue that the undirected connectivity graph is an expander and that protocols lacking our reinforcement component eventually converge to star-like networks. Heavy churn and view randomness are also addressed. 116 pp. Englisch. Codice articolo 9783639432213
Quantità: 2 disponibili
Immagini fornite dal venditore
On the Correctness of Gossip-Based Membership Protocols
Da: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: New. Codice articolo 4987429
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
On the Correctness of Gossip-Based Membership Protocols
Editore:
AV Akademikerverlag Jun 2012, 2012
ISBN 10: 3639432215
ISBN 13: 9783639432213
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Neuware -Revision with unchanged content. The importance of scalability and fault-tolerance in modern distributed systems has led to considerable research in multi-cast gossip protocols. In a gossip protocol, each node forwards messages to a small set of 'gossip partners' chosen at random from the entire group membership; traditional strong reliability guarantees are traded for probabilistic guaranties, potentially yielding greater scalability and fault tolerance. Nodes only stores a small random subset of the membership as maintaining complete membership views at each node is expensive. These protocols are subtle, and while they have been the subject of much simulation and analysis, formal proofs of key properties - in particular the probability of network partitioning - have remained elusive. In this thesis we give a new scalable gossip-based algorithm for local view maintenance, with a lower bound on the expected partition time. We develop probabilistic bounds on the indegree (hence the load) of individual nodes, argue that the undirected connectivity graph is an expander and that protocols lacking our reinforcement component eventually converge to star-like networks. Heavy churn and view randomness are also addressed.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 116 pp. Englisch. Codice articolo 9783639432213
Quantità: 2 disponibili
Immagini fornite dal venditore
On the Correctness of Gossip-Based Membership Protocols
Print on DemandDa: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Revision with unchanged content. The importance of scalability and fault-tolerance in modern distributed systems has led to considerable research in multi-cast gossip protocols. In a gossip protocol, each node forwards messages to a small set of 'gossip partners' chosen at random from the entire group membership; traditional strong reliability guarantees are traded for probabilistic guaranties, potentially yielding greater scalability and fault tolerance. Nodes only stores a small random subset of the membership as maintaining complete membership views at each node is expensive. These protocols are subtle, and while they have been the subject of much simulation and analysis, formal proofs of key properties - in particular the probability of network partitioning - have remained elusive. In this thesis we give a new scalable gossip-based algorithm for local view maintenance, with a lower bound on the expected partition time. We develop probabilistic bounds on the indegree (hence the load) of individual nodes, argue that the undirected connectivity graph is an expander and that protocols lacking our reinforcement component eventually converge to star-like networks. Heavy churn and view randomness are also addressed. Codice articolo 9783639432213
Quantità: 1 disponibili