Paper Abstract and Keywords |
Presentation |
2010-12-17 10:25
A proposal of k shortest simple path algorithm to minimize computational complexity Hiroshi Matsuura (NTT) IN2010-107 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
k shortest path algorithm is expected to be applied to creating replacement paths and traffic dispersion by using multiple paths on a network. k shortest simple path algorithm, which creates loopless k shortest paths, on the directed graph has been researched as long as 50 years, and its shortest computational complexity so far is O(knm), where n is the number of nodes and m is the number of links. In this paper, our new proposed k shortest simple path algorithm named k-SPF shortens the computational complexity to O(km (log n + log k)). We also implemented k-SPF and conventional Yen algorithm and compares their processing times. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
k shortest path algorithm / Binary search tree / Fibonacci heaps / Computational complexity / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 110, no. 341, IN2010-107, pp. 57-62, Dec. 2010. |
Paper # |
IN2010-107 |
Date of Issue |
2010-12-09 (IN) |
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 |
IN2010-107 |
Conference Information |
Committee |
IN |
Conference Date |
2010-12-16 - 2010-12-17 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Hiroshima City Univ. |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
Traffic control, Policy management, Network anomaly detection, Reliability, Authentication, Naming management, Network security, Privacy, VPN, DDoS, etc. |
Paper Information |
Registration To |
IN |
Conference Code |
2010-12-IN |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
A proposal of k shortest simple path algorithm to minimize computational complexity |
Sub Title (in English) |
|
Keyword(1) |
k shortest path algorithm |
Keyword(2) |
Binary search tree |
Keyword(3) |
Fibonacci heaps |
Keyword(4) |
Computational complexity |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Hiroshi Matsuura |
1st Author's Affiliation |
NIPPON TELEGRAPH AND TELEPHONE CORPORATION (NTT) |
2nd Author's Name |
|
2nd Author's Affiliation |
() |
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 |
Author-1 |
Date Time |
2010-12-17 10:25:00 |
Presentation Time |
25 minutes |
Registration for |
IN |
Paper # |
IN2010-107 |
Volume (vol) |
vol.110 |
Number (no) |
no.341 |
Page |
pp.57-62 |
#Pages |
6 |
Date of Issue |
2010-12-09 (IN) |
|