.png){kind=icon}
.png){kind=icon}
Return
Causal ordering in distributed mobile systems
.png){kind=icon}
PRE
AI
DOI：10.1109/12.580430.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
There is a growing trend in using mobile computing environment for several applications, and it is important that the mobile systems are provided adequate support both at the systems level and at the communication level. Causal ordering is a useful property, particularly in applications that involve human interactions. (Such applications are common in mobile computing environments.) In this paper, we present three algorithms for causal ordering in mobile sytems. The first algorithm handles the resource constraints of the mobile hosts, but the system is not easily scalable with respect to the number of mobile hosts and is not graceful to host disconnections and connections. Our second algorithm eliminates the above disadvantages at the cost of inhibiting some messages. The third algorithm is a combination of the first two algorithms.
Keywords:
mobile computing
asynchrony
causal ordering
message overhead
communication complexity
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
Organization
No organization information available