skip to main content
article

Optimal methods for coordinated enroute web caching for tree networks

Published: 01 August 2005 Publication History

Abstract

Web caching is an important technology for improving the scalability of Web services. One of the key problems in coordinated enroute Web caching is to compute the locations for storing copies of an object among the enroute caches so that some specified objectives are achieved. In this article, we address this problem for tree networks, and formulate it as a maximization problem. We consider this problem for both unconstrained and constrained cases. The constrained case includes constraints on the cost gain per node and on the number of object copies to be placed. We present dynamic programming-based solutions to this problem for different cases and theoretically show that the solutions are either optimal or convergent to optimal solutions. We derive efficient algorithms that produce these solutions. Based on our mathematical model, we also present a solution to coordinated enroute Web caching for autonomous systems as a natural extension of the solution for tree networks. We implement our algorithms and evaluate our model on different performance metrics through extensive simulation experiments. The implementation results show that our methods outperform the existing algorithms of either coordinated enroute Web caching for linear topology or object placement (replacement) at individual nodes only.

References

[1]
Awerbuch, B., Bartal, Y., and Fiat, A. 1998. Distributed paging for general networks. J. Algorithms 28, 67--104.]]
[2]
Barford, P. and Crovella, M. 1998. Generating representative Web workloads for network and server performance evaluation. In Proceedings of ACM SIGMETRICS'98. 151--160.]]
[3]
Bates, T., Gerich E., Joncheray, L., Jouanigot, J. M., Karrenberg, D., Terpstra, M. and Yu, J. 1995. Representation of IP routing policies in a routing registry. RFC 1786. IETF.]]
[4]
Breslau, L., Cao, P., Fan, L., Phillips, G., and Shenker, S. 1999. Web caching and zip-like distributions: evidence and implications. In Proceedings of IEEE INFOCOM'99. 126--134.]]
[5]
Calvert, K. L., Doar, M. B., and Zegura, E. W. 1997. Modelling internet topology. IEEE Comm. Magazine 35, 6, 160--163.]]
[6]
Cao, P. and Irani, S. 1997. Cost-aware WWW proxy caching algorithms. In Proceedings of the 1st USENIX Symposium on Internet Technologies and Systems (USITS). 193--206.]]
[7]
Chankhunthod, A., Danzig, P., Neerdaels, C., Schwartz, M., and Worrell, K. 1996. A hierarchical Internet object cache. In Proceedings of the USENIX Technical Conference. 22--26.]]
[8]
Cunha, C., Bestavros, A., and Crovella, M. 1995. Characteriatics of WWWW Client-Based Traces. Tech. rep. TR-95-010, Boston University, Boston, MA.]]
[9]
Dahlin, M. D., Wang, R. Y., Anderson, T. E., and Patterson, D. A. 1994. Cooperative caching: using remote client memory to improve file system performance. In Proceedings of the 1st Symposium on Operating Systems Design and Implementations. 267--280.]]
[10]
Davison, B. D. 2001. A Web caching primer. IEEE Internet Comput. 5, 4, 38--45.]]
[11]
Glassman, S. 1994. A caching relay for the World Wide Web. Comput. Netw. ISDN Syst. 27, 2, 165--173.]]
[12]
Jia, X., Li, D., Hu, X., and Du, D. 2001. Optimal placement of Web proxies for replicated Web servers in the Internet. Comput. J. 44, 5, 329--339.]]
[13]
Jiang, A. and Bruck, J. 2003. Optimal content placement for enroute Web caching. In Proceedings of the 2nd International Symposium on Network Computing and Applications (NCA'03). 9--16.]]
[14]
Jin, S. and Bestavros, A. 2001. Greeddual* Web caching algorithm exploiting the two sources of temporal locality in Web request streams. Comput. Comm. 4, 2, 174--183.]]
[15]
Korupolu, M. R. and Dahlin, M. 2002. Coordinated placement and replacement for large-scale distributed caches. IEEE Tran. Knowl. Data Eng. 14, 6, 1317--1329.]]
[16]
Korupolu, M. R., Plaxton, C. G., and Rajaraman, R. 1999. Placement algorithms for hierarchical coorperative caching. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms. 586--595.]]
[17]
Krishnan, P., Raz, D., and Shavitt, Y. 2000. The cache location problem. IEEE/ACM Trans. Netw. 8, 5, 568--582.]]
[18]
Leff, A., Wolf, J. L., and Yu, P. S. 1993. Replication algorithms in a remote caching architecture. IEEE Trans. Paral. Distrib. Syst. 4, 11, 1185--1204.]]
[19]
Li, B., Golin, M. J., Italiano, G. F., Deng, X., and Sohraby, K. 1999. On the optimal placement of Web proxies in the Internet. In Proceedings of IEEE INFOCOM'99. 1282--1290.]]
[20]
Li, K. and Shen, H. 2003. Constrained coordinated enroute Web caching in tree networks. In Proceedings of the 3rd International Conference on Hybrid Intelligent Systems (HIS'03). 1054--1063.]]
[21]
Li, K. and Shen, H. 2003. An optimal method for coordinated enroute Web object caching. In Proceedings of the 5th International Symposium on High Performance Computing (ISHPC-V). 368--375.]]
[22]
Paxson, V. 1997. End-to-end routing behavior in the Internet. IEEE/ACM Trans. Netw. 5, 5, 601--615.]]
[23]
Pierre, G. and Steen, M. 2002. Dynamically selecting optimal distribution strategies for Web documents. IEEE Trans. Comput. 51, 6, 637--651.]]
[24]
Rabinovich, M. and Spatscheck, O. 2002. Web Caching and Replication. Addison-Wesley.]]
[25]
Rabinovich, P. and Wang, H. 2001. Dhttp: an efficient and cache-friendly transfer protocol for Web traffic. In Proceedings of IEEE INFOCOM'01. 1597--1606.]]
[26]
Rodriguez, P. and Sibal, S. 2000. Spread: Scalable platform for reliable and efficient automated distribution. Comput. Netw. 33, 33--49.]]
[27]
Rodriguez, P., Sibal, S., and Spatscheck, O. 2000. Tpot: translucent proxying of TCP. In Proceedings of the 5th International Web Caching and Content Delivery Workshop (WCW'00).]]
[28]
Rodriguez, P., Spanner, C., and Biersack, E. W. 2001. Analysis of Web caching architectures: Hierarchical and distributed caching. IEEE/ACM Trans. Netw. 9, 4, 404--418.]]
[29]
Scheuermann, P., Shim, J., and Vingralek, R. 1997. A case for delay-conscious caching of Web documents. Comput. Netw. ISDN Syst. 2, 8--13, 997--1005.]]
[30]
Shim, J., Scheuermann, P., and Vingralek, R. 1999. Proxy cache algorithms: design, implementation, and performance. IEEE Trans. Knowl. Data Eng. 11, 4, 549--562.]]
[31]
Tang, X. and Chanson, S. T. 2002. Coordinated enroute Web caching. IEEE Trans. Comput. 51, 6, 595--607.]]
[32]
Tennenhouse, D. L., Smith, J. M., Sincoskie, W. D., Wetherall, D. J., and Minden, G. J. 1997. A survey of active network research. IEEE Comm. Magazine 35, 1, 80--86.]]
[33]
Tewari, X., Dahlin, M., Vin, H. M., and Kay, J. S. 1999. Design considerations for distributed caching on the Internet. In Proceedings of the 19th International Conference on Distributed Computing Systems (ICDCS'99). 273--284.]]
[34]
Wang, J. 1999. A survey of Web caching schemes for the internet. ACM SIGCOMM Comput. Comm. Rev. 29, 5, 36--46.]]
[35]
Williams, S., Abrams, M., Standbridge, C. R., Abdulla, G., and Fox, E. A. 1996. Removal policies in network caches for World Wide Web documents. In Proceedings of ACM SIGCOMM'96. 293--305.]]
[36]
Wolfson, O. and Milo, A. 1991. The multicast policy and its relationship to replicated data placement. ACM Trans. Datab. Syst. 16, 1, 181--205.]]
[37]
Xu, J., Li, B., and Li, D. L. 2002. Placement problems for transparent data replication proxy services. IEEE J. Select. Areas Comm. 20, 7, 1383--1398.]]
[38]
Yu, P. S. and MacNair, E. A. 1998. Performance study of a collaborative method for hierarchical caching in proxy servers. Computer Netw. ISDN Syst. 30, 215--224.]]

