IEICE TRANSACTIONS on Communications
Performance Evaluation of a Load Balancing Routing Algorithm for Clustered Multiple Cache Servers
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E85-B No.1 pp.147-156
- Publication Date
- 2002/01/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Internet Technology II -- Traffic Control and Performance Evaluation in the Internet)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroyoshi MIWA, Kazunori KUMAGAI, Shinya NOGAMI, Takeo ABE, Hisao YAMAMOTO, "Performance Evaluation of a Load Balancing Routing Algorithm for Clustered Multiple Cache Servers" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 1, pp. 147-156, January 2002, doi: .
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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_1_147/_p
Copy
@ARTICLE{e85-b_1_147,
author={Hiroyoshi MIWA, Kazunori KUMAGAI, Shinya NOGAMI, Takeo ABE, Hisao YAMAMOTO, },
journal={IEICE TRANSACTIONS on Communications},
title={Performance Evaluation of a Load Balancing Routing Algorithm for Clustered Multiple Cache Servers},
year={2002},
volume={E85-B},
number={1},
pages={147-156},
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.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Performance Evaluation of a Load Balancing Routing Algorithm for Clustered Multiple Cache Servers
T2 - IEICE TRANSACTIONS on Communications
SP - 147
EP - 156
AU - Hiroyoshi MIWA
AU - Kazunori KUMAGAI
AU - Shinya NOGAMI
AU - Takeo ABE
AU - Hisao YAMAMOTO
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2002
AB - 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.
ER -
English
