메뉴 건너뛰기




Volumn , Issue , 2003, Pages 7-12

On intrusion source identification

Author keywords

Fault detection; Intrusion detection; Network forensics; Routing; Trace back

Indexed keywords

ALGORITHMS; COMPUTER CRIME; GRAPH THEORY; NETWORKS (CIRCUITS); PACKET NETWORKS; ROUTERS; SECURITY OF DATA; TELECOMMUNICATION TRAFFIC;

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

References (16)
  • 1
    • 0027576402 scopus 로고
    • Computational Complexity Issues in operative diagnosis of graph-based systems
    • April
    • N.S.V. Rao, Computational Complexity Issues in operative diagnosis of graph-based systems, IEEE Transactions Comput., vol. 42, no. 4, pp.447-457, April 1993
    • (1993) IEEE Transactions Comput. , vol.42 , Issue.4 , pp. 447-457
    • Rao, N.S.V.1
  • 3
    • 0035276556 scopus 로고    scopus 로고
    • Operative Diagnosis of Graph-Based Systems with Multiple Faults
    • March
    • Stefano Chessa and Paolo Santi. Operative Diagnosis of Graph-Based Systems with Multiple Faults, IEEE Transactions on System Man and Cybernetics -Part A, Vol. 31, No. 2, pp. 112-119, March 2001
    • (2001) IEEE Transactions on System Man and Cybernetics - Part A , vol.31 , Issue.2 , pp. 112-119
    • Chessa, S.1    Santi, P.2
  • 5
    • 0028430224 scopus 로고
    • Network intrusion detection
    • May/June
    • B. Mukherjee, L. T. Heberlein, and K. N. Levitt. Network intrusion detection, IEEE Network, vol. 8, no. 3, pp. 26-41, May/June 1994.
    • (1994) IEEE Network , vol.8 , Issue.3 , pp. 26-41
    • Mukherjee, B.1    Heberlein, L.T.2    Levitt, K.N.3
  • 7
    • 0002067431 scopus 로고    scopus 로고
    • NetSTAT: A Network-based Intrusion Detection System
    • IOS Press
    • G. Vigna and R. Kemmerer, NetSTAT: A Network-based Intrusion Detection System, Journal of Computer Security, 7(1), IOS Press, 1999.
    • (1999) Journal of Computer Security , vol.7 , Issue.1
    • Vigna, G.1    Kemmerer, R.2
  • 10
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • July
    • Burton H. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, vol. 13, no 7, pp. 422-426, July 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.H.1
  • 12
    • 26844486180 scopus 로고
    • Dynamics of Internet Routing Information
    • Bilal Chinoy, Dynamics of Internet Routing Information, Proceedings of ACM SIGCOMM '93, pp. 289-298, 1993.
    • (1993) Proceedings of ACM SIGCOMM '93 , pp. 289-298
    • Chinoy, B.1
  • 15
    • 0003780715 scopus 로고
    • Massachusetts: Addison-Wesley
    • F. Harary, Graph Theory. (Massachusetts: Addison-Wesley, 1969) 32-37.
    • (1969) Graph Theory , pp. 32-37
    • Harary, F.1
  • 16
    • 24544465672 scopus 로고    scopus 로고
    • The complexity of constructing evolutionary trees using experiments
    • BRICS, Department of Computer Science, University of Aarhus
    • G.S. Brodal, R. Fagerberg, and et al. The complexity of constructing evolutionary trees using experiments. Technical Report BRICS-RS-01-1, BRICS, Department of Computer Science, University of Aarhus, 2001.
    • (2001) Technical Report , vol.BRICS-RS-01-1
    • Brodal, G.S.1    Fagerberg, R.2


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