S. Tagashira, Fumitake Inada, K. Saisho, Akira Fukuda
{"title":"Design and implementation of a copy update mechanism on a mobile information announcement system","authors":"S. Tagashira, Fumitake Inada, K. Saisho, Akira Fukuda","doi":"10.1109/ICPADS.1998.741038","DOIUrl":null,"url":null,"abstract":"The bandwidth problem between a mobile computer and an access point is pointed out, and a copy update mechanism, which can make the best use of the limited bandwidth, is 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 satisfy client's requests with given bandwidth as much as possible, the proposed mechanism limits traffic of storage type resources in order to announce non-storage type resources prior to storage type resources. Traffic is controlled by limiting the number of concurrent update operations for announcing storage type resources. We implement the prototype and evaluate it. The results show that it can stably announce non-storage type resources.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"380 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.1998.741038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The bandwidth problem between a mobile computer and an access point is pointed out, and a copy update mechanism, which can make the best use of the limited bandwidth, is 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 satisfy client's requests with given bandwidth as much as possible, the proposed mechanism limits traffic of storage type resources in order to announce non-storage type resources prior to storage type resources. Traffic is controlled by limiting the number of concurrent update operations for announcing storage type resources. We implement the prototype and evaluate it. The results show that it can stably announce non-storage type resources.