How well do traffic engineering objective functions meet TE requirements?

Authors:
Simon Balon;Fabian Skivée;Guy Leduc
Affiliations:
Research Unit in Networking, EECS Department, University of Liège, Institut Montefiore, Liège, Belgium;Research Unit in Networking, EECS Department, University of Liège, Institut Montefiore, Liège, Belgium;Research Unit in Networking, EECS Department, University of Liège, Institut Montefiore, Liège, Belgium
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 3
Cited 2

Inter-Area Traffic Engineering in a Differentiated Services Network

Journal of Network and Systems Management
Providing public intradomain traffic matrices to the research community

ACM SIGCOMM Computer Communication Review
An open source traffic engineering toolbox

Computer Communications

Improving service differentiation in IP networks through dual topology routing

CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Minimum delay load-balancing via nonparametric regression and no-regret algorithms

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We compare and evaluate how well-known and novel network-wide objective functions for Traffic Engineering (TE) algorithms fulfil TE requirements. To compare the objective functions we model the TE problem as a linear program and solve it to optimality, thus finding for each objective function the best possible target of any heuristic TE algorithm. We show that all the objective functions are not equivalent and some are far better than others. Considering the preferences a network operator may have, we show which objective functions are adequate or not.