nach oben

Journal of Network and Systems Management

Erschienen in:

01.12.2011

Evaluation of Routing with Robustness to the Variation in Traffic Demand

verfasst von: Himanshu Agrawal, Andrew Jennings

Erschienen in: Journal of Network and Systems Management | Ausgabe 4/2011

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

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.

Vorheriger Artikel A Study on the Effectiveness of SNMP OID Compression

Nächster Artikel Report of the Third Workshop on the Usage of NetFlow/IPFIX in Network Management

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

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.

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)MathSciNetMATHCrossRef

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)

10.

Labovitz, C., Malan, G.R., Jahanian, F.: Internet routing instability. IEEE/ACM Trans. Netw. 6, 515–528 (1998)CrossRef

11.

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)

12.

Applegate, D., Cohen, E.: Making routing robust to changing traffic demands: algorithms and evaluation. IEEE/ACM Trans. Netw. 14(6):1193–1206 (2006)

13.

Fortz, B., Thorup, M.: Optimizing OSPF/IS-IS weights in a changing world. IEEE J. Select. Areas Commun. 20(4):756–767 (2002)

14.

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)

15.

Juva, I.: Robust Load Balancing. In: Proceedings GLOBECOM (2007)

16.

Wang, H., Xie, H., Qui, L., Zhang, Y.R., Greenberg, A.: COPE: Traffic Engineering in Dynamic Networks. In: Proceedings SIGCOMM (2006)

17.

Roughan, M., Thorup, M., Zhang, Y.: Traffic engineering with estimated traffic matrix. In: 3rd ACM SIGCOMM Conference on Internet Measurement, pp. 248–258 (2003)

18.

Zhang, C., Lui, Y., Gong, W., Kurose, J., Moll, R., Towsley, D.: On optimal routing multiple traffic matrices. In: Proceedings SIGCOMM (2006)

19.

Casas, P., Vaton, S.: An adaptive multi temporal approach for robust routing. In: Proceedings Euro-FGI workshop on QoS and traffic control (2007)

20.

Jaffe, J., Moss, F.: A responsive distributed routing algorithm for computer networks. IEEE Trans. Commun. 30, 1758–1762 (1982)MATHCrossRef

21.

Elwalid, A., Jin, C., Low, S., Widjaja, I.: MATE: MPLS adaptive traffic engineering. In: Proceedings INFOCOMM, pp. 1300–1309 (2001)

22.

Kandula, S., Katabhi, D., Davie, B., Charny, A.: Walking the tightrope: responsive yet stable traffic engineering. In: Proceedings SIGCOMM, pp. 253–264 (2005)

23.

Gojmerac, I., Ziegler, T., Ricciato, F., Reichi, P.: Adaptive multipath routing for dynamic traffic engineering. In: Proceedings IEEE GLOBECOM (2003)

24.

Nagesh, H., Poosala, V., Kumar, V., Winzer, P., Zirngibl, M.: Load balanced architecture for dynamic traffic. In: Optical Fiber Communication Conference (OFC) (2004)

25.

Nagesh, H., Poosala, V., Kumar, V., Winzer, P., Zirngibl, M.: Load balanced architecture for dynamic traffic. In: Optical Fiber Communication Conference (OFC) (2004)

26.

Johansson, M., Gunnar, A.: Data-driven traffic engineering: techniques experience and challenges. In: Proceedings BROADNETS (2006)

27.

Applegate, D., Cohen, E.: Making Intradomain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In: Proceedings SIGCOMM, pp. 313–324 (2003)

28.

Rexford, J.: Route optimization in IP networks. In: Handbook of Optimization in Telecommunications (2006)

29.

ILOG. ILOG-CPLEX 10.2: Large scale mathematical programming software. Available: http://www.ilog.com

30.

GTITM: Georgia Tech Internetworks Topology Models. Available: http://www.cc.gatech.edu/gt-itm/gt-itm.tar.gz

31.

Ns2.Home page available: http://www.isi.edu/nsnam/ns/

32.

Knuth, D.E.: The Stanford graph base: a platform for combinatorial computing (1993)

33.

Pioro, M., Medhi, D.: Routing, flow and capacity design in communication and computer networks. Morgan Kaufmann, Los Altos (2004)MATH

Titel: Evaluation of Routing with Robustness to the Variation in Traffic Demand
verfasst von: Himanshu Agrawal
Andrew Jennings
Publikationsdatum: 01.12.2011
Verlag: Springer US
Erschienen in: Journal of Network and Systems Management / Ausgabe 4/2011
Print ISSN: 1064-7570
Elektronische ISSN: 1573-7705
DOI: https://doi.org/10.1007/s10922-010-9193-6

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 4/2011

Report of the Third Workshop on the Usage of NetFlow/IPFIX in Network Management

A Short-Term Forecasting Algorithm for Network Traffic Based on Chaos Theory and SVM

Efficient Management of Loosely Collaborative Service Networks: A Report on DANMS 2011

Systems and Virtualization Management: Standards and the Cloud (A report on SVM 2010)

Policy Management for Secure Data Access Control in Vehicular Networks

A Study on the Effectiveness of SNMP OID Compression

Premium Partner