A data structure for dynamic trees
Journal of Computer and System Sciences
Introduction to algorithms
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
A new paradigm for ranking pages on the world wide web
WWW '03 Proceedings of the 12th international conference on World Wide Web
How good can IP routing be?
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Convex Optimization
Increasing Internet Capacity Using Local Search
Computational Optimization and Applications
Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks
IEEE/ACM Transactions on Networking (TON)
Distributed network monitoring and multicommodity flows: a primal-dual approach
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
SIAM Journal on Computing
IEEE Transactions on Network and Service Management
MPLS and traffic engineering in IP networks
IEEE Communications Magazine
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
Towards decentralized and adaptive network resource management
Proceedings of the 7th International Conference on Network and Services Management
B4: experience with a globally-deployed software defined wan
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Hi-index | 0.00 |
This paper settles an open question with a positive answer: Optimal traffic engineering (or optimal multicommodity flow) can be realized using just link-state routing protocols with hop-by-hop forwarding. Today's typical versions of these protocols, Open Shortest Path First (OSPF) and Intermediate System-Intermediate System (IS-IS), split traffic evenly over shortest paths based on link weights. However, optimizing the link weights for OSPF/IS-IS to the offered traffic is a well-known NP-hard problem, and even the best setting of the weights can deviate significantly from an optimal distribution of the traffic. In this paper, we propose a new link-state routing protocol, PEFT, that splits traffic over multiple paths with an exponential penalty on longer paths. Unlike its predecessor, DEFT, our new protocol provably achieves optimal traffic engineering while retaining the simplicity of hop-by-hop forwarding. The new protocol also leads to a significant reduction in the time needed to compute the best link weights. Both the protocol and the computational methods are developed in a conceptual framework, called Network Entropy Maximization, that is used to identify the traffic distributions that are not only optimal, but also realizable by link-state routing.