Scipediacontent: Scipediacontent moved page Draft Content 745704124 to Sahoo Mishra 2008a

2021-01-28T21:42:24Z

Scipediacontent moved page Draft Content 745704124 to Sahoo Mishra 2008a

Scipediacontent: Created page with " == 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..."

2021-01-28T21:42:19Z

Created page with " == 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..."

New page

== 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.

== Original document ==

The different versions of the original document can be found in:

* [http://dspace.library.iitb.ac.in/xmlui/bitstream/10054/1328/3/S-OSPF%3a%20a%20traffic%20engineering%20.pdf http://dspace.library.iitb.ac.in/xmlui/bitstream/10054/1328/3/S-OSPF%3a%20a%20traffic%20engineering%20.pdf]

* [http://xplorestaging.ieee.org/ielx5/4410909/4410910/04411265.pdf?arnumber=4411265 http://xplorestaging.ieee.org/ielx5/4410909/4410910/04411265.pdf?arnumber=4411265],
: [http://dx.doi.org/10.1109/glocom.2007.355 http://dx.doi.org/10.1109/glocom.2007.355]

* [https://dblp.uni-trier.de/db/conf/globecom/globecom2007.html#MishraS07 https://dblp.uni-trier.de/db/conf/globecom/globecom2007.html#MishraS07],
: [https://www.cse.iitb.ac.in/~sahoo/papers/globecom2007_aditya.pdf https://www.cse.iitb.ac.in/~sahoo/papers/globecom2007_aditya.pdf],
: [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004411265 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004411265],
: [https://ieeexplore.ieee.org/document/4411265 https://ieeexplore.ieee.org/document/4411265],
: [https://www.it.iitb.ac.in/~sahoo/papers/globecom2007_aditya.pdf https://www.it.iitb.ac.in/~sahoo/papers/globecom2007_aditya.pdf],
: [http://dspace.library.iitb.ac.in/xmlui/bitstream/handle/10054/1328/4410910.PDF?sequence=3 http://dspace.library.iitb.ac.in/xmlui/bitstream/handle/10054/1328/4410910.PDF?sequence=3],
: [http://www.it.iitb.ac.in/~sahoo/papers/globecom2007_aditya.pdf http://www.it.iitb.ac.in/~sahoo/papers/globecom2007_aditya.pdf],
: [https://academic.microsoft.com/#/detail/2131928951 https://academic.microsoft.com/#/detail/2131928951]

← Older revision	Revision as of 21:42, 28 January 2021
(No difference)

Sahoo Mishra 2008a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 745704124 to Sahoo Mishra 2008a

Scipediacontent: Created page with " == 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..."