{"product_id":"on-the-correctness-of-gossip-based-membership-protocols-von-andre-allavena","title":"On the Correctness of Gossip-Based Membership Protocols","description":"\u003cp\u003eRevision 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.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783639432213\"\u003e\u003ch3\u003e\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783639432213","offer_id":39489923907677,"sku":"9783639432213","price":49.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/ccd006b6-1f3d-4620-841d-a8e6cb9bc089.jpg?v=1773469134","url":"https:\/\/shop.autorenwelt.de\/products\/on-the-correctness-of-gossip-based-membership-protocols-von-andre-allavena","provider":"Autorenwelt Shop","version":"1.0","type":"link"}