Approximate server selection algorithms in Content Distribution Networks

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

Server selection is an important function in any replication-based infrastructure, aiming at redirecting client requests to the "best" server according to some predefined metrics. Previous research work has mainly focused on client-side redirection schemes, where the client is responsible for the server selection process. Furthermore, previous work has shown that client probing techniques perform significantly better in discovering the "best" server, compared to hop- or RTT-based schemes. Client probing, however, is not very scalable, since the number of clients and servers in the network will be very large. In this paper, we propose a novel technique to transform the server selection problem into a problem of optimal routing, which enables us to shift the redirection process from the client to the server-side. In particular, we consider the environment of a Content Distribution Network (CDN), and propose a flexible framework that can be used to optimize the server selection process, according to various metrics and/or policies. Using trace-driven simulations, we show that the proposed method can improve significantly the response time of HTTP requests while keeping the control overhead at a very low level.

Original languageEnglish
Pages (from-to)1490-1494
Number of pages5
JournalIEEE International Conference on Communications
Volume3
Publication statusPublished - 2005
Externally publishedYes

Fingerprint

Electric power distribution
Servers
HTTP

ASJC Scopus subject areas

  • Media Technology

Cite this

@article{742c9d585cfd42aaa26e78e2a9aedb22,
title = "Approximate server selection algorithms in Content Distribution Networks",
abstract = "Server selection is an important function in any replication-based infrastructure, aiming at redirecting client requests to the {"}best{"} server according to some predefined metrics. Previous research work has mainly focused on client-side redirection schemes, where the client is responsible for the server selection process. Furthermore, previous work has shown that client probing techniques perform significantly better in discovering the {"}best{"} server, compared to hop- or RTT-based schemes. Client probing, however, is not very scalable, since the number of clients and servers in the network will be very large. In this paper, we propose a novel technique to transform the server selection problem into a problem of optimal routing, which enables us to shift the redirection process from the client to the server-side. In particular, we consider the environment of a Content Distribution Network (CDN), and propose a flexible framework that can be used to optimize the server selection process, according to various metrics and/or policies. Using trace-driven simulations, we show that the proposed method can improve significantly the response time of HTTP requests while keeping the control overhead at a very low level.",
author = "Spiridon Bakiras",
year = "2005",
language = "English",
volume = "3",
pages = "1490--1494",
journal = "Conference Record - International Conference on Communications",
issn = "0536-1486",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Approximate server selection algorithms in Content Distribution Networks

AU - Bakiras, Spiridon

PY - 2005

Y1 - 2005

N2 - Server selection is an important function in any replication-based infrastructure, aiming at redirecting client requests to the "best" server according to some predefined metrics. Previous research work has mainly focused on client-side redirection schemes, where the client is responsible for the server selection process. Furthermore, previous work has shown that client probing techniques perform significantly better in discovering the "best" server, compared to hop- or RTT-based schemes. Client probing, however, is not very scalable, since the number of clients and servers in the network will be very large. In this paper, we propose a novel technique to transform the server selection problem into a problem of optimal routing, which enables us to shift the redirection process from the client to the server-side. In particular, we consider the environment of a Content Distribution Network (CDN), and propose a flexible framework that can be used to optimize the server selection process, according to various metrics and/or policies. Using trace-driven simulations, we show that the proposed method can improve significantly the response time of HTTP requests while keeping the control overhead at a very low level.

AB - Server selection is an important function in any replication-based infrastructure, aiming at redirecting client requests to the "best" server according to some predefined metrics. Previous research work has mainly focused on client-side redirection schemes, where the client is responsible for the server selection process. Furthermore, previous work has shown that client probing techniques perform significantly better in discovering the "best" server, compared to hop- or RTT-based schemes. Client probing, however, is not very scalable, since the number of clients and servers in the network will be very large. In this paper, we propose a novel technique to transform the server selection problem into a problem of optimal routing, which enables us to shift the redirection process from the client to the server-side. In particular, we consider the environment of a Content Distribution Network (CDN), and propose a flexible framework that can be used to optimize the server selection process, according to various metrics and/or policies. Using trace-driven simulations, we show that the proposed method can improve significantly the response time of HTTP requests while keeping the control overhead at a very low level.

UR - http://www.scopus.com/inward/record.url?scp=24144441712&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24144441712&partnerID=8YFLogxK

M3 - Article

VL - 3

SP - 1490

EP - 1494

JO - Conference Record - International Conference on Communications

JF - Conference Record - International Conference on Communications

SN - 0536-1486

ER -