Please use this identifier to cite or link to this item:
Title: S-OSPF: a traffic engineering solution for OSPF based best effort networks
Keywords: Multiprotocol Label Switching
Graph Theory
Routing Protocols
Telecommunication Traffic
Issue Date: 2007
Publisher: IEEE
Citation: Proceedings of the IEEE Global Telecommunications Conference, Washington, DC, 26-30 November 2007, 1845-1849
Abstract: Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet forwarding to achieve any network optimization objective. Because of the high cost of network assets and commercial and competitive nature of Internet service provisioning, service providers are interested in performance optimization of their networks. This helps in reducing congestion hotspots and improving resource utilization across the network, which, in turn, results in an increased revenue collection. One way of achieving this is through Traffic Engineering. Currently traffic engineering is mostly done by using MPLS. But legacy networks running OSPF would need to be upgraded to MPLS. To achieve better resource utilization without upgrading OSPF network to MPLS is a challenge. In this paper we present a simple but effective algorithm, called Smart OSPF (S-OSPF) to provide traffic engineering solution in an OSPF based best effort network. We formulate an optimization problem based on the traffic demand to minimize the maximum link utilization in the network. Routing of the traffic demand is achieved using OSPF. We have simulated S-OSPF on real networks of two service providers. Simulation results show that S- OSPF based traffic engineering solution performance very closely follows the optimal solution.
URI: 10.1109/GLOCOM.2007.355
ISBN: 978-1-4244-1043-9
Appears in Collections:Proceedings papers

Files in This Item:
File Description SizeFormat 
S-OSPF: a traffic engineering .pdf132.59 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.