메뉴 건너뛰기




Volumn , Issue , 2004, Pages 394-399

Effective network monitoring

Author keywords

[No Author keywords available]

Indexed keywords

BREADTH-FIRST-SEARCH TREE (BFS); NETWORK MONITORING; SHORTEST PATH TREE (SPT); WAXMAN AND POWER-LAW MODELS;

EID: 17444432280     PISSN: 10952055     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (10)

References (18)
  • 1
    • 0042475214 scopus 로고    scopus 로고
    • Robust Monitoring of link delays and faults in IP networks
    • Y: BEJERANO and R. RASTOGI, Robust Monitoring of link delays and faults in IP networks, In Proceedings of IEEE INFOCOM, (2003).
    • (2003) Proceedings of IEEE INFOCOM
    • Bejerano, Y.1    Rastogi, R.2
  • 2
    • 0000301097 scopus 로고
    • A greedy heuristic for the set-covering problem
    • C. CHVATAL, A greedy heuristic for the set-covering problem, Math. of Operation Research, 4 (1979), 233-235.
    • (1979) Math. of Operation Research , vol.4 , pp. 233-235
    • Chvatal, C.1
  • 10
    • 84860936376 scopus 로고    scopus 로고
    • Cooperative Association for Internet Data Analysis (CAIDA), http://www.caida.org/.
  • 12
    • 0043127575 scopus 로고    scopus 로고
    • Tree layout for internal network characterizations in multicast networks
    • M. ADLER, T. BU, R. SITARAMAN, and D. TOWSLEY, Tree Layout for Internal Network Characterizations in Multicast Networks, In Proceedings of NGC'01, (2001).
    • (2001) Proceedings of NGC'01
    • Adler, M.1    Bu, T.2    Sitaraman, R.3    Towsley, D.4


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