Design and Implementation of a Secure Group Communication Protocol on a Fault Tolerant Ring

2003 ◽  
pp. 802-810 ◽  
Author(s):  
Özgür Sağlam ◽  
Mehmet E. Dalkılç ◽  
Kayhan Erciyeş
Keyword(s):  
Communication Protocol ◽  
Fault Tolerant ◽  
Group Communication ◽  
Secure Group Communication ◽  
Design And Implementation

Design and Implementation of Hybrid Time (HT) Group Communication Protocol for Homogeneous Broadcast Groups

2011 ◽  
Vol 2 (3) ◽  
pp. 37-48 ◽  
Author(s):  
Isamu Tsuneizumi ◽  
Ailixier Aikebaier ◽  
Makoto Ikeda ◽  
Tomoya Enokido ◽  
Makoto Takizawa
Keyword(s):  
Communication Protocol ◽  
Group Communication ◽  
Linear Time ◽  
Communication Overhead ◽  
Design And Implementation ◽  
Physical Time ◽  
Message Length

To realize the cooperation of a group of multiple peer processes (peers), messages sent by peers must be causally delivered to every peer. In a scalable group, it is necessary to reduce the communication overhead to causally deliver messages. In this paper, the authors take advantage of the linear time (LT) and physical time (PT) protocols, as the message length is O(n) for the number n of peers. However, some pairs are unnecessarily ordered, that is, even if a pair of messages is ordered in the protocols, the messages may not be causally ordered. The greater the number of messages that are unnecessarily ordered, the larger the overhead is implied since the messages must be kept in a receipt queue if a message is lost or delayed. This paper discusses a hybrid time group communication (HT) protocol that reduces the number of messages unnecessarily ordered. The HT protocol is evaluated in terms of the number of unnecessarily ordered messages compared with the PT and LT protocols. It is demonstrated that the number of unnecessarily ordered messages can be reduced in the HT protocol compared with the LT and PT protocols.

Design and Implementation of Hybrid Time (HT) Group Communication Protocol for Homogeneous Broadcast Groups

2012 ◽  
pp. 282-293
Author(s):  
Isamu Tsuneizumi ◽  
Ailixier Aikebaier ◽  
Makoto Ikeda ◽  
Tomoya Enokido ◽  
Makoto Takizawa
Keyword(s):  
Communication Protocol ◽  
Group Communication ◽  
Linear Time ◽  
Communication Overhead ◽  
Design And Implementation ◽  
Physical Time ◽  
Message Length

To realize the cooperation of a group of multiple peer processes (peers), messages sent by peers must be causally delivered to every peer. In a scalable group, it is necessary to reduce the communication overhead to causally deliver messages. In this paper, the authors take advantage of the linear time (LT) and physical time (PT) protocols, as the message length is O(n) for the number n of peers. However, some pairs are unnecessarily ordered, that is, even if a pair of messages is ordered in the protocols, the messages may not be causally ordered. The greater the number of messages that are unnecessarily ordered, the larger the overhead is implied since the messages must be kept in a receipt queue if a message is lost or delayed. This paper discusses a hybrid time group communication (HT) protocol that reduces the number of messages unnecessarily ordered. The HT protocol is evaluated in terms of the number of unnecessarily ordered messages compared with the PT and LT protocols. It is demonstrated that the number of unnecessarily ordered messages can be reduced in the HT protocol compared with the LT and PT protocols.

Sign in / Sign up

Export Citation Format

Share Document