Autonomic traffic engineering for network robustness

IEEE Journal on Selected Areas in Communications

Volumn 28, Issue 1, 2010, Pages 39-50

  Tizghadam, Ali ^a   Leon Garcia, Alberto ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Autonomic; Betweenness; Graph Theory; Markov Theory; Robustness; Traffic Engineering

Indexed keywords

AUTONOMIC; AUTONOMIC NETWORK; BETWEENNESS; CAPACITY ASSIGNMENT; COMMUNITY OF INTEREST; CONTROL STRATEGIES; CORE NETWORKS; CUSTOMER DISSATISFACTION; ENVIRONMENTAL CHANGE; GRAPH-THEORETIC; HIGH COSTS; HUMAN INTERVENTION; MANAGEMENT PROCESS; MANAGEMENT SYSTEMS; MARKOV THEORY; NETWORK CONFIGURATION; NETWORK CRITICALITY; NETWORK ROBUSTNESS; ROBUSTNESS MEASURES; SELF ORGANIZING; SERVICE MANAGEMENT; SYSTEM STATE; TRAFFIC DEMANDS; TRAFFIC ENGINEERING;

CRITICALITY (NUCLEAR FISSION); GRAPH THEORY; HIGHWAY ENGINEERING; MANAGEMENT; MANAGEMENT SCIENCE; OPTIMIZATION; ROBUST CONTROL; ROBUSTNESS (CONTROL SYSTEMS); TELECOMMUNICATION NETWORKS;

NETWORK MANAGEMENT;

EID: 77953902796     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2010.100105     Document Type: Article

References (32)

1. K. Kar, M. Kodialam, and T. V. Lakshman. Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications. IEEE Journal on Selected Areas in Communications, 18(12):2566-2579, Dec. 2000. (Pubitemid 32251997)
2. D. Applegate and E. Cohen. Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands: understanding fundamental tradeoffs. In SIGCOMM, pages 313-324, 2003.
3. B. Fortz and M. Thorup. Increasing Internet Capacity Using Local Search. Computational Optimization and Applications, 29(12):13-48, 2004.
4. K. Kar and T.V. Lakshman M. Kodialam. Dynamic Routing of Locally Restorable Bandwidth Guaranteed Tunnels Using Aggregated Link Usage Information. In Proceedings of IEEE Infocom, June 2001.
5. R. Boutaba, W. Szeto, and Y. Iraqi. DORA: Efficient Routing for MPLS Traffic Engineering. Journal of Network and Systems Management, 10(3):309-325, September 2002.
6. A. H. Dekker and B. D. Colbert. Network Robustness and Graph Topology. Australasian Computer Science Conference, 26:359-368, Jan. 2004.
7. A. H. Dekker and B. Colberet. The Symmetry Ratio of a Network. In Australasian symposium on Theory of computing, volume 41, pages 13-20, Newcastle, Australia, 2005. ACM International Conference Proceeding Series.
8. A. Tizghadam and A. Leon-Garcia. A Robust Routing Plan to Optimize Throughput in Core Networks. ITC20, Elsvier, pages 117-128, 2007.
9. L. C. Freeman. Centrality in Networks: I. Conceptual Clarification. Social Networks, (1):215-239, 1978/79.
10. M. Newman. A Measure of Betweenness Centrality Based on Random Walks. arXiv cond-mat/0309045., 2003.
11. C. Darwin. The Origin of Species by Means of Natural Selection. D. Appleton and Company, Available online at http://www.literature.org/authors/ darwin-charles/the-origin-of-species/, 1859.
12. A. Tizghadam and A. Leon-Garcia. Survival Value of Communication Networks. Infocom Workshop on Network Science for Communications (NetSciCom), April 2009.
13. P. Van Mieghem and F. A. Kuipers. Concepts of Exact QoS Routing Algorithms. IEEE/ACM TRANSACTIONS ON NETWORKING, 12(5):851-864, October 2004.
14. IBM. An Architectural Blueprint For Autonomic Computing, April 2003.
15. Michael William Newman. The Laplacian Spectrum of Graphs. PhD thesis, Department of Mathematics, University of Manitoba, July 2000.
16. Fan R. K. Chung. Spectral Graph Theory. CBMS Regional Conference Series On Mathematics, No. 92. American Mathematical society, 1997.
17. D. J. Klein and M. Randic. Resistance Distance. Journal of Mathematical Chemistry, 12(1):81-95, 1993.
18. Dennis S. Bernstein. Matrix Mathematics. Prinston University Press, 2005.
19. A. Tizghadam and A. Leon-Garcia. On Robust Network Planning. In Proceedings of 7th Workshop on Design of Reliable Communication Networks (DRCN), Washington DC, USA, October 2009.
20. A. Ghosh, S. Boyd, and A. Saberi. Minimizing Effective Resistance of a Graph. SIAM Review, problems and techniques section, 50(1):37-66, February 2008. (Pubitemid 351386903)
21. A. Tizghadam and A. Leon-Garcia. A Graph Theoretical Approach to Traffic Engineering and Network Control Problem. In Proceedings of 21th International Teletraffic Congrees (ITC21), Paris, France, September 2009.
22. M. Fiedler. Algebraic Connectivity of Graphs. Czechoslovak Math. Journal, 23(98):298-305, 1973.
23. A. Bigdeli, A. Tizghadam, and A Leon-Garcia. Comparison of Network Criticality, Algebraic Connectivity, and other Graph Metrics. Venize, Italy, July 2009. First Workshop on Simplifying Complex Networks: SIMPLEX.
24. L. Kleinrock. Communication Nets, Stochastic Message Flow and Delay. McGraw-Hill, New York, 1964.
25. L. Kleinrock. Queueing Systems, volume II. John Wiley & Sons, 1975.
26. B. Meister, H. R. Muller, and H. R. Rudin. New optimization criteria for message switching networks. IEEE Transactions on Communication Technology, 19(3):256-260, June 1971.
27. http://totem.run.montefiore.ulg.ac.be/files/data/traffic- matricesanonymized-v2.tar.bz2.
28. M. Ziegelmann. Constrained Shortest Paths and Related Problems - Constrained Network Optimization. VDM Verlag, 2007.
29. G. Leduca, H. Abrahamssone, S. Balona, S. Besslerb, M. D'Arienzoh, O. Delcourta, J. Domingo-Pascuald, S. Cerav-Erbasg, I. Gojmeracb, X. Masipd, A. Pescaph, B. Quoitinf, S.P. Romanoh, E. Salvadoric, F. Skivea, H.T. Tranb, S. Uhligf, and H. Umitg. An Open Source Traffic Engineering Toolbox. Computer Communications, 29(5):593-610, March 2006.
30. A. Tizghadam and A. Leon-Garcia. On Robust Traffic Engineering in Core Networks. In IEEE GLOBECOM, December 2008.
31. D. P. Bertsekas, A. Nedic, and A. E. Ozdaglar. Convex Analysis and Optimization. Athena Scientific, April 2003.
32. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.