Inter-Area Traffic Engineering in a Differentiated Services Network

Degrande, Natalie; Hoey, Gert Van; Poussin, Paloma De La Vallée; Bosch, Sven van den

doi:10.1023/b:jons.0000005472.61905.ca

Cited by 10 publications

(9 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [2], Degrande et al propose to maximise an objective function which is composed of four terms : CF .F + CT .T + CB.B−CU .U with F (airness), T (hroughput), B(alance) and U (tilisation) the four performance parameters to be optimised and CF , CT , CB and CU the objective coefficients. We will consider only Balance and Utilisation which are resource oriented objectives.…”

Section: Classical Objective Functionsmentioning

confidence: 99%

Comparing traffic engineering objective functions

Balon

Skivée

Leduc

2005

Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology - CoNEXT'05

View full text Add to dashboard Cite

We compare and evaluate how well-known and novel networkwide 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. Our first results on the GÉANT network suggest that they can give quite different results.

show abstract

Section: Classical Objective Functionsmentioning

confidence: 99%

Comparing traffic engineering objective functions

Balon

Skivée

Leduc

2005

Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology - CoNEXT'05

View full text Add to dashboard Cite

show abstract

“…It means that DiffServ network classifies individual flows in a small number of service classes at network edges [3]. Also, it enables "soft" reservation (allocation) of resources and special handling of packets in the core.…”

Section: Qos Provisioning In Mpls/diffserv Networkmentioning

confidence: 99%

Possible Collision Avoidance with Off-line Route Selection

Krile¹,

Peraković²,

Remenar³

2012

PROMET

View full text Add to dashboard Cite

show abstract

“…For this reason, when delay minimization is used as a routing objective, the link weight system should be chosen considering the link delay. Degrande et al (2003) propose to maximize the sum of fairness, throughput, balance and network utilization. A coefficient is associated with each objective to emphasize its priority.…”

Section: Average Delaymentioning

confidence: 99%

Intra-domain traffic engineering with shortest path routing protocols

et al. 2009

View full text Add to dashboard Cite

Throughout the last decade, extensive deployment of popular intradomain routing protocols such as open shortest path first and intermediate systemintermediate system, has drawn an ever increasing attention to Internet traffic engineering. This paper reviews optimization techniques that have been deployed for managing intra-domain routing in networks operated with shortest path routing protocols, and the state-of-the-art research that has been carried out in this direction.

show abstract

Inter-Area Traffic Engineering in a Differentiated Services Network

Cited by 10 publications

References 21 publications

Comparing traffic engineering objective functions

Comparing traffic engineering objective functions

Possible Collision Avoidance with Off-line Route Selection

Intra-domain traffic engineering with shortest path routing protocols

Contact Info

Product

Resources

About