Presentation | 2014-04-17 Implementation and evaluation of an enhancement OSPF for fast route reconstruction under communications network failure Hiroki DOI, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | Although OSPF (Open Shortest Path First) as a major routing protocol is used on networks, it has a Router Dead Interval problem. To solve these problems, we propose a faster OSPF route reconstruction method. The proposed method marks IP packets and detect the DR failure fast by monitoring a change of marked IP packet flows. We implemented our enhancement OSPF on 'quagga' which is one of open source OSPF program based on RFC2328. In this report, we show the performance evaluation results of our enhancement OSPF on virtualization router network. We confirmed that our method reduces the route recovery time from 40 seconds to 1.46 seconds. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | OSPF / Desighnated Router / Path / Failure |
Paper # | NS2014-3 |
Date of Issue |
Conference Information | |
Committee | NS |
---|---|
Conference Date | 2014/4/10(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Network Systems(NS) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Implementation and evaluation of an enhancement OSPF for fast route reconstruction under communications network failure |
Sub Title (in English) | |
Keyword(1) | OSPF |
Keyword(2) | Desighnated Router |
Keyword(3) | Path |
Keyword(4) | Failure |
1st Author's Name | Hiroki DOI |
1st Author's Affiliation | Communication & Information Research Laboratory, CRIEPI() |
Date | 2014-04-17 |
Paper # | NS2014-3 |
Volume (vol) | vol.114 |
Number (no) | 6 |
Page | pp.pp.- |
#Pages | 6 |
Date of Issue |