| 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 | 2012-03-09 14:10 Approximation Algorithms for Finding Protected Links to Keep Small Diameter during Link Failures Koji Imagawa, Takeshi Fujimura, Hiroyoshi Miwa (Kwansei Gakuin Univ.)  NS2011-251 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | The high reliability and performance are needed as the Internet becomes an important social infrastructure. Network delay is one of measure of the performance of network. As the delay between two nodes correlates roughly with the distance between them, the diameter of the network which is the maximum distance of all two nodes must be small. In addition, it is necessary to keep the small network delay against network failures. 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 these protected links must be small to restrict the investment cost of facilities and the operational cost for Internet service providers. Consequently, it is important to find the smallest number of the links to be protected so that the diameter of the network which non-protected links are failured is not more than a given integer. In this paper, we solve these unsolved issues of this problem. First, we prove that the problem is NP-hard even if k=2. Second, we present approximation algorithms with the approximation ratio of a fixed constant for the NP-hard cases. These results make clear the computational complexity of this problem theoretically and gives an useful network design algorithm also from the practical viewpoints. |
|
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | link protection / network design / diameter / optimization / / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 111, no. 468, NS2011-251, pp. 403-408, March 2012. | |
| Paper # | NS2011-251 | |
| Date of Issue | 2012-03-01 (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 | NS2011-251 |
|
| Conference Information | |
| Committee | NS IN |
| Conference Date | 2012-03-08 - 2012-03-09 |
| 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 | 2012-03-NS-IN |
| Language | Japanese |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Approximation Algorithms for Finding Protected Links to Keep Small Diameter during Link Failures |
| Sub Title (in English) | |
| Keyword(1) | link protection |
| Keyword(2) | network design |
| Keyword(3) | diameter |
| Keyword(4) | optimization |
| Keyword(5) | |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Koji Imagawa |
| 1st Author's Affiliation | Kwansei Gakuin University (Kwansei Gakuin Univ.) |
| 2nd Author's Name | Takeshi Fujimura |
| 2nd Author's Affiliation | Kwansei Gakuin University (Kwansei Gakuin Univ.) |
| 3rd Author's Name | Hiroyoshi Miwa |
| 3rd Author's Affiliation | Kwansei Gakuin University (Kwansei Gakuin Univ.) |
| 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 | () |
| Speaker | Author-1 |
| Date Time | 2012-03-09 14:10:00 |
| Presentation Time | 20 minutes |
| Registration for | NS |
| Paper # | NS2011-251 |
| Volume (vol) | vol.111 |
| Number (no) | no.468 |
| Page | pp.403-408 |
| #Pages | 6 |
| Date of Issue | 2012-03-01 (NS) |
[Return to Top Page]