Results 1 - 10 of 388

Reliable Communication in the Presence of Failures

by Kenneth P. Birman, Thomas A. Joseph - ACM Transactions on Computer Systems , 1987
"... The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for fault-tolerant process groups in the form of a family of reliable multicast protocols that can be used in both local- and wide-area networks. These protocols at ..."
Abstract - Cited by 546 (18 self) - Add to MetaCart
alternative to conventional asynchronous communication protocols. The facility also ensures that the processes belonging to a fault-tolerant process group will observe consistent orderings of events affecting the group as a whole, including process failures, recoveries, migration, and dynamic changes to group

Spatial gossip and resource location protocols

by David Kempe, Jon Kleinberg, Alan Demers , 2001
"... The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. Gossip protocols are mechanisms for this task in which nodes communicate with one another according to some underlying d ..."
Abstract - Cited by 174 (8 self) - Add to MetaCart
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. Gossip protocols are mechanisms for this task in which nodes communicate with one another according to some underlying

CLIQUES: A New Approach to Group Key Agreement

by M. Steiner, G. Tsudik, M. Waidner, Michael Steiner, Gene Tsudik, Michael Waidner , 1998
"... This paper considers the problem of key agreement in a group setting with highlydynamic group member population. A protocol suite, called CLIQUES, is developed by extending the well-known Diffie-Hellman key agreement method to support dynamic group operations. Constituent protocol are secure, eff ..."
Abstract - Cited by 154 (16 self) - Add to MetaCart
This paper considers the problem of key agreement in a group setting with highlydynamic group member population. A protocol suite, called CLIQUES, is developed by extending the well-known Diffie-Hellman key agreement method to support dynamic group operations. Constituent protocol are secure

Dynamic update of distributed agreement protocols

by Olivier Rütti, Pawe̷l T. Wojciechowski, André Schiper - School of Computer and Communication Sciences, Ecole Polytechnique Fédérale de Lausanne (EPFL , 2005
"... In this paper, we address the problem of dynamic protocol update (DPU) that requires global coordination of local code replacements. We propose a novel approach to DPU. The key idea is the use of synchronization facilities of the services that get updated. This solution makes global update simple an ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
In this paper, we address the problem of dynamic protocol update (DPU) that requires global coordination of local code replacements. We propose a novel approach to DPU. The key idea is the use of synchronization facilities of the services that get updated. This solution makes global update simple

A Suite of Database Replication Protocols based on Group Communication Primitives

by Bettina Kemme, Gustavo Alonso , 1998
"... This paper proposes a family of replication protocols based on group communication in order to address some of the concerns expressed by database designers regarding existing replication solutions. Due to these concerns, current database systems allow inconsistencies and often resort to centralized ..."
Abstract - Cited by 91 (8 self) - Add to MetaCart
This paper proposes a family of replication protocols based on group communication in order to address some of the concerns expressed by database designers regarding existing replication solutions. Due to these concerns, current database systems allow inconsistencies and often resort to centralized

Kronos: A scalable group re-keying approach for secure multicast

by Sanjeev Setia, Samir Koussih, Sushil Jajodia, Eric Harder - IEEE Symposium on Security and Privacy , 2000
"... In this paper, we describe a novel approach to scalable group re-keying for secure multicast. Our approach, which we call Kronos, is based upon the idea of periodic group re-keying. We first motivate our approach by showing that if a group is re-keyed on each membership change, as the size of the gr ..."
Abstract - Cited by 119 (5 self) - Add to MetaCart
In this paper, we describe a novel approach to scalable group re-keying for secure multicast. Our approach, which we call Kronos, is based upon the idea of periodic group re-keying. We first motivate our approach by showing that if a group is re-keyed on each membership change, as the size

Membership Algorithms for Multicast Communication Groups

by Yair Amir, Danny Dolev, Shlomo Kramer, Dalia Malki - In 6th Intl. Workshop on Distributed Algorithms proceedings (WDAG-6), (LCNS , 1992
"... We introduce a membership protocol that maintains the set of currently connected machines in an asynchronous and dynamic environment. The protocol handles both failures and joining of machines. It operates within a multicast communication sub-system. It is well known that solving the membership prob ..."
Abstract - Cited by 79 (16 self) - Add to MetaCart
We introduce a membership protocol that maintains the set of currently connected machines in an asynchronous and dynamic environment. The protocol handles both failures and joining of machines. It operates within a multicast communication sub-system. It is well known that solving the membership

Scalable Reliable Multicast Using Multiple Multicast Groups

by Sneha K. Kasera , Jim Kurose, Don Towsley - IEEE/ACM TRANSACTIONS ON NETWORKING , 1996
"... We examine an approach for providing reliable, scalable multicast communication, involving the use of multiple multicast groups for reducing receiver processing costs in a multicast session. In this approach a single multicast group is used for the original transmission of packets. Retransmission ..."
Abstract - Cited by 117 (8 self) - Add to MetaCart
We examine an approach for providing reliable, scalable multicast communication, involving the use of multiple multicast groups for reducing receiver processing costs in a multicast session. In this approach a single multicast group is used for the original transmission of packets

The Timewheel Asynchronous Group Communication Protocol

by Christof Fetzer, Shivakant Mishra, Flaviu Cristian , 1995
"... We propose a membership and a reliable broadcast protocol that support several different semantics simultaneously and provide good overall performance. The broadcast protocol supports three atomicity semantics---weak, strong, and strict atomicity---and three ordering semantics--- unordered, total ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
, total order, and time order. These result in nine group communicationsemantics and an application can dynamically choose the desired atomicity and order semantics when broadcasting an update. These protocols provide fast delivery and stability times, use a small number of messages to accomplish a

Structural and Algorithmic Issues of Dynamic Protocol Update

by Olivier Rütti, Pawe̷l T. Wojciechowski, André Schiper - In: Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS’06). IEEE
"... In this paper, we study dynamic protocol update (DPU). Contrary to local code updates on-the-fly, DPU requires global coordination of local code replacements. We propose a novel solution to DPU. The key idea is to add a level of indirection between the service callers and the service provider. This ..."
Abstract - Cited by 12 (2 self) - Add to MetaCart
In this paper, we study dynamic protocol update (DPU). Contrary to local code updates on-the-fly, DPU requires global coordination of local code replacements. We propose a novel solution to DPU. The key idea is to add a level of indirection between the service callers and the service provider
Results 1 - 10 of 388