Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
The process group approach to reliable distributed computing
Communications of the ACM
A generic multicast transport service to support disconnected operation
Wireless Networks
Causal Ordering in Distributed Mobile Systems
IEEE Transactions on Computers - Special issue on mobile computing
Enriched View Synchrony: A Programming Paradigm for Partitionable Asynchronous Distributed Systems
IEEE Transactions on Computers
A framework for delivering multicast message in networks with mobile hosts
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Group-based multicast and dynamic membership in wireless networks with incomplete spatial coverage
Mobile Networks and Applications - Special issue on protocols and software paradigms of mobile networks
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The Challenges of Mobile Computing
Computer
An efficient causal ordering algorithm for mobile computing environments
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
An evaluation of the Amoeba group communication system
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
A Group Communication Approach for Mobile Computing MobileChannel: an ISIS Tool for Mobile Services
A Group Communication Approach for Mobile Computing MobileChannel: an ISIS Tool for Mobile Services
A Reliable Multicast Protocol for Distributed Mobile Systems: Design and Evaluation
IEEE Transactions on Parallel and Distributed Systems
Authenticity in a reliable protocol for mobile computing
Proceedings of the 2003 ACM symposium on Applied computing
Using heuristic search for finding deadlocks in concurrent systems
Information and Computation
DELFIN+: An efficient deadlock detection tool for CCS processes
Journal of Computer and System Sciences
Formal Verification of Concurrent Systems via Directed Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Using heuristic search for finding deadlocks in concurrent systems
Information and Computation
| Hi-index | 0.00 |
In this paper we propose a multicast protocol for a distributed system that includes mobile hosts. The protocol guarantees reliable delivery, i.e. delivery of every multicast and absence of duplicates. The sender of each multicast may select among three increasingly strong delivery ordering guarantees: FIFO, Causal, Total. We make loose assumptions on the underlying computing system: (i) we consider an unreliable wireless network, i.e. one that provides only incomplete spatial coverage and such that messages could be lost even within cells (e.g., due to physical obstructions); (ii) movements are unpredictable, i.e. a user that leaves a cell may enter any other cell, perhaps after a potentially long disconnection. Our solution does not store any sensible state information at mobile support stations, thus movements do not trigger the transmission of any message in the wired network and no notion of hand-off is used. Furthermore, movements at inopportune times can cause only occasional performance penalty but do not affect correctness. Weak assumptions on the underlying computing system, absence of state information at mobile support stations and loose mobility assumptions, contribute to improve the reliability of applications deployed over the proposed protocol.