移动信息公告系统副本更新机制的设计与实现

S. Tagashira, Fumitake Inada, K. Saisho, Akira Fukuda
{"title":"移动信息公告系统副本更新机制的设计与实现","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":"{\"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}","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

摘要

指出了移动计算机与接入点之间的带宽问题,提出了一种能充分利用有限带宽的副本更新机制。如果网络带宽不足,移动计算机无法宣布所有资源,并且无法更新固定计算机上的某些副本。为了在给定带宽下尽可能满足客户端请求,该机制限制了存储类型资源的流量,使非存储类型资源优先于存储类型资源。通过限制宣布存储类型资源的并发更新操作的数量来控制流量。我们实现原型并对其进行评估。结果表明,该方法可以稳定地宣布非存储类型的资源。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Design and implementation of a copy update mechanism on a mobile information announcement system
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Object replication using version vector An efficient thread architecture for a distributed shared memory on symmetric multiprocessor clusters A new replication strategy for unforeseeable disconnection under agent-based mobile computing system On reconfiguring query execution plans in distributed object-relational DBMS Reusing MS-Windows software applications under CORBA environment
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1