Distributed caching and broadcast in a wireless mobile computing environment

被引:3
作者
Fong, CCF [1 ]
Lui, JCS [1 ]
Wong, MH [1 ]
机构
[1] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China
关键词
Algorithms - Bandwidth - Client server computer systems - Communication channels (information theory) - Computational complexity - Heuristic methods - Network protocols - Response time (computer systems) - Wireless telecommunication systems;
D O I
10.1093/comjnl/42.6.455
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In a mobile computing system, the wireless communication bandwidth is a scarce resource that needs to be managed carefully. In this paper, we investigate the use of distributed caching as an approach to reduce the wireless bandwidth consumption for data access. We find that conventional caching techniques cannot fully utilize the dissemination feature of the wireless channel, We thus propose a novel distributed caching protocol that can minimize the overall system bandwidth consumption at the cost of central processor unit processing time at the server side. This protocol allows the base station to select data items into a broadcast set, based on a performance gain parameter called the bandwidth gain, and then send the broadcast set to all the mobile computers within the server's cell. We show that, in general, this selection process is NP-hard and therefore, we propose a heuristic algorithm that can attain a near-optimal performance. We also propose an analytical model for the protocol and derive closed-form performance measures, such as the bandwidth utilization and the expected response time of data access by mobile computers. Experiments show that our distributed caching protocol can greatly reduce the bandwidth consumption so that the wireless network environment can accommodate more users, and at the same time vastly improve the expected response time for data access by mobile computers.
引用
收藏
页码:455 / 472
页数:18
相关论文
共 19 条
[1]  
ACHARYA S, 1995, ACM SIGMOD C, P199
[2]  
Alonso R., 1993, SIGMOD Record, V22, P388, DOI 10.1145/170036.170092
[3]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[4]  
[Anonymous], ACM SIGMOD RECORD
[5]  
BARBARA D, 1994, ACM SIGMOD, P1
[6]  
DESIMONE A, 1995, ACM J WIRELESS NETWK, V1, P241
[7]   Quantifying complexity and performance gains of distributed caching in a wireless network environment [J].
Fong, CCF ;
Lui, JCS ;
Wong, MH .
13TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING - PROCEEDINGS, 1997, :104-113
[8]  
FORMAN GH, 1994, IEEE COMPUTER APR, P38
[9]  
FRANKLIN MJ, 1992, CSTR921089 U WISC DK
[10]  
HUANG Y, 1994, P IEEE 10 DE 94, P20