Scipediacontent: Scipediacontent moved page Draft Content 532346037 to Xu et al 2010b

2021-02-01T22:15:13Z

Scipediacontent moved page Draft Content 532346037 to Xu et al 2010b

Scipediacontent: 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..."

2021-02-01T22:15:08Z

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..."

New page

== 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:

* [http://arxiv.org/abs/1011.5015 http://arxiv.org/abs/1011.5015]

* [http://arxiv.org/pdf/1011.5015 http://arxiv.org/pdf/1011.5015]

* [http://xplorestaging.ieee.org/ielx5/5961669/5961670/05961760.pdf?arnumber=5961760 http://xplorestaging.ieee.org/ielx5/5961669/5961670/05961760.pdf?arnumber=5961760],
: [http://dx.doi.org/10.1109/icdcs.2011.49 http://dx.doi.org/10.1109/icdcs.2011.49]

* [https://dblp.uni-trier.de/db/journals/corr/corr1011.html#abs-1011-5015 https://dblp.uni-trier.de/db/journals/corr/corr1011.html#abs-1011-5015],
: [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005961760 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005961760],
: [https://ui.adsabs.harvard.edu/abs/2010arXiv1011.5015X/abstract https://ui.adsabs.harvard.edu/abs/2010arXiv1011.5015X/abstract],
: [https://dl.acm.org/citation.cfm?id=2014822 https://dl.acm.org/citation.cfm?id=2014822],
: [http://ieeexplore.ieee.org/document/5961760 http://ieeexplore.ieee.org/document/5961760],
: [https://academic.microsoft.com/#/detail/2098374802 https://academic.microsoft.com/#/detail/2098374802]

← Older revision	Revision as of 22:15, 1 February 2021
(No difference)

Xu et al 2010b - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 532346037 to Xu et al 2010b

Scipediacontent: 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..."