The Community for Technology Leaders
Web Congress, Latin American (2005)
Buenos Aires, Argentina
Oct. 31, 2005 to Nov. 2, 2005
ISBN: 0-7695-2471-0
pp: 140-147
George Pallis , Aristotle University of Thessaloniki
Athena Vakali , Aristotle University of Thessaloniki
Konstantinos Stamos , Aristotle University of Thessaloniki
Antonis Sidiropoulos , Aristotle University of Thessaloniki
Dimitrios Katsaros , Aristotle University of Thessaloniki
Yannis Manolopoulos , Aristotle University of Thessaloniki
Content Distribution Networks (CDNs) are increasingly being used to disseminate data in today's Internet. The growing interest in CDNs is motivated by a common problem across disciplines: how does one reduce the load on the origin server and the traffic on the Internet, and ultimately improve response time to users? In this direction, crucial data management issues should be addressed. A very important issue is the optimal placement of the outsourced content to CDN?s servers. Taking into account that this problem is NP complete, an heuristic method should be developed. All the approaches developed so far assume the existence of adequate popularity statistics. Such information though, is not always available, or it is extremely volatile, turning such methods problematic. This paper develops a network-adaptive, non-parameterized technique to place the outsourced content to CDN?s servers, which requires no a-priori knowledge of request statistics. We place the outsourced objects to these servers with respect to the network latency that each object produces. Through a detailed simulation environment, using both real and synthetic data, we show that the proposed technique can yield up to 25% reduction in user-perceived latency, compared with other heuristic schemes which have knowledge of the content popularity.

A. Vakali, A. Sidiropoulos, K. Stamos, G. Pallis, D. Katsaros and Y. Manolopoulos, "A Latency-Based Object Placement Approach in Content Distribution Networks," Web Congress, Latin American(LA-WEB), Buenos Aires, Argentina, 2005, pp. 140-147.
88 ms
(Ver 3.3 (11022016))