On improving the accuracy of OSPF traffic engineering

Authors:
Gábor Rétvári;József J. Bíró;Tibor Cinkler
Affiliations:
High Speed Networks Laboratory, Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary;High Speed Networks Laboratory, Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary;High Speed Networks Laboratory, Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary
Venue:
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Year:
2006

Citing 5
Cited 1

Linear programming and network flows (2nd ed.)

Linear programming and network flows (2nd ed.)
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
BRITE: Universal Topology Generation from a User''s Perspective

BRITE: Universal Topology Generation from a User''s Perspective
Traffic engineering with traditional IP routing protocols

IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

Efficient Routing Heuristics for Internet Traffic Engineering

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The conventional forwarding rule used by IP networks is to always choose the path with the shortest length – in terms of administrative link weights assigned to the links – to forward traffic. Lately, it has been proposed to use shortest-path-first routing to implement Traffic Engineering in IP networks, promising with a big boost in the profitability of the legacy network infrastructure. The idea is to set the link weights so that the shortest paths, and the traffic thereof, follow the paths designated by the operator. Unfortunately, traditional methods to calculate the link weights usually produce a bunch of superfluous shortest paths, often leading to congestion along the unconsidered paths. In this paper, we introduce and develop novel methods to increase the accuracy of this process and, by means of extensive simulations, we show that our proposed solution produces remarkably high quality link weights.