On robust network planning

Proceedings of the 2009 7th International Workshop on the Design of Reliable Communication Networks, DRCN 2009

Volumn , Issue , 2009, Pages 139-146

  Tizghadam, Ali ^a   Leon Garcia, Alberto ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

A-MONOTONE; BETWEENNESS; CONVEX FUNCTIONS; CONVEX OPTIMIZATION PROBLEMS; DECREASING FUNCTIONS; ENVIRONMENTAL CHANGE; GLOBAL QUANTITIES; NETWORK CRITICALITY; NETWORK WEIGHTS; OPTIMAL WEIGHT MATRIX; RELIABLE COMMUNICATION; ROBUST NETWORK; WEIGHT MATRICES;

CONVEX OPTIMIZATION; CRITICALITY (NUCLEAR FISSION); TELECOMMUNICATION NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 71749088153     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DRCN.2009.5340013     Document Type: Conference Paper

References (16)

1. A. H. Dekker and B. D. Colbert. Network Robustness and Graph Topology. Australasian Computer Science Conference, 26:359-368, Jan. 2004.
2. R. Zhang-Shen and N. McKeown. Designing a Predictable Internet Backbone with Valiant Load-Balancing. In Thirteenth International Workshop on Quality of Service (IWQoS), Passau, Germany, June 2005.
3. L. Valiant and G. Brebner. Universal Schemes for Parallel Communication. In 13th Annual Symposium on Theory of Computing, May 1981.
4. C. S. Chang, D. S. Lee, and Y. S. Jou. Load Balanced Birkhoff-von Neumann Switches, Part I: One-Stage Buffering. In HPSR '01, Dallas, May 2001. IEEE.
5. A. Tizghadam and A. Leon-Garcia. A Robust Routing Plan to Optimize Throughput in Core Networks. ITC20, Elsvier, pages 117-128, 2007.
6. A. Tizghadam and A. Leon-Garcia. On Robust Traffic Engineering in Core Networks. In IEEE GLOBECOM, December 2008.
7. P. Van Mieghem and F. A. Kuipers. Concepts of Exact QoS Routing Algorithms. IEEE/ACM TRANSACTIONS ON NETWORKING, 12(5):851-864, October 2004.
8. M. Newman. A Measure of Betweenness Centrality Based on Random Walks. arXiv cond-mat/0309045., 2003.
9. C. Godsil and G. Royle. Algebraic Graph Theory. Springer-Verlag, 2001.
10. Dennis S. Bernstein. Matrix Mathematics. Prinston University Press, 2005.
11. L. Kleinrock. Queueing Systems, volume II. John Wiley & Sons, 1975.
12. M. Grant and S. Boyd. CVX: Matlab Software for Disciplined Convex Programming (Web Page and Software). http://stanford.edu/ boyd/cvx. September 2008.
13. 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, and H. Kimura, editors, http://stanford.edu/boyd/ graphdcp.html. Lecture Notes in Control and Information Sciences, Springer, 2008.
14. L. Kleinrock. Communication Nets, Stochastic Message Flow and Delay. McGraw-Hill, New York, 1964.
15. 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.
16. C. R. Rao and S. K. Mitra. Generalized Inverse of Matrices and its Applications. John Weily and Sons Inc., 1971.