Improved balancing heuristics for optimizing shortest path routing

Authors:
Makarem Bamatraf;Mohamed Othman
Affiliations:
Department of Communication Technology and Network, Faculty of Computer Science and Information Technology, University Putra Malaysia, 43400 UPM, Serdang, Selangor D.E., Malaysia;Department of Communication Technology and Network, Faculty of Computer Science and Information Technology, University Putra Malaysia, 43400 UPM, Serdang, Selangor D.E., Malaysia
Venue:
Computer Communications
Year:
2007

Citing 9
Cited 0

Increasing Internet Capacity Using Local Search

Computational Optimization and Applications
Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks

IEEE/ACM Transactions on Networking (TON)
A hybrid genetic algorithm for the weight setting problem in OSPF-IS-IS routing

Networks
An open source traffic engineering toolbox

Computer Communications
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Modeling Internet topology

IEEE Communications Magazine
Traffic engineering with traditional IP routing protocols

IEEE Communications Magazine
Optimizing OSPF/IS-IS weights in a changing world

IEEE Journal on Selected Areas in Communications
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Open Shortest Path First (OSPF) is the most commonly used intra-domain routing protocol. OSPF routes traffic flows along shortest paths and the traffic will be split evenly when several shortest paths are found to the destination. An integer value is assigned to each link as a weight in OSPF networks. The weights highly affect the selection of links in the shortest paths. One of the default heuristics recommended by Cisco is to set the weights inversely proportional to link capacities. Overloaded links could appear if they have lower weights, while still other links are under-utilized. Many balancing heuristics were proposed to avoid congestion and utilize un-used network resources. This paper presents an improved balancing heuristics that solve two problems found in the evenly balancing heuristic proposed by Fortz and Thorup in their OSPF optimization model. Results show that our improved balancing heuristics work better in terms of routing cost and algorithm convergence.