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}
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.