Optimal Memory Management Strategies for a Mobile User in a Broadcast Data Delivery System

Data broadcasting has been considered as a promising way of disseminating information to a massive number of users in a wireless communication environment. In a broadcast data delivery system, there is a server which is broadcasting data to a user community. Due to the lack of communication from the users to the server, the server cannot know what a user needs. In order to access a certain item, a user has to wait until the item appears in the broadcast. The waiting time will be considerably long if the server's broadcast schedule does not match the user's access needs. If a user has a local memory, it can alleviate its access latency by selectively prefetching the items from the broadcast and storing them in the memory. A good memory management strategy can substantially reduce the user's access latency, which is a major concern in a broadcast data delivery system. An optimal memory management policy is identified that minimizes the expected aggregate latency. We present optimal memory update strategies with limited look ahead as implementable approximations of the optimal policy. Some interesting special cases are given for which the limited look-ahead policies are optimal. We also show that the same formulation can be used to find the optimal memory management policy which minimizes the number of deadline misses when users generate information requests which have to be satisfied within some given deadlines.

[1]  Tomasz Imielinski,et al.  Mobile wireless computing: challenges in data management , 1994, CACM.

[2]  J. Wong,et al.  Broadcast Delivery , 1988, Proc. IEEE.

[3]  Stanley Zdonik,et al.  Prefetching from a broadcast disk , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[4]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[5]  Tomasz Imielinski,et al.  Data on Air: Organization and Access , 1997, IEEE Trans. Knowl. Data Eng..

[6]  Mostafa H. Ammar,et al.  The Design of Teletext Broadcast Cycles , 1985, Perform. Evaluation.

[7]  Subramaniyam R. Viswanathan,et al.  Publishing in wireless and wireline environments , 1996 .

[8]  Stanley B. Zdonik,et al.  Dissemination-based data delivery using broadcast disks , 1995, IEEE Wirel. Commun..

[9]  Mostafa H. Ammar,et al.  On the optimality of cyclic transmission in teletext systems , 1985, 1985 24th IEEE Conference on Decision and Control.

[10]  Mostafa H. Ammar.  Response Time in a Teletext System: An Individual User's Perspective , 1987, IEEE Trans. Commun..

[11]  Tomasz Imielinski,et al.  Power Efficient Filtering of Data an Air , 1994, EDBT.

[12]  Vassilis J. Tsotras,et al.  A NEW Method to Design Broadcast Schedules in a Wireless Communication Environment , 1996 .

[13]  Stanley B. Zdonik,et al.  Broadcast Disks: Dissemination-based Data Management for Asymmetric Communication Environments , 1997 .

[14]  Tomasz Imielinski,et al.  Energy efficient indexing on air , 1994, SIGMOD '94.

[15]  J. Limb,et al.  Editorial on the IEEE/OSA Journal of Lightwave Technology and the IEEE Journal on Selected Areas in Communications , 1986 .

[16]  Rafael Alonso,et al.  Broadcast disks: data management for asymmetric communication environments , 1995, SIGMOD '95.

[17]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[18]  Leandros Tassiulas,et al.  Broadcast scheduling for information distribution , 1997, Proceedings of INFOCOM '97.

[19]  Gita Gopal,et al.  The Architecture , 2022 .

[20]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.