메뉴 건너뛰기




Volumn , Issue , 2009, Pages

A graph theoretical approach to traffic engineering and network control problem

Author keywords

Autonomic; Betweenness; Graph theory; Markov theory; Robustness; Traffic engineering

Indexed keywords

AUTONOMIC; BETWEENNESS; CONTROL LAWS; ETHERNET NETWORKS; GLOBAL NETWORKS; GRAPH THEORETICAL APPROACH; MARKOV THEORY; NETWORK CONTROL; NETWORK CRITICALITY; NETWORK WEIGHTS; NODES AND LINKS; OPTIMALITY; OPTIMIZATION PROBLEMS; STRICT CONVEXITY; THEORETICAL RESULT; TRAFFIC DEMANDS; TRAFFIC ENGINEERING; TRAFFIC FLOW; WEIGHT MATRICES;

EID: 70649112363     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (18)

References (8)
  • 1
    • 38149022614 scopus 로고    scopus 로고
    • A robust routing plan to optimize throughput in core networks
    • Elsvier
    • A. Tizghadam and A. Leon-Garcia. A Robust Routing Plan to Optimize Throughput in Core Networks. ITC20, Elsvier, pages 117- 128, 2007.
    • (2007) ITC20 , pp. 117-128
    • Tizghadam, A.1    Leon-Garcia, A.2
  • 4
    • 70649105372 scopus 로고    scopus 로고
    • PhD thesis, Department of Mathematics, University of Manitoba, July
    • Michael William Newman. The Laplacian Spectrum of Graphs. PhD thesis, Department of Mathematics, University of Manitoba, July 2000.
    • (2000) The Laplacian Spectrum of Graphs
    • Newman, M.W.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.