Traffic engineering and routing in IP networks with centralized control

Authors:
Jing Fu;Peter Sjödin;Gunnar Karlsson
Affiliations:
ACCESS Linnaeus Center, School of Electrical Engineering, KTH, Royal Institute of Technology, Stockholm, Sweden;School of Information and Communication Technology, KTH, Royal Institute of Technology, Stockholm, Sweden;ACCESS Linnaeus Center, School of Electrical Engineering, KTH, Royal Institute of Technology, Stockholm, Sweden
Venue:
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Year:
2008

Citing 11
Cited 0

Introduction to algorithms

Introduction to algorithms
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Deriving traffic demands for operational IP networks: methodology and experience

IEEE/ACM Transactions on Networking (TON)
Faster approximation schemes for fractional multicommodity flow problems

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Measuring ISP topologies with rocketfuel

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic matrix estimation: existing techniques and new directions

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Analysis of link failures in an IP backbone

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Traffic matrix estimation on a large IP backbone: a comparison on real data

Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
A clean slate 4D approach to network control and management

ACM SIGCOMM Computer Communication Review
Optimizing OSPF/IS-IS weights in a changing world

IEEE Journal on Selected Areas in Communications
Converging the Evolution of Router Architectures and IP Networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

There have been research initiatives in centralized control recently, which advocate that the control of an autonomous system (AS) should be performed in a centralized fashion. In this paper, we propose an approach to perform traffic engineering and routing in networks with centralized control, named LP-redirect. LP-redirect is based on an efficient formulation of linear programming (LP) that reduces the number of variables and constraints. As LP is not fast enough for runtime routing, LP-redirect uses a fast scheme to recompute routing paths when a network topology changes. The performance evaluation of LP-redirect shows that it is more efficient in both traffic engineering and computation than an approach using optimized link weights. In addition, LP-redirect is suitable for runtime traffic engineering and routing.