메뉴 건너뛰기




Volumn , Issue , 2009, Pages 246-255

A framework for distributed monitoring and root cause analysis for large IP networks

Author keywords

[No Author keywords available]

Indexed keywords

CLOSURE PROPERTY; COMMERCIAL NETWORKS; CROSS-DOMAIN; DISTRIBUTED ARCHITECTURE; DISTRIBUTED FRAMEWORK; DISTRIBUTED MONITORING; EVENT CORRELATION; IP NETWORKS; MANAGEMENT DOMAINS; MONITORING NETWORK; NETWORK ADMINISTRATOR; PARTITIONING MECHANISM; REAL NETWORKS; ROOT CAUSE; ROOT CAUSE ANALYSIS; SCALABILITY PROBLEMS; SYNTHETIC EVENTS; TWO-STEP APPROACH; WORST CASE;

EID: 74949101845     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SRDS.2009.22     Document Type: Conference Paper
Times cited : (15)

References (18)
  • 1
    • 74949091624 scopus 로고    scopus 로고
    • http://www.ibm.com/software/tivoli/.
  • 2
    • 74949137625 scopus 로고    scopus 로고
    • http://www.iptivia.com/.
  • 3
    • 74949131558 scopus 로고    scopus 로고
    • http://www.openview.hp.com/.
  • 4
    • 74949112113 scopus 로고    scopus 로고
    • http://www.packetdesign.com/.
  • 7
    • 33645786071 scopus 로고    scopus 로고
    • Maximum likelihood network topology identification from edge-based unicast measurements
    • M. Coates, R. Castro, R. Nowak, M. Gadhiok, R. King, and Y. Tsang. Maximum likelihood network topology identification from edge-based unicast measurements. In ACM SIGMETRICS, 2002.
    • (2002) ACM SIGMETRICS
    • Coates, M.1    Castro, R.2    Nowak, R.3    Gadhiok, M.4    King, R.5    Tsang, Y.6
  • 11
    • 0032131147 scopus 로고    scopus 로고
    • A fast and high quality multilevel scheme for partitioning irregular graphs
    • PII S1064827595287997
    • G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. In SIAM Journal of Scientific Computing, 20(1):359-392, 1998. (Pubitemid 128689516)
    • (1998) SIAM Journal of Scientific Computing , vol.20 , Issue.1 , pp. 359-392
    • Karypis, G.1    Kumar, V.2
  • 12
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. In Bell Systems Technical Journal, 49(2):291-308, 1970.
    • (1970) Bell Systems Technical Journal , vol.49 , Issue.2 , pp. 291-308
    • Kernighan, B.W.1    Lin., S.2
  • 16
    • 4544231612 scopus 로고    scopus 로고
    • Real-time problem determination in distributed systems using active probing
    • I. Rish, M. Brodie, N. Odintsova, S. Ma, and G. Grabarnik. Real-time problem determination in distributed systems using active probing. In NOMS, 2004.
    • (2004) NOMS
    • Rish, I.1    Brodie, M.2    Odintsova, N.3    Ma, S.4    Grabarnik, G.5
  • 18
    • 34547877703 scopus 로고    scopus 로고
    • Multi-domain diagnosis of end-to-end service failures in hierarchically routed networks
    • M. Steinder and A. Sethi. Multi-domain diagnosis of end-to-end service failures in hierarchically routed networks. In NETWORKING, 2004.
    • (2004) NETWORKING
    • Steinder, M.1    Sethi, A.2


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