Evaluation of Routing with Robustness to the Variation in Traffic Demand

Authors:
Himanshu Agrawal;Andrew Jennings
Affiliations:
Electrical and Computer Engineering, RMIT University, Melbourne, Australia;Electrical and Computer Engineering, RMIT University, Melbourne, Australia
Venue:
Journal of Network and Systems Management
Year:
2011

Citing 14
Cited 0

The Stanford GraphBase: a platform for combinatorial computing

The Stanford GraphBase: a platform for combinatorial computing
Internet routing instability

IEEE/ACM Transactions on Networking (TON)
Dynamic Routing in Telecommunications Networks

Dynamic Routing in Telecommunications Networks
Measuring ISP topologies with rocketfuel

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal oblivious routing in polynomial time

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic engineering with estimated traffic matrices

Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
Coping with network failures: routing strategies for optimal demand oblivious restoration

Proceedings of the joint international conference on Measurement and modeling of computer systems
Walking the tightrope: responsive yet stable traffic engineering

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
COPE: traffic engineering in dynamic networks

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Making routing robust to changing traffic demands: algorithms and evaluation

IEEE/ACM Transactions on Networking (TON)
Robust solutions of uncertain linear programs

Operations Research Letters
Optimizing OSPF/IS-IS weights in a changing world

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we focus on routing problem in the face of variation in traffic demands. We implement a Robust Routing algorithm (RRT) with an aim of satisfying networking goals such as load balancing, routing robustness to the range of traffic demand matrices or to the traffic changes caused by uncertain traffic demands. We conduct simulation experiments on range of topologies that includes, real network and randomly generated synthetic network topologies. Simulation results show marked improvement in the maximum link utilization compare to Open Shortest Path First. K-shortest path implementation of RRT can be extended for Multi Protocol Level Switching.