P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
Causally Ordered Delivery with Global Clock in Hierarchical Group
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Efficient and decentralized computation of approximate global state
ACM SIGCOMM Computer Communication Review
10Gb/s Ethernet performance and retrospective
ACM SIGCOMM Computer Communication Review
Hi-index | 0.00 |
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 On 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.