A Complete Mechanism for Tolerating Multiple Failures Using Open Shortest Path First Protocol (OSPF)
Moawed, E., Zaki, F., El-shennawy, K. (2011). A Complete Mechanism for Tolerating Multiple Failures Using Open Shortest Path First Protocol (OSPF). EKB Journal Management System, 21(2), 130-146. doi: 10.21608/mjeer.2011.66818
Emad R. Moawed; Fayez W. Zaki; Khameis M. El-shennawy. "A Complete Mechanism for Tolerating Multiple Failures Using Open Shortest Path First Protocol (OSPF)". EKB Journal Management System, 21, 2, 2011, 130-146. doi: 10.21608/mjeer.2011.66818
Moawed, E., Zaki, F., El-shennawy, K. (2011). 'A Complete Mechanism for Tolerating Multiple Failures Using Open Shortest Path First Protocol (OSPF)', EKB Journal Management System, 21(2), pp. 130-146. doi: 10.21608/mjeer.2011.66818
Moawed, E., Zaki, F., El-shennawy, K. A Complete Mechanism for Tolerating Multiple Failures Using Open Shortest Path First Protocol (OSPF). EKB Journal Management System, 2011; 21(2): 130-146. doi: 10.21608/mjeer.2011.66818

A Complete Mechanism for Tolerating Multiple Failures Using Open Shortest Path First Protocol (OSPF)

Menoufia Journal of Electronic Engineering Research
Article 3, Volume 21, Issue 2, June 2011, Page 130-146  XML
Document Type: Original Article
DOI: 10.21608/mjeer.2011.66818
View on SCiNiTO View on SCiNiTO
Authors
Emad R. Moawed1; Fayez W. Zaki2; Khameis M. El-shennawy3
1Arab Academy of Science and Technology, Alexandria, Egypt
2Dept of Elec. and Comm. Eng. Mansoura University, Egypt.
3Arab Academy of Science and Technology, Alexandria, Egypt.
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.
References
[1]           V. Puente,  J. Angel  Gregorio,   F. Vallejo,  and   R. Beivide, “Dependable Routing  for  Interconnection   Networks    with    Arbitrary  Topology , ”  IEEE TRANSACTIONS   ON   COMPUTER, vol. 57,  no. 12, pp. 1676 – 1689 , Dec. 2008 .

[2]           John T. Moy " OSPF Anatomy of an Internet Routing Protocol ". Amazon 1998 , 8th edition March 2004.

[3]           A. Ghiasi " IEEE 802.3ap Ethernet Overview ", May 2005.

[4]           Andrew S., Tanenbaum," Computer Networks ", Prentice Hall, New   Jersey , 2003.

[5]           Giuseppe  Trivigno "OSPF Weight Tuning for Efficient Routing in IP Networks" Master's Degree Project Stockholm, Sweden 2004.

[6]           Henry Benjamin, "Basic Open Shortest Path First", Cisco Press May 2007.

[7]           Behrouz A. Forouzan " TCP/IP Protocol Suite " , Mc Graw-Hill , 2005.

[8]           V. Puente, J.A. Gregorio, and R. Beivide, “SICOSYS: An Integrated Framework for studying Interconnection Network in Multiprocessor Systems,” Proc. IEEE 10th Euromicro Workshop on Parallel and Distributed Processing, Jan. 2002.

Statistics
Article View: 111