(Created page with " == Abstract == Traffic Engineering (TE) leverages information of network traffic to generate a routing scheme optimizing the traffic distribution so as to advance network pe...") |
m (Scipediacontent moved page Draft Content 532346037 to Xu et al 2010b) |
(No difference)
| |
Latest revision as of 23:15, 1 February 2021
Abstract
Traffic Engineering (TE) leverages information of network traffic to generate a routing scheme optimizing the traffic distribution so as to advance network performance. However, optimize the link weights for OSPF to the offered traffic is an known NP-hard problem. In this paper, motivated by the fairness concept of congestion control, we firstly propose a new generic objective function, where various interests of providers can be extracted with different parameter settings. And then, we model the optimal TE as the utility maximization of multi-commodity flows with the generic objective function and theoretically show that any given set of optimal routes corresponding to a particular objective function can be converted to shortest paths with respect to a set of positive link weights. This can be directly configured on OSPF-based protocols. On these bases, we employ the Network Entropy Maximization(NEM) framework and develop a new OSPF-based routing protocol, SPEF, to realize a flexible way to split traffic over shortest paths in a distributed fashion. Actually, comparing to OSPF, SPEF only needs one more weight for each link and provably achieves optimal TE. Numerical experiments have been done to compare SPEF with the current version of OSPF, showing the effectiveness of SPEF in terms of link utilization and network load distribution.
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2010
Volume 2010, 2010
DOI: 10.1109/icdcs.2011.49
Licence: CC BY-NC-SA license
Share this document
claim authorship
Are you one of the authors of this document?