Robust network planning in nonuniform traffic scenarios

Computer Communications

Volumn 34, Issue 12, 2011, Pages 1436-1449

  Tizghadam, Ali ^a   Leon Garcia, Alberto ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Betweenness centrality; Network criticality; Network planning; Network science; Robustness

Indexed keywords

BETWEENNESS; BETWEENNESS CENTRALITY; CONVEX FUNCTIONS; CONVEX OPTIMIZATION TECHNIQUES; DATA NETWORK; ENVIRONMENTAL CHANGE; ENVIRONMENTAL VARIATIONS; LINEAR FUNCTIONS; LINK WEIGHTS; NET WORK UTILIZATION; NETWORK COSTS; NETWORK CRITICALITY; NETWORK PERFORMANCE METRICS; NETWORK PLANNING; NETWORK SCIENCE; NONUNIFORM TRAFFIC; OPTIMIZATION PROBLEMS; RELIABLE COMMUNICATION; ROBUST NETWORK; SEMI-DEFINITE PROGRAMMING; TRAFFIC FLUCTUATIONS; TRAFFIC MATRICES;

CONVEX OPTIMIZATION; CRITICALITY (NUCLEAR FISSION); NETWORK PERFORMANCE;

OPTIMIZATION;

EID: 79959373897     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2010.12.013     Document Type: Article

References (32)

1. A.H. Dekker, B.D. Colbert, Network robustness and graph topology, Australasian Computer Science Conference, vol. 26, 2004, pp. 359-368
2. R. Zhang-Shen, N. McKeown, Designing a predictable internet backbone with valiant load-balancing, in: Thirteenth International Workshop on Quality of Service (IWQoS), Passau, Germany, 2005.
3. L.C. Freeman Centrality in networks: I. Conceptual clarification Social Networks 1 1978/79 215 239
4. L.C. Freeman, S.P. Borgatti, and D.R. White Centrality in valued graphs: a measure of betweenness based on network flow Social Networks 13 1991 141 154
5. L.S.P. Borgatti Centrality and network flow Social Networks 27 1 2005 55 71
6. M. Newman A measure of betweenness centrality based on random walks Social Networks 27 2005 39 54 (Pubitemid 40272648)
7. A. Tizghadam, A. Leon-Garcia, A graph theoretical approach to traffic engineering and network control problem, in: Twenty-first International Teletraffic Congress (ITC21), Paris, France, 2009.
8. C.R. Rao, and S.K. Mitra Generalized Inverse of Matrices and its Applications 1971 John Weily and Sons Inc.
9. D.J. Klein, and M. Randic Resistance distance Journal of Mathematical Chemistry 12 1 1993 81 95
10. A. Ghosh, S. Boyd, and A. Saberi Minimizing effective resistance of a graph SIAM Review, Problems and Techniques Section 50 1 2008 37 66 (Pubitemid 351386903)
11. A. Tizghadam, A Leon-Garcia, Survival value of communication networks, in: INFOCOM Workshop on Network Science for Communications (NetSciCom), Rio de Janeiro, Brazil, 2009, pp. 1-6.
12. L. Kleinrock Queueing Systems vol. II 1975 John Wiley and Sons
13. Dennis S. Bernstein Matrix Mathematics second ed. 2009 Prinston University Press
14. M. Grant, S. Boyd, CVX: Matlab Software for Disciplined Convex Programming (Web Page and Software). , 2008.
15. M. Grant, and S. Boyd Graph implementations for nonsmooth convex programs, recent advances in learning and control (a tribute to M. Vidyasagar) V. Blondel, S. Boyd, H. Kimura, Lecture Notes in Control and Information Sciences 2008 Springer
16. S. Boyd, and L. Vandenberghe Convex Optimization 2004 Cambridge University Press
17. D. Eppstein Finding the K-shortest paths Society for Industrial and Applied Mathematics (SIAM) Journal of Computing 28 2 1998 652 673
18. A. Tizghadam, and A. Leon-Garcia A robust routing plan to optimize throughput in core networks ITC20 2007 Elsvier 117 128
19. A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, The electrical resistance of a graph captures its commute and cover times. STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of Computing, New York, NY, USA, 1989.
20. A. Tizghadam, Alireza Bigdeli, Hassan Naser, A. Leon-Garcia, Joint optimization of resources and routes: from communication networks to power grids. To appear in Handbook of Optimization in Complex Networks, My T. Thai and P. Pardalos (Eds.), Springer, 2011.
21. 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 2000 2566 2579 (Pubitemid 32251997)
22. D.P. Bertsekas, A. Nedic, and A.E. Ozdaglar Convex Analysis and Optimization 2003 Athena Scientific
23. A. Tizghadam, A. Leon-Garcia, On congestion in mission critical networks, in: Workshop on Mission Critical Networks (MCN), INFOCOM, IEEE, April 2008.
24. A. Tizghadam, and A. Leon-Garcia Autonomic traffic engineering for network robustness IEEE Journal of Selected Areas in Communications (J-SAC) 28 1 2010 39 50
25. A. Tizghadam, A. Leon-Garcia, On robust network planning, in: Seventh Workshop on Designing Reliable Communication Networks (DRCN), October 2009.
26. M. Fiedler Algebraic connectivity of graphs Czechoslovak Mathematical Journal 23 98 1973 298 305
27. L. Kleinrock Communication Nets, Stochastic Message Flow and Delay 1964 McGraw-Hill New York
28. B. Meister, H.R. Muller, and H.R. Rudin New optimization criteria for message switching networks IEEE Transactions on Communication Technology 19 3 1971 256 260
29. N. Spring, R. Mahajan, D. Wetherall, and T. Anderson Measuring ISP topologies with Rocketfuel IEEE/ACM Transactions on Networking (TON) 12 1 2004 2 16
30. D. Applegate, and E. Cohen Making routing robust to changing traffic demands: algorithms and evaluation IEEE/ACM Transactions on Networking (TON) 14 6 2006 1193 1206 (Pubitemid 46432426)
31. A. Tizghadam, A. Leon-Garcia, On random walks in direction-aware network problems, in: ACM SIGMETRICS Performance Evaluation Review 38(2) (2010) 9-11.
32. A. Tizghadam, A. Leon-Garcia, LSP and back up path setup in MPLS networks based on path criticality index, in: IEEE International Conference on Communications (ICC), Glasgow, Scotland, 2007.