Knapsack-model-based Schemes and WLB Algorithm for the Capacity and Efficiency Management of Web Cache

Anbo Xiang, Liang Xu, Baozhuang Niu

Abstract


Web cache refers to the temporary storage of web files/documents. In reality, a set of caches can be grouped into a cluster to improve the server system's performance. In this paper, to achieve the overall cluster efficiency, we propose a weighted load balancing (WLB) routing algorithm by considering both the cache capability and the content property to determine how to direct an arrival request to the right node. Based on Knapsack models, we characterize three new placement/replacement schemes for Web contents caching and then conduct the comparison based on WLB algorithm. We also compare WLB algorithm with two other widely used algorithms: Pure load balancing (PLB) algorithm and Round-Robin (RR) algorithm. Extensive simulation results show that the WLB algorithm works well under the examined cluster content placement/replacement schemes. It generally results in shorter response time and higher cache hit ratio, especially when the cache cluster capacity is scarce.


Keywords


web cache placement/replacement scheme, Knapsack model, load balancing and routing algorithm, performance analysis

Full Text:

PDF

References


Datta, A. et al (2003); World Wide Wait: A Study of Internet Scalability and Cache-based Approaches to Alleviate It, Management Science, ISSN 0025-1909, 49: 1425-1444.

Kumar, C. ; and Norris, J. (2008); A New Approach for A Proxy-level Web Caching Mechanism, Decision Support Systems, ISSN 0167-9236, 46: 52-60.

http://www.economist.com/node/15523761.

http://plone.org/documentation/kb/optimizing-plone/what-to-cache.

Xiang, A. (2006); Essays on information service systemes. PhD Dissertation. Hong Kong University of Science and Technology.

Bahat, O.; Makowski, A. M.; (2003) Optimal Replacement Policies for Non-uniform Cache Objects with Optional Eviction. IEEE INFOCOM 2003, San Francisco, California, April.

Wang, B. et al (2002); Proxy-based Distribution of Streaming Video over Unicast/Multicast Connections. Proceedings of IEEE Infocom, New York, June.

Otoo, E. et al (2002); Disk Cache Replacement Algorithms for Storage Resource Managers in Data Grids. The 15th Annual Supercomputer Conference, Baltimore, Maryland, November.

Rabinovich, M.; Spatscheck, O. (2002); Web Caching and Replication. Addison-Wesley, Boston, MA, US.

Feenan,J. et al (2002); Clustering Web Accelerators. IEEE WECWIS Proceedings, San Diego, June.

Zhang, X., et al (1999); HACC: An Architecture for Cluster-basedWeb Servers. 3rd USENIX Windows NT Symposium, Seattle, Washington, July.

Clevenot, F., et al (2005); Stochastic Fluid Models for Cache Cluster. ISSN 0166-5316, Performance Evaluation, 59: 1-18.

Bertsimas, D.; Demir, R. (2002); An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems. ISSN 0025-1909, Management Science, 48: 550-565.

Breslau, L., et al (1999); Web Caching and Zipf-like Distributions: Evidence and Implications. ISSN 0743-166X, IEEE INFOCOM, 1, 126-134.

Liu, L. et al (2005); Weighted Load Balancing for Web Server Clusters with Caching. Working paper. Hong Kong University of Science and Technology.




DOI: https://doi.org/10.15837/ijccc.2013.4.581



Copyright (c) 2017 Anbo Xiang, Liang Xu, Baozhuang Niu

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]


INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.

 

 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2); Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.