Performance evaluation of a load balancing routing algorithm for clustered multiple cache servers

ISSN: 09168516
2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

Abstract

The explosive growth of World Wide Web usage is causing a number of performance problems, including slow response times, network congestion, and denial of service. Web site that has a huge number of accesses and requires high quality of services, such as a site offering hosting services, or content delivery services, usually uses a cache server to reduce the load on the original server offering the original content. To increase the throughput of the caching process and to improve service availability, multiple cache servers are often positioned in front of the original server. This requires a switch to direct incoming requests to one of the multiple cache servers. In this paper, we propose a routing algorithm for such a switch in front of clustered multiple cache servers and evaluate its performance by simulation. The results show that our routing algorithm is effective when content has request locality and a short period of validity, for example, news, map data, road traffic data, or weather information. We also identify points to consider when the proposed algorithm is applied to a real system.

Cite

CITATION STYLE

APA

Miwa, H., Kumagai, K., Nogami, S., Abe, T., & Yamamoto, H. (2002). Performance evaluation of a load balancing routing algorithm for clustered multiple cache servers. IEICE Transactions on Communications, E85-B(1), 147–156.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free