On the Correctness of Gossip-Based Membership Protocols

André Allavena

ISBN 10: 3639432215 / ISBN 13: 9783639432213

Published by AV Akademikerverlag Jun 2012, 2012

About this Item

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.

Seller Inventory # 9783639432213

Bibliographic Details

• Title: On the Correctness of Gossip-Based Membership Protocols
• Publisher: AV Akademikerverlag Jun 2012
• Publication Date: 2012
• Language: English
• ISBN 10: 3639432215
• ISBN 13: 9783639432213
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 7D millimeters 220 millimeters width by 150 millimeters height by 7 millimeters depth
• Weight: 191 grams

About this title

Synopsis

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.

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.