DocumentCode :
2915691
Title :
Methods of Locating Mirror Servers with High Connectivity and Small Distances
Author :
Nakamura, Ryota ; Hashimoto, Akito ; Miwa, Hiroyoshi
Author_Institution :
Kwansei Gakuin Univ., Sanda, Japan
fYear :
2009
fDate :
4-6 Nov. 2009
Firstpage :
353
Lastpage :
356
Abstract :
The server mirroring method has extensively used as the technology for contents delivery networks. Several mirror servers that serve same contents are located in a network, and an access is navigated to one of the mirror servers based on the delay time and the load balance. The location of the mirror servers with high reliability against a failure and small delay times of accesses is important. In this paper, we deal with the server location problem, which determines the location of the mirror servers that satisfies the following two constraints: the reachability to at least one server is guaranteed even if a link fails, and the maximum of the sum of the distances to the servers is restricted. We propose two heuristic algorithms for the problem and evaluate the algorithms by applying to some real networks. The results show that the algorithms perform well.
Keywords :
Internet; queueing theory; reachability analysis; resource allocation; contents delivery network; delay time; load balance; mirror servers location; reachability constraint; server location problem; server mirroring method; Delay effects; Heuristic algorithms; Intelligent networks; International collaboration; Mirrors; Navigation; Network servers; Contents Delivery Networks; Heuristic Algorithm; Mirror servers; Optimization Problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Networking and Collaborative Systems, 2009. INCOS '09. International Conference on
Conference_Location :
Barcelona
Print_ISBN :
978-1-4244-5165-4
Electronic_ISBN :
978-0-7695-3858-7
Type :
conf
DOI :
10.1109/INCOS.2009.53
Filename :
5369340
Link To Document :
بازگشت