Subjects
-Tags
-Abstract
It is necessary for the network to be available most of the time and to achieve transparent network failure recovery: In this paper a complete mechanism for tolerating multiple failures is described. This mechanism obtains a spanning tree form automatically in response of failures exploiting the properties of the used routing protocol. This mechanism deals with any combination of faults regardless their distribution inside the internetworks. Moreover, this mechanism operates on the basis of a dynamic network reconfiguration in response to failures. Open Shortest Path First Protocol (OSPF) is employed as a link state protocol to reconfigure the network after failures. Traffic delay reduction due to the use of the mechanism is illustrated. Two versions of OSPF (v2 and v3) are applied to the spanning tree mechanism to evaluate the performance in each case. The spanning tree mechanism is compared with recent OSPF model to evaluate its performance.
DOI
10.21608/mjeer.2011.66818
Authors
MiddleName
-Affiliation
Arab Academy of Science and Technology, Alexandria, Egypt
Email
-City
-Orcid
-MiddleName
-Affiliation
Dept of Elec. and Comm. Eng. Mansoura University, Egypt.
Email
-City
-Orcid
-MiddleName
-Affiliation
Arab Academy of Science and Technology, Alexandria, Egypt.
Email
-City
-Orcid
-Link
https://mjeer.journals.ekb.eg/article_66818.html
Detail API
https://mjeer.journals.ekb.eg/service?article_code=66818
Publication Title
Menoufia Journal of Electronic Engineering Research
Publication Link
https://mjeer.journals.ekb.eg/
MainTitle
A Complete Mechanism for Tolerating Multiple Failures Using Open Shortest Path First Protocol (OSPF)