A Server Selection Method in Content Delivery Networks

Noriaki KAMIYAMA  

Publication
IEICE TRANSACTIONS on Communications   Vol.E86-B   No.6   pp.1796-1804
Publication Date: 2003/06/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Issue on Content Delivery Networks)
Category: Content Routing and Server Selection
Keyword: 
content delivery,  server selection,  load balancing,  greedy algorithm,  

Full Text: PDF>>
Buy this Article




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.