Approximate server selection algorithms in content distribution networks
Approximate server selection algorithms in content distribution networks
复制标题
DOI：
10.1109/icc.2005.1494593
复制
发表时间：
2005-05
期刊：
影响因子：
--
通讯作者：
S. Bakiras
中科院分区：
文献类型：
--
作者：
S. Bakiras
服务器选择是任何基于复制的基础设施中的重要功能，旨在根据某些预定义的指标将客户端请求重定向到“最佳”服务器。以前的研究工作主要集中在客户端重定向方案，其中客户端负责服务器选择过程。此外，以前的工作表明，客户端探测技术在发现“最佳”服务器方面的表现明显优于基于跳或RTT的方案。然而，客户端探测的可扩展性不是很好，因为网络中的客户端和服务器的数量将非常大。在本文中，我们提出了一种新的技术，将服务器选择问题转化为最优路由的问题，这使我们能够将重定向过程从客户端转移到服务器端。特别是，我们考虑的内容分发网络（CDN）的环境，并提出了一个灵活的框架，可用于优化服务器选择过程中，根据各种指标和/或政策。使用跟踪驱动的模拟，我们表明，所提出的方法可以显着提高HTTP请求的响应时间，同时保持在一个非常低的控制开销。
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.