Cited By

View all
  • (2020)A multi-objective krill herd algorithm for virtual machine placement in cloud computingThe Journal of Supercomputing10.1007/s11227-018-2516-176:6(4525-4542)Online publication date: 1-Jun-2020
  • (2018)Enhanced cuckoo search algorithm for virtual machine placement in cloud data centresInternational Journal of Grid and Utility Computing10.1504/IJGUC.2018.0902219:1(1-17)Online publication date: 1-Jan-2018
  • (2017)Caching Online VideoACM Transactions on Multimedia Computing, Communications, and Applications10.1145/310615713:4(1-21)Online publication date: 12-Aug-2017
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Internet Technology
ACM Transactions on Internet Technology  Volume 5, Issue 3
August 2005
132 pages
ISSN:1533-5399
EISSN:1557-6051
DOI:10.1145/1084772
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 2005
Published in TOIT Volume 5, Issue 3

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Web caching
  2. autonomous system (AS)
  3. dynamic programming
  4. object placement (replacement)
  5. performance evaluation
  6. tree network

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)1
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2020)A multi-objective krill herd algorithm for virtual machine placement in cloud computingThe Journal of Supercomputing10.1007/s11227-018-2516-176:6(4525-4542)Online publication date: 1-Jun-2020
  • (2018)Enhanced cuckoo search algorithm for virtual machine placement in cloud data centresInternational Journal of Grid and Utility Computing10.1504/IJGUC.2018.0902219:1(1-17)Online publication date: 1-Jan-2018
  • (2017)Caching Online VideoACM Transactions on Multimedia Computing, Communications, and Applications10.1145/310615713:4(1-21)Online publication date: 12-Aug-2017
  • (2017)A Grouping Genetic Algorithm for Virtual Machine Placement in Cloud ComputingCollaborate Computing: Networking, Applications and Worksharing10.1007/978-3-319-59288-6_43(468-473)Online publication date: 5-Jul-2017
  • (2015)HiFiProceedings of the 23rd ACM international conference on Multimedia10.1145/2733373.2806268(421-430)Online publication date: 13-Oct-2015
  • (2015)Design and analysis of collaborative EPC and RAN caching for LTE mobile networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2015.10.01293:P1(80-95)Online publication date: 24-Dec-2015
  • (2015)Congestion-aware message forwarding in delay tolerant networksConcurrency and Computation: Practice & Experience10.1002/cpe.364727:18(5722-5734)Online publication date: 25-Dec-2015
  • (2014)CRRP: Cost-Based Replacement with Random Placement for En-Route CachingIEICE Transactions on Information and Systems10.1587/transinf.E97.D.1914E97.D:7(1914-1917)Online publication date: 2014
  • (2014)Scalable algorithms for estimating flow length distributions from sampled dataComputing10.1007/s00607-014-0386-996:6(527-543)Online publication date: 1-Jun-2014
  • (2014)Resource preprocessing and optimal task scheduling in cloud computing environmentsConcurrency and Computation: Practice and Experience10.1002/cpe.320427:13(3461-3482)Online publication date: 14-Jan-2014
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media