| Presentation | 2014-03-07 Server Location Method for Keeping Shorter Distance from Clients to Servers during Failures Nao MAEDA, Hiroyoshi MIWA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Recently, large contents in the Internet have increased loads of contents servers, networks and data centers which may degrade the quality of service. To overcome this problem, some mirror servers providing the same contents are located on a network and a request is navigated to one of the mirror servers. Moreover, the network should have a communication to one of the servers and the hop length of a path from a user to a server should be short even during link failure. As it affects the performance, the location of the mirror servers is important. In this paper, we address the server location problem, which determines the location of the servers satisfying the following the constraint: any users can access servers within a small hop count even if some links fails. First, we formulate this problem and prove that it is NP-hard. Second, we present a polynomial-time algorithm to solve this problem when the number of simultaneously failed links is restricted to one and evaluate the performance of actual ISP network topologies by the algorithm from the viewpoint of the number of servers. Furthermore, we also present an approximation algorithm to solve this problem when the number of servers to be accessed is restricted to one and the number of simultaneously failed links is fixed, and evaluate the performance by using some actual network topologies. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Network / Graph theory / Computational complexity / Link failures / Server allocation / NP-hard / Polynomial-time algorithm / Approximate algorithm |
| Paper # | NS2013-243 |
| Date of Issue |
| Conference Information | |
| Committee | NS |
|---|---|
| Conference Date | 2014/2/27(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Network Systems(NS) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Server Location Method for Keeping Shorter Distance from Clients to Servers during Failures |
| Sub Title (in English) | |
| Keyword(1) | Network |
| Keyword(2) | Graph theory |
| Keyword(3) | Computational complexity |
| Keyword(4) | Link failures |
| Keyword(5) | Server allocation |
| Keyword(6) | NP-hard |
| Keyword(7) | Polynomial-time algorithm |
| Keyword(8) | Approximate algorithm |
| 1st Author's Name | Nao MAEDA |
| 1st Author's Affiliation | Graduate School of Science and Technology, Kwansei Gakuin University() |
| 2nd Author's Name | Hiroyoshi MIWA |
| 2nd Author's Affiliation | Graduate School of Science and Technology, Kwansei Gakuin University |
| Date | 2014-03-07 |
| Paper # | NS2013-243 |
| Volume (vol) | vol.113 |
| Number (no) | 472 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |