Verwandte Artikel zu On the Correctness of Gossip-Based Membership Protocols
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 45,44
EUR 5,71 für den Versand von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer
Suchergebnisse für On the Correctness of Gossip-Based Membership Protocols
Beispielbild für diese ISBN
On the Correctness of Gossip-Based Membership Protocols
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Artikel-Nr. ria9783836455336_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
On the Correctness of Gossip-Based Membership Protocols
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. Artikel-Nr. 598301037
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
On the Correctness of Gossip-Based Membership Protocols
Verlag:
VDM Verlag Dr. Müller Mär 2008, 2008
ISBN 10: 3836455331
ISBN 13: 9783836455336
Neu
Taschenbuch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. 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. Artikel-Nr. 9783836455336
Anzahl: 2 verfügbar