A Copy Update Mechanism for a Mobile Information Announcement System

0
44

Authors: Akira Fukuda, Fumitake Inada, Keizo Saisho, Shigeaki Tagashira

Tags: 1998, conceptual modeling

In this paper, the bandwidth problem between a mobile computer and an access point is discussed, and a copy update mechanism, which can make the best use of the limited bandwidth, has been proposed. If the bandwidth of a network is not sufficient, a mobile computer cannot announce all resources, and cannot update some copies on fixed computers. To announce non-storage type resources, which include time-constraint resources, as high quality as possible, the proposed mechanism limits traffic of storage type resources and announces non-storage type resources with redundancy. Traffic is controlled by limiting the number of concurrent update operations for announcing storage type resources, and packet loss of non-storage type resources is recovered using a parity packet. We implement the prototype and evaluate it. The results show that it can announce non-storage type resources with high quality.

Read the full paper here: https://link.springer.com/chapter/10.1007/978-3-540-49121-7_23