On congestion in mission critical networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages

  Tizghadam, Ali ^a   Leon Garcia, Alberto ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Betweenness; Congestion; Graph theory; Network design problem; Robustness

Indexed keywords

COMPUTER NETWORKS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY;

BETWEENNESS; CONGESTION; NETWORK DESIGN PROBLEM; NETWORK TOPOLOGIES; ROBUSTNESS;

TELECOMMUNICATION NETWORKS;

EID: 51049121190     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2008.4544634     Document Type: Conference Paper

References (10)

1. A. Tizghadam and A. Leon-Garcia. A robust routing plan to optimize throughput in core networks. ITC20, Elsvier, pages 117-128, 2007.
2. A. H. Dekker and B. D. Colbert. Network robustness and graph topology. Australasian Computer Science Conference, 26:359-368, Jan. 2004.
3. A. Tizghadam and A. Leon-Garcia. Lsp and back up path setup in mpls networks based on path criticality index. ICC 2007, IEEE, pages 441-448, 2007.
4. L. C. Freeman. Centrality in networks: I. conceptual clarification. Social Networks, (1):215-239, 1978/79.
5. M. S. Kodialam and et al. Maximum throughput routing of traffic in the hose model. INFOCOM, pages 1217-1225, 2006.
6. N. G. Duffield and et al. A flexible model for resource management in virtual private network. ACM SIGCOMM, Aug. 1999.
7. M. Newman. A measure of betweenness centrality based on random walks. arXiv cond-mat/0309045., 2003.
8. A. Leon-Garcia. "Probability and Random Processes for Electrical Engineering". Addisn Wesley, 2th edition, 1993.
9. www.internet2.org.
10. B. Bollobs. "Random Graphs". Cambridge University Press, 2th edition, 2001.