Vertex-based Shared Data Allocation in a Mobile Computing System

Jin Woo Song, Kwang Jo Lee, Jung Suk Han, Sung Bong Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 overa typical algorithm.

Original languageEnglish
Title of host publication2008 International Conference on Information Networking, ICOIN
DOIs
Publication statusPublished - 2008 Aug 25
Event2008 International Conference on Information Networking, ICOIN - Busan, Korea, Republic of
Duration: 2008 Jan 232008 Jan 25

Publication series

Name2008 International Conference on Information Networking, ICOIN

Other

Other2008 International Conference on Information Networking, ICOIN
CountryKorea, Republic of
CityBusan
Period08/1/2308/1/25

Fingerprint

Mobile computing
Servers
Wireless networks
Costs

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems

Cite this

Song, J. W., Lee, K. J., Han, J. S., & Yang, S. B. (2008). Vertex-based Shared Data Allocation in a Mobile Computing System. In 2008 International Conference on Information Networking, ICOIN [4472765] (2008 International Conference on Information Networking, ICOIN). https://doi.org/10.1109/ICOIN.2008.4472765
Song, Jin Woo ; Lee, Kwang Jo ; Han, Jung Suk ; Yang, Sung Bong. / Vertex-based Shared Data Allocation in a Mobile Computing System. 2008 International Conference on Information Networking, ICOIN. 2008. (2008 International Conference on Information Networking, ICOIN).
@inproceedings{373bba97794e4f0a8e269d84573cda89,
title = "Vertex-based Shared Data Allocation in a Mobile Computing System",
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 overa typical algorithm.",
author = "Song, {Jin Woo} and Lee, {Kwang Jo} and Han, {Jung Suk} and Yang, {Sung Bong}",
year = "2008",
month = "8",
day = "25",
doi = "10.1109/ICOIN.2008.4472765",
language = "English",
isbn = "8996076112",
series = "2008 International Conference on Information Networking, ICOIN",
booktitle = "2008 International Conference on Information Networking, ICOIN",

}

Song, JW, Lee, KJ, Han, JS & Yang, SB 2008, Vertex-based Shared Data Allocation in a Mobile Computing System. in 2008 International Conference on Information Networking, ICOIN., 4472765, 2008 International Conference on Information Networking, ICOIN, 2008 International Conference on Information Networking, ICOIN, Busan, Korea, Republic of, 08/1/23. https://doi.org/10.1109/ICOIN.2008.4472765

Vertex-based Shared Data Allocation in a Mobile Computing System. / Song, Jin Woo; Lee, Kwang Jo; Han, Jung Suk; Yang, Sung Bong.

2008 International Conference on Information Networking, ICOIN. 2008. 4472765 (2008 International Conference on Information Networking, ICOIN).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Vertex-based Shared Data Allocation in a Mobile Computing System

AU - Song, Jin Woo

AU - Lee, Kwang Jo

AU - Han, Jung Suk

AU - Yang, Sung Bong

PY - 2008/8/25

Y1 - 2008/8/25

N2 - 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 overa typical algorithm.

AB - 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 overa typical algorithm.

UR - http://www.scopus.com/inward/record.url?scp=49749093854&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49749093854&partnerID=8YFLogxK

U2 - 10.1109/ICOIN.2008.4472765

DO - 10.1109/ICOIN.2008.4472765

M3 - Conference contribution

AN - SCOPUS:49749093854

SN - 8996076112

SN - 9788996076117

T3 - 2008 International Conference on Information Networking, ICOIN

BT - 2008 International Conference on Information Networking, ICOIN

ER -

Song JW, Lee KJ, Han JS, Yang SB. Vertex-based Shared Data Allocation in a Mobile Computing System. In 2008 International Conference on Information Networking, ICOIN. 2008. 4472765. (2008 International Conference on Information Networking, ICOIN). https://doi.org/10.1109/ICOIN.2008.4472765