S. Kawanami’s research while affiliated with Tokyo Denki University and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (4)


Figure 1 Causality
Figure 2 Structured group
Figure 3 Ordering of messages
Figure 4 Causality in a local subgroup
Figure 5 Causality among local subgroup

+2

Heterogeneous clock group protocol for causally ordered delivery of messages
  • Article
  • Full-text available

November 2009

·

22 Reads

·

8 Citations

International Journal of Wireless and Mobile Computing

Satoshi Kawanami

·

·

The vector clock widely used in group protocols cannot be adopted to a scalable group due to communication and computation overheads. In order to reduce the overheads, we discuss a hierarchical group which is composed of local subgroups. Processes in subgroups are synchronised by using physical and linear clocks while processes in a WAN are synchronised by using a vector clock. We discuss how to causally deliver messages by using the local synchronisation mechanisms. We discuss how to reduce the number of messages to be unnecessarily ordered. We evaluate the protocol in terms of number of messages ordered.

Download

Figure 4. Causality.
A Scalable Group Communication Protocol with Global Clock

April 2005

·

34 Reads

·

6 Citations

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 communication and computation overheads. In order to reduce the overhead, we discuss a group where all the processes are synchronized by physical clocks. Here, a subgroup of processes are interconnected in a local or personal area network. Clocks of computers in every local subgroup are synchronized by using the network time protocol (NTP) with a GPS time server. The maximum time difference among clocks of computers depends on types of operating systems of the computers. Every message is given physical time when a process sends the message. We discuss a global clock group (GCG) protocol where messages are causally ordered by using the time physical stamps with maximum time difference and delay time. We evaluate the protocol in terms of the number of messages ordered compared with the vector clock.


Heterogeneous groups to causally ordered delivery

April 2004

·

20 Reads

·

5 Citations

Large number of peer processes distributed in various types of networks are cooperating to achieve some objectives. We discuss a scalable group communication protocol named HCG (heterogeneous clock group) protocol. Messages are required to be causally delivered by using clocks in a group. An HCG 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. In order to support the causally ordered delivery of messages in a scalable group, 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 HCG protocol in terms of number of messages ordered.


Figure 3. Order in local subgroup.
Figure 4. Causal precedency.
A group communication protocol for scalable causal ordering

February 2004

·

20 Reads

·

14 Citations

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.

Citations (4)


... |C i (t) -C j (t)| ≤ ET i + ET j for every pair of processes p i and p j following the assumptions. According to the experimentations (Kawanami et al., 2009), the maximum clock offset ET i of each PC C i is several milliseconds if the clock C i is synchronised with a time server through a local area network (LAN). We take advantage of a more precise PC C i which each process p i reads in order to causally deliver messages in a scalable group. ...

Reference:

A hybrid clock group communication protocol
Heterogeneous clock group protocol for causally ordered delivery of messages

International Journal of Wireless and Mobile Computing

... An alternative kind of interconnecting technique that also illustrates its modularity is described by Kawanami et al. [33,34,51] in 2004. This approach does not use inside each interconnected subgroup any of the techniques previously presented in this paper, but a simple algorithm based on physical timestamping. ...

A Scalable Group Communication Protocol with Global Clock

... So, the implementation of such intra-subgroup protocols is not concerned with the global system membership. Additionally, some of the surveyed papers have shown that intrasubgroup protocols may also not depend on its own membership (e.g., the protocols [33] based on GPS modules for achieving a physical clock synchronisation, thus ensuring causal delivery by timestamping messages). As a result, that kind of solutions is able to easily deal with dynamic systems, ensuring thus an acceptable level of scalability for modern applications. ...

A group communication protocol for scalable causal ordering