On the Correctness of Gossip-Based Membership Protocols

André Allavena

ISBN 10: 3836455331 / ISBN 13: 9783836455336

Published by VDM Verlag Dr. Müller Mär 2008, 2008

About this Item

Neuware - The importance of scalability and fault-tolerance in modern distributed systems has led to considerable research in multi-cast gossip protocols. Ina 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.

Seller Inventory # 9783836455336

Bibliographic Details

• Title: On the Correctness of Gossip-Based Membership Protocols
• Publisher: VDM Verlag Dr. Müller Mär 2008
• Publication Date: 2008
• Language: English
• ISBN 10: 3836455331
• ISBN 13: 9783836455336
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 24W x 0H x 0D centimeters 24 centimeters width by 0 centimeters height by 0 centimeters depth
• Weight: 170 grams

About this title

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.

About the Author

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.