IEICE TRANSACTIONS on Communications
A Server Selection Method in Content Delivery Networks
Summary :
Load balancing among multiple mirror servers located at distributed positions in the network is a key technique for content delivery services. For bandwidth allocated services, we consider how to select a suitable server from several candidates containing the same content at the time of a request. We propose limiting the candidates in advance and selecting a server from the limited set of servers in a round-robin fashion. The server sets that minimize the variance of the link load are derived using a greedy method for a given network topology and service demand. Through numerical evaluation, we demonstrate that the proposed method is superior to previous methods.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E86-B No.6 pp.1796-1804
- Publication Date
- 2003/06/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Content Delivery Networks)
- Category
- Content Routing and Server Selection
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
Noriaki KAMIYAMA, "A Server Selection Method in Content Delivery Networks" in IEICE TRANSACTIONS on Communications,
vol. E86-B, no. 6, pp. 1796-1804, June 2003, doi: .
Abstract: Load balancing among multiple mirror servers located at distributed positions in the network is a key technique for content delivery services. For bandwidth allocated services, we consider how to select a suitable server from several candidates containing the same content at the time of a request. We propose limiting the candidates in advance and selecting a server from the limited set of servers in a round-robin fashion. The server sets that minimize the variance of the link load are derived using a greedy method for a given network topology and service demand. Through numerical evaluation, we demonstrate that the proposed method is superior to previous methods.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e86-b_6_1796/_p
Copy
@ARTICLE{e86-b_6_1796,
author={Noriaki KAMIYAMA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Server Selection Method in Content Delivery Networks},
year={2003},
volume={E86-B},
number={6},
pages={1796-1804},
abstract={Load balancing among multiple mirror servers located at distributed positions in the network is a key technique for content delivery services. For bandwidth allocated services, we consider how to select a suitable server from several candidates containing the same content at the time of a request. We propose limiting the candidates in advance and selecting a server from the limited set of servers in a round-robin fashion. The server sets that minimize the variance of the link load are derived using a greedy method for a given network topology and service demand. Through numerical evaluation, we demonstrate that the proposed method is superior to previous methods.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - A Server Selection Method in Content Delivery Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1796
EP - 1804
AU - Noriaki KAMIYAMA
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E86-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2003
AB - Load balancing among multiple mirror servers located at distributed positions in the network is a key technique for content delivery services. For bandwidth allocated services, we consider how to select a suitable server from several candidates containing the same content at the time of a request. We propose limiting the candidates in advance and selecting a server from the limited set of servers in a round-robin fashion. The server sets that minimize the variance of the link load are derived using a greedy method for a given network topology and service demand. Through numerical evaluation, we demonstrate that the proposed method is superior to previous methods.
ER -
English
