Abstract
In information delivery through broadcasting, a server continuously pushes information in a broadcast channel and the users access it by tuning in and waiting until the information they are interested in is transmitted. The server follows a schedule that attempts to match the user access statistics in order to reduce the access latency. In case of inhomogeneous user populations with several different access profiles, the users have local cache to smooth out the mismatches of their profile with the broadcast schedule statistics. In this work we propose a method for joint design of the server broadcast schedule and the user caching strategy such that the access delay is minimized. We identify a fluid model of the joint problem on which the joint optimization is performed and subsequently the dynamic schedule is designed to match the optimal fluid model parameters. It turns out that with joint design of the broadcast schedule and the user cache management policy significant performance improvement is achieved, particularly for inhomogeneous user populations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Acharya, R. Alonso, M. Franklin and S. Zdonik, Broadcast disks: data management for asymmetric communication environments, Technical Report CS-94-43, Department of Computer Science, Brown University (October 1994).
S. Acharya, M. Franklin and S. Zdonik, Prefetching from a broadcast disk, in: Proc. 12th International Conf. Data Engrg., New Orleans, LA (February 1996).
AirMedia Inc., http://www.airmedia.com/ (1997).
M.H. Ammar, Response time in a teletext system: an individual user's perspective, IEEE Transactions on Communications, COM-35(11) (November 1987) 1159–1170.
M.H. Ammar and J.W. Wong, The design of teletext broadcast cycles, Performance Evaluation 5(4) (December 1985) 235–242.
M.H. Ammar and J.W. Wong, On the optimality of cyclic transmission in teletext systems, IEEE Transactions on Communications COM-35(1) (January 1987) 68–73.
T. Bowen, G. Gopal, G. Herman, T. Hickey, K. Lee, W. Mansfield, J. Raitz and A. Weinrib, The datacycle architecture, Communications of the ACM 35(12) (December 1992) 71–81.
D.K. Gifford, Polychannel systems for mass digital communication, Communications of the ACM 33(2) (February 1990) 141–151.
S. Hameed and N.H. Vaidya, Log-time algorithms for scheduling single and multiple channel data broadcast, in: Proc. of MOBICOM '97, Budapest, Hungary (September 1997).
Hughes Network Systems, DirecPC, http://www.direcpc. com/ (1996).
Intel Intercast Technology, http://www.intercast.com/ (1997).
D.E. Knuth, The Art of Computer Programming, 2nd edition, Vol. 3 (Addison-Wesley, Reading, MA, 1981).
Marimba Inc., http://www.marimba.com/ (1997).
Pointcast Inc., http://www.pointcast.com/ (1997).
C.J. Su and L. Tassiulas, Broadcast scheduling for information distribution, in: Proc. IEEE INFOCOM '97, Vol. I, Kobe, Japan (1997) pp. 109–117.
L. Tassiulas and C.J. Su, Optimal memory management strategies for a mobile user in a broadcast data delivery system, IEEE Journal on Selected Areas in Communications 15(7) Special Issue on Networking and Performance Issues of Personal Mobile Communications (September 1997) 1226–1238.
A. Tits, FSQP, http://www.isr.umd.edu/Labs/CACSE/ FSQP/fsqp.html
J.W. Wong, Broadcast delivery, Proceedings of the IEEE 76(12) (December 1988) 1566–1577.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Su, C., Tassiulas, L. Joint broadcast scheduling and user's cache management for efficient information delivery. Wireless Networks 6, 279–288 (2000). https://doi.org/10.1023/A:1019102017510
Issue Date:
DOI: https://doi.org/10.1023/A:1019102017510