메뉴 건너뛰기




Volumn , Issue , 2014, Pages 539-550

Dynamic scheduling of network updates

Author keywords

network update; software defined networking

Indexed keywords

COMPUTER SIMULATION; CONVOLUTIONAL CODES; WIDE AREA NETWORKS;

EID: 84907356471     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2619239.2626307     Document Type: Conference Paper
Times cited : (234)

References (35)
  • 6
    • 84862948652 scopus 로고    scopus 로고
    • MicroTE: Fine grained traffic engineering for data centers
    • T. Benson, A. Anand, A. Akella, and M. Zhang, "MicroTE: Fine grained traffic engineering for data centers," in ACM CoNEXT, 2011.
    • (2011) ACM CoNEXT
    • Benson, T.1    Anand, A.2    Akella, A.3    Zhang, M.4
  • 21
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • R. Tarjan, "Depth-first search and linear graph algorithms," SIAM Journal on Computing, vol. 1, no. 2, 1972.
    • (1972) SIAM Journal on Computing , vol.1 , Issue.2
    • Tarjan, R.1
  • 27
    • 34548355254 scopus 로고    scopus 로고
    • Disruption free topology reconfiguration in OSPF networks
    • P. Francois, M. Shand, and O. Bonaventure, "Disruption free topology reconfiguration in OSPF networks," in INFOCOM, 2007.
    • (2007) INFOCOM
    • Francois, P.1    Shand, M.2    Bonaventure, O.3
  • 28
    • 37549047953 scopus 로고    scopus 로고
    • Avoiding transient loops during the convergence of link-state routing protocols
    • P. Francois and O. Bonaventure, "Avoiding transient loops during the convergence of link-state routing protocols," IEEE/ACM Trans. Networking, vol. 15, no. 6, 2007.
    • (2007) IEEE/ACM Trans. Networking , vol.15 , Issue.6
    • Francois, P.1    Bonaventure, O.2
  • 31


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