메뉴 건너뛰기




Volumn 3, Issue 3, 2005, Pages 25-33

Collaborative internet worm containment

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED HASH TABLES (DHT); OVERLAY NETWORKS; PEER TO PEER NETWORKS; REAL-LIFE INTERNET ENVIRONMENTS;

EID: 20844436808     PISSN: 15407993     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2005.63     Document Type: Review
Times cited : (72)

References (16)
  • 2
    • 0036871268 scopus 로고    scopus 로고
    • Internet infrastructure security: A taxonomy
    • Nov.
    • A. Chakrabarti and G. Manimaran, "Internet Infrastructure Security: A Taxonomy," IEEE Network, Nov. 2002, pp. 13-21.
    • (2002) IEEE Network , pp. 13-21
    • Chakrabarti, A.1    Manimaran, G.2
  • 3
    • 0037298256 scopus 로고    scopus 로고
    • A scalable peer-to-peer lookup protocol for Internet applications
    • I. Stoica et al., "A Scalable Peer-to-Peer Lookup Protocol for Internet Applications," IEEE/ACM Trans. Networking, vol. 11, no. 1, 2003, pp. 17-32.
    • (2003) IEEE/ACM Trans. Networking , vol.11 , Issue.1 , pp. 17-32
    • Stoica, I.1
  • 5
    • 0742269305 scopus 로고    scopus 로고
    • Resilient self-organizing overlay networks for security update delivery
    • Jan.
    • J. Li, P. Reiher, and G. Popek, "Resilient Self-Organizing Overlay Networks for Security Update Delivery," IEEE J. Selected Areas in Comm.,Jan. 2004, pp. 189-202.
    • (2004) IEEE J. Selected Areas in Comm. , pp. 189-202
    • Li, J.1    Reiher, P.2    Popek, G.3
  • 6
  • 7
    • 0042474173 scopus 로고    scopus 로고
    • Internet quarantine: Requirements for containing self-propagating codes
    • IEEE CS Press
    • D. Moore et al., "Internet Quarantine: Requirements for Containing Self-Propagating Codes," Proc. IEEE INFOCOM, IEEE CS Press, 2003, pp. 1901-1910.
    • (2003) Proc. IEEE INFOCOM , pp. 1901-1910
    • Moore, D.1
  • 8
    • 20844432436 scopus 로고    scopus 로고
    • WormShield: Collaborative worm signature detection using distributed aggregation trees
    • Internet and Grid Computing Lab, Univ. of Southern California
    • M. Cai et al., "WormShield: Collaborative Worm Signature Detection Using Distributed Aggregation Trees," tech. report TR 2005-10, Internet and Grid Computing Lab, Univ. of Southern California, 2005; http://grid sec.usc.edu/TR/TR-2005-10.pdf.
    • (2005) Tech. Report , vol.TR 2005-10
    • Cai, M.1
  • 9
    • 84860953014 scopus 로고    scopus 로고
    • Fast and accurate traffic matrix measurement using adaptive cardinality counting
    • Internet and Grid Computing Lab, Univ. of Southern California
    • M. Cai et al., "Fast and Accurate Traffic Matrix Measurement Using Adaptive Cardinality Counting," tech. report TR 2005-12, Internet and Grid Computing Lab, Univ. of Southern California, 2005; http://gridsec.usc.edu/TR/TR- 2005-12.pdf.
    • (2005) Tech. Report , vol.TR 2005-12
    • Cai, M.1
  • 12
    • 0003676885 scopus 로고
    • Fingerprinting by random polynomials
    • Center for Research in Computing Technology, Harvard Univ.
    • M.O. Rabin, "Fingerprinting by Random Polynomials," tech. report 15-81, Center for Research in Computing Technology, Harvard Univ., 1981.
    • (1981) Tech. Report , vol.15 , Issue.81
    • Rabin, M.O.1
  • 13
    • 85084163246 scopus 로고    scopus 로고
    • Autograph: Toward automated distributed worm signature detection
    • Usenix Assoc.
    • H.A. Kim and B. Karp, "Autograph: Toward Automated Distributed Worm Signature Detection," Proc. Usenix Security Symp., Usenix Assoc., 2004, pp. 271-286.
    • (2004) Proc. Usenix Security Symp. , pp. 271-286
    • Kim, H.A.1    Karp, B.2
  • 14
    • 0142152716 scopus 로고    scopus 로고
    • LogLog counting of large cardinalities
    • LNCS 2832, Springer-Verlag
    • M. Durand and P. Flajolet, "LogLog Counting of Large Cardinalities," Proc. European Sytnp. Algorithms, LNCS 2832, Springer-Verlag, 2003. pp. 605-617.
    • (2003) Proc. European Sytnp. Algorithms , pp. 605-617
    • Durand, M.1    Flajolet, P.2
  • 15
    • 1242308107 scopus 로고    scopus 로고
    • Fast accurate computation of large-scale IP traffic matrices from link loads
    • ACM Press
    • Y. Zhang et al., "Fast Accurate Computation of Large-scale IP Traffic Matrices from Link Loads," Proc. SIGCOMM, ACM Press, 2003, pp. 301-312.
    • (2003) Proc. SIGCOMM , pp. 301-312
    • Zhang, Y.1


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