IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2014-03-07 08:50
Sever Location Method for Keeping Shorter Distance from Clients to Servers during Failures
Nao Maeda, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2013-243
Abstract (in Japanese) (See Japanese page) 
(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 xed, and evaluate the performance by using some actual network topologies.
Keyword (in Japanese) (See Japanese page) 
(in English) Network / Graph theory / Computational complexity / Link failures / Server allocation / NP-hard / Polynomial-time algorithm / Approximate algorithm  
Reference Info. IEICE Tech. Rep., vol. 113, no. 472, NS2013-243, pp. 385-390, March 2014.
Paper # NS2013-243 
Date of Issue 2014-02-27 (NS) 
ISSN Print edition: ISSN 0913-5685  Online edition: ISSN 2432-6380
Copyright
and
reproduction
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF NS2013-243

Conference Information
Committee NS IN  
Conference Date 2014-03-06 - 2014-03-07 
Place (in Japanese) (See Japanese page) 
Place (in English) Miyazaki Seagia 
Topics (in Japanese) (See Japanese page) 
Topics (in English) General 
Paper Information
Registration To NS 
Conference Code 2014-03-NS-IN 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Sever 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 Kwansei Gakuin University (Kwansei Gakuin Univ.)
2nd Author's Name Hiroyoshi Miwa  
2nd Author's Affiliation Kwansei Gakuin University (Kwansei Gakuin Univ.)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker
Date Time 2014-03-07 08:50:00 
Presentation Time 20 
Registration for NS 
Paper # IEICE-NS2013-243 
Volume (vol) IEICE-113 
Number (no) no.472 
Page pp.385-390 
#Pages IEICE-6 
Date of Issue IEICE-NS-2014-02-27 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan