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 language | English |
|---|---|
| Title of host publication | 2008 International Conference on Information Networking, ICOIN |
| DOIs | |
| Publication status | Published - 2008 Aug 25 |
| Event | 2008 International Conference on Information Networking, ICOIN - Busan, Korea, Republic of Duration: 2008 Jan 23 → 2008 Jan 25 |
Other
| Other | 2008 International Conference on Information Networking, ICOIN |
|---|---|
| Country | Korea, Republic of |
| City | Busan |
| Period | 08/1/23 → 08/1/25 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Information Systems
Cite this
}
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.Research output: Chapter in Book/Report/Conference proceeding › Conference 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
SN - 8996076112
SN - 9788996076117
BT - 2008 International Conference on Information Networking, ICOIN
ER -