Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
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 2013-03-08 14:00
Method for Finding Links Protected to Keep Reachability to Server during Simultaneous Two Links Failures
Koji Imagawa, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-252
Abstract (in Japanese) (See Japanese page) 
(in English) The critical links whose failures decrease nodes which is connected with a server in a network must be protected not to fail or to be rapidly switched to their backup links. The number of these links should be small to restrict the investment cost of facilities and the operational cost for Internet service providers. Therefore, it is important to find the links to be protected such that, even if any non-protected links fail, the number of the nodes connected with a server in the resulting graph is maximized.
It was proved that this problem is NP-hard when the number of simultaneous failed links is restricted to four but that it can be solved in polynomial time when the number of simultaneous failed links is restricted to one or when the number of simultaneous failed links is restricted to two and the network topology is tree. However, it is not known whether this problem can be solved in polynomial time or not when the number of simultaneous failed links is two or three. In this paper, we propose a polynomial-time algorithm to solve the problem that the number of the simultaneous link failures is restricted to two. As about 70\% of unintentional failures, excluding ones caused by maintenance, are few links failures, our algorithm for the restricted problem is not only theoretically important but also actually useful.
Keyword (in Japanese) (See Japanese page) 
(in English) network / graph theory / computational complexity / connectivity / link failures / link protection / NP-hard / polynomial-time algorithm  
Reference Info. IEICE Tech. Rep., vol. 112, no. 463, NS2012-252, pp. 505-510, March 2013.
Paper # NS2012-252 
Date of Issue 2013-02-28 (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 NS2012-252

Conference Information
Committee NS IN  
Conference Date 2013-03-07 - 2013-03-08 
Place (in Japanese) (See Japanese page) 
Place (in English) Okinawa Zanpamisaki Royal Hotel 
Topics (in Japanese) (See Japanese page) 
Topics (in English) General 
Paper Information
Registration To NS 
Conference Code 2013-03-NS-IN 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Method for Finding Links Protected to Keep Reachability to Server during Simultaneous Two Links Failures 
Sub Title (in English)  
Keyword(1) network  
Keyword(2) graph theory  
Keyword(3) computational complexity  
Keyword(4) connectivity  
Keyword(5) link failures  
Keyword(6) link protection  
Keyword(7) NP-hard  
Keyword(8) polynomial-time algorithm  
1st Author's Name Koji Imagawa  
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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2013-03-08 14:00:00 
Presentation Time 20 minutes 
Registration for NS 
Paper # NS2012-252 
Volume (vol) vol.112 
Number (no) no.463 
Page pp.505-510 
#Pages 6 
Date of Issue 2013-02-28 (NS) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan