移动计算系统中基于顶点的共享数据分配

Jin-Woo Song, Kwang-Jo Lee, Jung-Suk Han, Sung-Bong Yang
{"title":"移动计算系统中基于顶点的共享数据分配","authors":"Jin-Woo Song, Kwang-Jo Lee, Jung-Suk Han, Sung-Bong Yang","doi":"10.1109/ICOIN.2008.4472765","DOIUrl":null,"url":null,"abstract":"In mobile environments, mobile users transfer and access a great deal of data. In order to enhance user's access speed in a mobile network, replicated servers can be of great help. But usually a limited number of such servers are deployed in a network due to the cost factor. Thus available replicated servers should be located appropriately; they should be placed at the cells where many users visit frequently. In this paper we propose two vertex-based algorithms that calculate the cumulative numbers of shared data accesses by mobile users at the cells and allocates replicated severs at the cell with the largest numbers of accesses. The proposed algorithms exploit users' moving patterns and data access patterns for locating replicated servers in order to maximize the local access hit ratio of users. The experimental results show that the proposed algorithms improve the system performance over a typical algorithm.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Vertex-based Shared Data Allocation in a Mobile Computing System\",\"authors\":\"Jin-Woo Song, Kwang-Jo Lee, Jung-Suk Han, Sung-Bong Yang\",\"doi\":\"10.1109/ICOIN.2008.4472765\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In mobile environments, mobile users transfer and access a great deal of data. In order to enhance user's access speed in a mobile network, replicated servers can be of great help. But usually a limited number of such servers are deployed in a network due to the cost factor. Thus available replicated servers should be located appropriately; they should be placed at the cells where many users visit frequently. In this paper we propose two vertex-based algorithms that calculate the cumulative numbers of shared data accesses by mobile users at the cells and allocates replicated severs at the cell with the largest numbers of accesses. The proposed algorithms exploit users' moving patterns and data access patterns for locating replicated servers in order to maximize the local access hit ratio of users. The experimental results show that the proposed algorithms improve the system performance over a typical algorithm.\",\"PeriodicalId\":447966,\"journal\":{\"name\":\"2008 International Conference on Information Networking\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Information Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN.2008.4472765\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Information Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2008.4472765","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在移动环境中,移动用户传输和访问大量的数据。在移动网络中,为了提高用户的访问速度,复制服务器可以提供很大的帮助。但由于成本因素,通常在网络中部署的此类服务器数量有限。因此,应该适当地定位可用的复制服务器;它们应该放置在许多用户经常访问的单元中。在本文中,我们提出了两种基于顶点的算法,计算移动用户在单元上共享数据访问的累积次数,并在访问次数最多的单元上分配复制服务器。该算法利用用户的移动模式和数据访问模式来定位复制服务器,以最大化用户的本地访问命中率。实验结果表明,与传统算法相比,本文提出的算法提高了系统的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Vertex-based Shared Data Allocation in a Mobile Computing System
In mobile environments, mobile users transfer and access a great deal of data. In order to enhance user's access speed in a mobile network, replicated servers can be of great help. But usually a limited number of such servers are deployed in a network due to the cost factor. Thus available replicated servers should be located appropriately; they should be placed at the cells where many users visit frequently. In this paper we propose two vertex-based algorithms that calculate the cumulative numbers of shared data accesses by mobile users at the cells and allocates replicated severs at the cell with the largest numbers of accesses. The proposed algorithms exploit users' moving patterns and data access patterns for locating replicated servers in order to maximize the local access hit ratio of users. The experimental results show that the proposed algorithms improve the system performance over a typical algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信