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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
Oblivious routing aims to perform routing optimization with little or no knowledge to handle the traffic variations.
COPE: a routing optimization to handle dynamic traffic variation using Penalty Envelope.
Maximum link utilization: For a given traffic flow \( r_{ij}^{a} \) and demand \( d_{ij} \), the Maximum Link Utilization is a maximum of ratio of total traffic load and link capacity.
References
Spring, N., Mahajan, R., Wetherall, D.: Measuring ISP Topologies with Rocketfuel. In: Proceedings ACM SIGCOMM (2002)
Belloti, P., Pinar, M.C.: Optimal oblivious routing under linear and ellipsoidal uncertainty. Optim. Eng. (2005)
Belloti, P., Pinar, M.C.: Optimal oblivious routing under statistical uncertainty. Optim. Eng. (2008)
Ben-Ameur, W.: Between fully dynamic routing and robust stable routing. In: Proceedings DRCN (2007)
Ben-Ameur, W., Kerivin, H.: Routing of uncertain traffic demands. In: Proceedings informs (2001)
Ben-Ameur, W., Kerivin, H.: Routing of uncertain demands. Optim. Eng. 6(3):283–313 (2005)
Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper Res Lett 25(1), 1–13 (1999)
Ash, G.: Dynamic Routing in Telecommunication Networks. McGraw-Hills, New York (1998)
He, J., Chiang, M., Rexford, J.: DATE: Distributed Adaptive Traffic Engineering. Poster session at INFOCOMM (2005)
Labovitz, C., Malan, G.R., Jahanian, F.: Internet routing instability. IEEE/ACM Trans. Netw. 6, 515–528 (1998)
Applegate, D., Breslau, L., Cohen, E.: Coping with network failures: routing strategies for optimal demand oblivious restoration. In: Proceedings of joint international conference on measurement and modeling of computer systems, pp. 270–281 (2004)
Applegate, D., Cohen, E.: Making routing robust to changing traffic demands: algorithms and evaluation. IEEE/ACM Trans. Netw. 14(6):1193–1206 (2006)
Fortz, B., Thorup, M.: Optimizing OSPF/IS-IS weights in a changing world. IEEE J. Select. Areas Commun. 20(4):756–767 (2002)
Azar, Y., Cohen, E., Flat, A., Racke, H.K.H.: Optimal oblivious routing in polynomial time. In: Proceedings 35th ACM symposium on theory of computing, pp. 237–245 (2003)
Juva, I.: Robust Load Balancing. In: Proceedings GLOBECOM (2007)
Wang, H., Xie, H., Qui, L., Zhang, Y.R., Greenberg, A.: COPE: Traffic Engineering in Dynamic Networks. In: Proceedings SIGCOMM (2006)
Roughan, M., Thorup, M., Zhang, Y.: Traffic engineering with estimated traffic matrix. In: 3rd ACM SIGCOMM Conference on Internet Measurement, pp. 248–258 (2003)
Zhang, C., Lui, Y., Gong, W., Kurose, J., Moll, R., Towsley, D.: On optimal routing multiple traffic matrices. In: Proceedings SIGCOMM (2006)
Casas, P., Vaton, S.: An adaptive multi temporal approach for robust routing. In: Proceedings Euro-FGI workshop on QoS and traffic control (2007)
Jaffe, J., Moss, F.: A responsive distributed routing algorithm for computer networks. IEEE Trans. Commun. 30, 1758–1762 (1982)
Elwalid, A., Jin, C., Low, S., Widjaja, I.: MATE: MPLS adaptive traffic engineering. In: Proceedings INFOCOMM, pp. 1300–1309 (2001)
Kandula, S., Katabhi, D., Davie, B., Charny, A.: Walking the tightrope: responsive yet stable traffic engineering. In: Proceedings SIGCOMM, pp. 253–264 (2005)
Gojmerac, I., Ziegler, T., Ricciato, F., Reichi, P.: Adaptive multipath routing for dynamic traffic engineering. In: Proceedings IEEE GLOBECOM (2003)
Nagesh, H., Poosala, V., Kumar, V., Winzer, P., Zirngibl, M.: Load balanced architecture for dynamic traffic. In: Optical Fiber Communication Conference (OFC) (2004)
Nagesh, H., Poosala, V., Kumar, V., Winzer, P., Zirngibl, M.: Load balanced architecture for dynamic traffic. In: Optical Fiber Communication Conference (OFC) (2004)
Johansson, M., Gunnar, A.: Data-driven traffic engineering: techniques experience and challenges. In: Proceedings BROADNETS (2006)
Applegate, D., Cohen, E.: Making Intradomain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In: Proceedings SIGCOMM, pp. 313–324 (2003)
Rexford, J.: Route optimization in IP networks. In: Handbook of Optimization in Telecommunications (2006)
ILOG. ILOG-CPLEX 10.2: Large scale mathematical programming software. Available: http://www.ilog.com
GTITM: Georgia Tech Internetworks Topology Models. Available: http://www.cc.gatech.edu/gt-itm/gt-itm.tar.gz
Ns2.Home page available: http://www.isi.edu/nsnam/ns/
Knuth, D.E.: The Stanford graph base: a platform for combinatorial computing (1993)
Pioro, M., Medhi, D.: Routing, flow and capacity design in communication and computer networks. Morgan Kaufmann, Los Altos (2004)
Acknowledgments
We are grateful to the Pietro Belloti for giving valuable suggestions and discussion. I am also thankful to Quang Bui, for his programming assistance. We are also thankful to all the anonymous reviewers for their valuable comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Agrawal, H., Jennings, A. Evaluation of Routing with Robustness to the Variation in Traffic Demand. J Netw Syst Manage 19, 513–528 (2011). https://doi.org/10.1007/s10922-010-9193-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10922-010-9193-6