TY - GEN
T1 - Extending OSPF for large scale MPLS networks
AU - Shuaib, Khaled
AU - Sallabi, Farag
PY - 2005
Y1 - 2005
N2 - With the current growth rate networks are witnessing, it is essential to have routing protocols that can adjust to scale with this growth. OSPF being the most widely used Interior Gateway Protocol needs to be adaptive enough to accommodate rapid changes to the complex nature of the Internet and other ISP networks. In this work we present extensions to OSPF and OSPF-TE that can be used to optimize such protocols for large scale MPLS networks. OSPF with traffic engineering specifies methods of adding traffic engineering capabilities to OSPF. These extensions to OSPF are designed to be as generic as possible while trying to address several issues related to the empowerment of IP networks with MPLS. This work shows how Link State Advertisements in OSPF, with a slight modification, can be utilized to load balance both control traffic and Label Switch Paths in networks with parallel links and equal cost multipaths. In addition, we show how further optimization can be achieved for parallel links to reduce the size of OSPF link state database and thus reduce CPU consumption.
AB - With the current growth rate networks are witnessing, it is essential to have routing protocols that can adjust to scale with this growth. OSPF being the most widely used Interior Gateway Protocol needs to be adaptive enough to accommodate rapid changes to the complex nature of the Internet and other ISP networks. In this work we present extensions to OSPF and OSPF-TE that can be used to optimize such protocols for large scale MPLS networks. OSPF with traffic engineering specifies methods of adding traffic engineering capabilities to OSPF. These extensions to OSPF are designed to be as generic as possible while trying to address several issues related to the empowerment of IP networks with MPLS. This work shows how Link State Advertisements in OSPF, with a slight modification, can be utilized to load balance both control traffic and Label Switch Paths in networks with parallel links and equal cost multipaths. In addition, we show how further optimization can be achieved for parallel links to reduce the size of OSPF link state database and thus reduce CPU consumption.
UR - http://www.scopus.com/inward/record.url?scp=33746615257&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33746615257&partnerID=8YFLogxK
U2 - 10.1109/SARNOF.2005.1426500
DO - 10.1109/SARNOF.2005.1426500
M3 - Conference contribution
AN - SCOPUS:33746615257
SN - 0780388542
SN - 9780780388543
T3 - 2005 IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communication
SP - 13
EP - 16
BT - 2005 IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communication
T2 - 2005 IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communication
Y2 - 18 April 2005 through 19 April 2005
ER -