On robust traffic engineering in core networks

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2008, Pages 2372-2377

  Tizghadam, Ali ^a   Leon Garcia, Alberto ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Betweenness; Congestion; Graph theory; Robustness; Traffic engineering

Indexed keywords

BACK-BONE NETWORK; BETWEENNESS; CONGESTION; CORE NETWORKS; DESTINATION NODES; ETHERNET NETWORKS; IN-CORE; IN-NETWORK; NETWORK NODE; NODES AND LINKS; PROBABILISTIC METHODS; ROBUSTNESS; THEORETICAL RESULT; TRAFFIC DEMANDS; TRAFFIC ENGINEERING;

CRITICALITY (NUCLEAR FISSION); GRAPH THEORY; HIGHWAY ENGINEERING; PLANNING; RESOURCE ALLOCATION;

TRAFFIC CONGESTION;

EID: 67249107565     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2008.ECP.456     Document Type: Conference Paper

References (8)

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. L. C. Freeman. Centrality in networks: I. conceptual clarification. Social Networks, (1):215-239, 1978/79.
4. M. S. Kodialam and et al. Maximum throughput routing of traffic in the hose model. INFOCOM, pages 1217-1225, 2006.
5. N. G. Duffield and et al. A flexible model for resource management in virtual private network. ACM SIGCOMM, Aug. 1999.
6. M. Newman. A measure of betweenness centrality based on random walks. arXiv cond-mat/0309045., 2003.
7. Dennis S. Bernstein. "MatrixMathematics". Prinston University Press, 2005.
8. L. S. P. Borgatti. Centrality and network flow. Social Networks, 27(1):55-71, 2005.