A group communication protocol for scalable causal ordering
A group communication protocol for scalable causal ordering
复制标题
用于可扩展因果排序的组通信协议
DOI：
10.1109/aina.2004.1283927
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
M. Takizawa
中科院分区：
文献类型：
--
作者：
Satoshi Kawanami;T. Enokido;M. Takizawa
分布在不同类型网络中的大量对等进程为了实现某种目标而相互协作。由于进程数n的消息长度为O（n），因此向量时钟不能用于可伸缩组。一个组是由本地子组组成的，在每个子组中，进程都在局域网或个人区域网中，并在广域网中互连。局部子组中的进程使用物理和线性时钟，而广域网中的进程采用矢量时钟。我们讨论了如何通过使用每个子组的本地同步机制来因果地传递消息。我们评估的协议中订购的消息数量。
Large number of peer processes distributed in various types of networks are cooperating to achieve some objectives. The vector clock cannot be adopted to a scalable group due to the message length O(n) for number n of processes. A group is composed of local subgroups in each of which processes are in a local or personal area network and which are interconnected in a wide-area network. Processes in local subgroups use physical and linear clocks while processes in a wide-area network adopt vector clock. We discuss how to causally deliver messages by using local synchronization mechanisms of each subgroup. We evaluate the protocol in terms of number of messages ordered.