Causal Multicast for Mobile Computing Systems
碩士 === 國立中正大學 === 資訊工程研究所 === 87 === In this paper, we propose an algorithm to solve the problem of causal multicast. Our algorithm is based on the idea of "direct dependency" presented in [PRS96]. Since the algorithm of [PRS96] will cause redundant information in some cases, we...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/93409536690787140902 |
| Summary: | 碩士 === 國立中正大學 === 資訊工程研究所 === 87 === In this paper, we propose an algorithm to solve the problem of causal multicast. Our algorithm is based on the idea of "direct dependency" presented in [PRS96]. Since the algorithm of [PRS96] will cause redundant information in some cases, we modify this algorithm by designing a new data structure to eliminate those redundant information. We also propose how to apply our algorithm for the mobile computing systems. The characteristic of mobile infrastructure and the data structure of MHs are used to design our algorithm such that extra information carried by the message can be eliminate. Finally, we also explain how to revise our algorithm by a simple method to solve the problem of missing message during handoff.
|
|---|