This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Network Caching Strategies for a Shared Data Distribution for a Predefined Service Demand Sequence
November/December 2003 (vol. 15 no. 6)
pp. 1487-1497

Abstract—In this paper, we address the problem of minimizing the cost of transferring a document or a file requested by a set of users geographically separated on a network of nodes. We concentrate on theoretical aspects of data migration and caching on high-speed networks. Following the information caching paradigm introduced in the literature [CHECK END OF SENTENCE], [CHECK END OF SENTENCE], we present polynomial time optimal caching strategies that minimize the total monetary cost of all the service requests by the users on a high-speed network. We consider a scenario in which a large pool of customers from one or more remote sites on a network demand a document, situated at some site, for their use. We also assume that the users can request the document at different time instants. This process of distributing the requested document incurs communication costs due to the use of communication resources and caching costs of the document at some server sites before it is delivered to the users at their desired time instances. We configure the network as a fully connected topology in which the service providers manage and control the distribution of the requested document among the users. For a high-speed network, we show that a single copy of the requested document is sufficient to serve all the user requests in an optimal manner. We extend the study to a homogeneous case in which the communication costs are identical and caching costs at all the sites are identical. In this case, we demonstrate the adaptability of the algorithm in generating more than one copy when needed by the minimization process. Using these strategies, the network service providers can decide when, where, and for how long the requested documents must be cached at vantage sites to obtain an optimal solution. Illustrative examples are provided to ease the understanding.

[1] V. Bharadwaj, D. Ghose, V. Mani, and T.G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems.Los Alamitos, Calif.: IEEE CS Press, 1996.
[2] K.S. Candan, B. Prabhakaran, and V.S. Subrahmanian, Collaborative Multimedia Documents: Authoring and Presentation Technical Report: CS-TR-3596, UMIACS-TR-96-9, Univ. of Maryland, College Park, Computer Science Technical Series Report, Jan. 1996.
[3] Y.J. Won and J. Srivastava, Strategic Replication of Video Files in a Distributed Environment Multimedia Tools and Applications, no. 2, pp. 249-283, Mar. 1999.
[4] S. Ramanathan and P. Venkat Rangan, Architectures for Personalized Multimedia IEEE Multimedia, vol. 1, no. 1, pp. 37-46, Feb. 1994.
[5] C.H. Papadimitriou, S. Ramanathan, and P. Venkat Rangan, Information Caching for Delivery of Personalized Video Data on Home Entertainment Channels Proc. IEEE Int'l Conf. Multimedia and Computing Systems, pp. 214-223, May 1994.
[6] C.H. Papadimitriou, S. Ramanathan, P. Venkat Rangan, and S. Sampathkumar, Multimedia Information Caching for Personalized Video-on Demand Computer Comm., vol. 18, no. 3, pp. 204-216, Mar. 1995.
[7] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[8] J. Dukes-Schlossberg, L. Yongwon, and L. Nancy, IIDS: Intelligent Information Dissemination Server http://aic.parl.com/badd/MILCOM-papermilcom.html , 1997.
[9] A. Dan and D. Sitaram, A Generalized Interval Caching Policy for Mixed Interactive and Long Video Environments Proc. Multimedia Computing and Networking Conf., Jan. 1996.
[10] A. Dan and D. Sitaram, Multimedia Caching Strategies for Heterogeneous Applications and Server Environments Multimedia Tools and Applications, no. 4, pp. 279-312, 1997.
[11] L. Goluchik, J.C.S. Lui, and R.R. Muntz, Adaptive Piggybacking: A Novel Techniques for Data Sharing in Video-on-Demand Storage Servers ACM Multimedia Systems J., vol. 4, no. 3, pp. 140-155, 1996.
[12] D. Rotem and J.L. Zhao, “Buffer Management for Video Database Systems,” Proc. IEEE Int'l Conf. Data Eng., pp. 439-448, 1995.
[13] C. Aggarwal, J. Wolf, and P. Yu, "Caching on the World Wide Web," IEEE Trans. Knowledge and Data Eng., vol. 11, no. 1, 1999, pp. 94-107.
[14] A. Belloum and L.O. Hertzberger, Replacement Strategies in Web Caching Proc. Conf. IEEE Int'l Symp. Intelligent Control (ISIC) Int'l Symp. Computational Intelligence in Robotics and Automation (CIRA) Intelligent Systems and Semiotics (ISAS) '98, Sept. 1998.
[15] C.C. Bisdikian and B.V. Patel, Cost-Based Data Allocation for Distributed Multimedia-on-Demand Systems IEEE Multimedia, vol. 3, no. 3, pp. 62-72, Fall 1996.
[16] J.-P. Nussbaumer et. al., "Networking Requirements for Interactive Video on Demand," IEEE J. Selected Areas in Communication, Vol. 13, No. 5, June 1995, pp. 779-787.
[17] D. Ghose and H.-J. Kim, Scheduling Video Streams in Video-on-Demand Systems: A Survey Multimedia Tools and Applications, no. 11, pp. 167-195, 2000.
[18] H. Armbruster and K. Wimmer, Broadband Multimedia Applications Using ATM Networks: High Performance Computing, High Capacity Storage, and High-Speed Communication IEEE J. Selected Areas in Comm., vol. 10, no. 9, Dec. 1992.
[19] C.W. Lars and S. Ralf, Concepts for Resource Reservation in Advance Multimedia Tools and Applications, vol. 4, pp. 255-277, Apr. 1997.
[20] D.D. Clark, A Model for Cost Allocation and Pricing in the Internet J. Electronic Publishing, vol. 2, no. 1, May 1996.
[21] K. Jeffrey, L.M. MacKie-Mason, and J. Murphy, The Role of Responsive Pricing in the Internet J. Electronic Publishing, vol. 2, no. 1, May 1996.
[22] A.P. Sistla, O. Wolfson, and Y. Huang, “Minimization of Communication Cost Through Caching in Mobile Environments,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 4, pp. 378-389, Apr. 1998.
[23] A.P. Sistla, O. Wolfson, and Y. Huang, “Minimization of Communication Cost Through Caching in Mobile Environments,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 4, pp. 378-389, Apr. 1998.
[24] L.W. Dowdy and D.V. Foster, "Comparative Models of the File Assignment Problem," ACM Computing Surveys, vol. 14, no. 2, 1982.
[25] K.R. Pattipati and J.L. Wolf, A File Assignment Problem Model for Extended Local Area Networks Proc. Distributed Computing Systems, pp. 554-561, 1990.
[26] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[27] S.E. Dreyfus and R.A. Wagner, The Steiner Problem in Graphs Networks, vol. 1, pp. 195-207, 1971.
[28] F.K. Hwang, D.S. Richards, and P. Winter, The Steiner Tree Problem. North-Holland Press, 1992.

Index Terms:
Shared data distribution, communication cost, caching cost, fully connected network, dynamic programming.
Citation:
Bharadwaj Veeravalli, "Network Caching Strategies for a Shared Data Distribution for a Predefined Service Demand Sequence," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 6, pp. 1487-1497, Nov.-Dec. 2003, doi:10.1109/TKDE.2003.1245287
Usage of this product signifies your acceptance of the Terms of Use.