On the Correctness of Gossip-Based Membership Protocols - Couverture souple

Allavena, André

Couverture souple

ISBN 10 : 3836455331 ISBN 13 : 9783836455336

Editeur : VDM Verlag Dr. Mueller E.K., 2008

Synopsis

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 in-degree (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.

A propos du livre

Présentation de l'éditeur

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.

Biographie de l'auteur

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.

Détails de l'édition

• Éditeur: VDM Verlag Dr. Mueller E.K.
• Date d'édition: 2008
• Langue: anglais
• ISBN 10: 3836455331
• ISBN 13: 9783836455336
• Reliure: Broché
• Nombre de pages: 116
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible