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 2014-03-07 11:20
Approximation Algorithm for Finding Protected Links to Keep Small Increase of Path Length during Link Failures
Kohei Nishida, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2013-241
Abstract (in Japanese) (See Japanese page) 
(in English) A telecommunication network should be reliable, since it is important as social infrastructure. However, in many actual networks, there exists the risk that the quality of service drastically degrades when the length of paths increases by a link failure. To get rid of this risk, it is necessary to design a network so that the maximum increase rate of the length of all paths is small even if a link fails. Therefore, the critical links whose failures significantly degrade the performance must be protected by rapid recovery so that the failures cannot be detected over the IP layer. The number of protected links should be small to restrict the investment cost for facilities and operational cost for Internet service providers. In this paper, we formulate this link protection problem. In addition, we propose an approximation algorithm to solve the problem that the number of simultaneous link failures is restricted to two.
Keyword (in Japanese) (See Japanese page) 
(in English) network / quality of service / link failure / increase of path length / optimization / approximation algorithm / /  
Reference Info. IEICE Tech. Rep., vol. 113, no. 472, NS2013-241, pp. 373-378, March 2014.
Paper # NS2013-241 
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-241

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) Approximation Algorithm for Finding Protected Links to Keep Small Increase of Path Length during Link Failures 
Sub Title (in English)  
Keyword(1) network  
Keyword(2) quality of service  
Keyword(3) link failure  
Keyword(4) increase of path length  
Keyword(5) optimization  
Keyword(6) approximation algorithm  
Keyword(7)  
Keyword(8)  
1st Author's Name Kohei Nishida  
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 2014-03-07 11:20:00 
Presentation Time 20 minutes 
Registration for NS 
Paper # NS2013-241 
Volume (vol) vol.113 
Number (no) no.472 
Page pp.373-378 
#Pages 6 
Date of Issue 2014-02-27 (NS) 

[Return to Top Page]

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