Traffic engineering and congestion control for open shortest path first networks

Ue-Pyng Wen, Wei-Chih Wang and Chyi-Bao Yang

Omega, 2007, vol. 35, issue 6, 671-682

Abstract: Open shortest path first (OSPF) is the most widely used intra-domain Internet routing protocol. The OSPF protocol directs the Internet traffic along the shortest paths that are defined by the links weight. Traffic engineering is responsible for improving the network performance, for instance, the objective function that minimizes the maximal link utilization which is usually adopted to avoid the network congestion. This paper formulates the model of OSPF routing, and further evaluates the performance of different approaches. We also propose a heuristic algorithm to solve the routing problems by optimizing OSPF weights. Computational results indicated that the proposed algorithm could lead to good load balancing, and make efficient utilization of network resources.

Keywords: Heuristic; Optimization; Routing; Telecommunication (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305-0483(06)00056-9
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:35:y:2007:i:6:p:671-682

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().