메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1893-1901

A fast and compact method for unveiling significant patterns in high speed networks

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; INTERNET PROTOCOLS; INTRUSION DETECTION; STATISTICAL METHODS;

EID: 34548304108     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.220     Document Type: Conference Paper
Times cited : (14)

References (12)
  • 2
    • 0014814325 scopus 로고
    • Space/time trade-offs in hashing coding with allowable errors
    • B. Bloom. Space/time trade-offs in hashing coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.1
  • 3
    • 70450232823 scopus 로고    scopus 로고
    • Network applications of bloom filters: A survey
    • 14
    • A. Broder and M. Mitzenmacher. Network applications of bloom filters: a survey. Internet Mathematics, 1(4):485:509, 2003.
    • (2003) Internet Mathematics , vol.485 , pp. 509
    • Broder, A.1    Mitzenmacher, M.2
  • 5
    • 2442583610 scopus 로고    scopus 로고
    • New Directions in Traffic Measurement and Accounting: Focusing on the Elephants, Ignoring the Mice
    • Aug
    • C. Estan and G. Varghese. New Directions in Traffic Measurement and Accounting: Focusing on the Elephants, Ignoring the Mice. ACM Trans. on Computer Systems, 21(3):270-313, Aug 2003.
    • (2003) ACM Trans. on Computer Systems , vol.21 , Issue.3 , pp. 270-313
    • Estan, C.1    Varghese, G.2
  • 6
    • 8344272783 scopus 로고    scopus 로고
    • What's New: Finding Significant Differences in Network Data Streams
    • Mar
    • G. Cormode and S. Muthukrishnan. What's New: Finding Significant Differences in Network Data Streams. In Proc. of IEEE INFOCOM, Mar. 2004.
    • (2004) Proc. of IEEE INFOCOM
    • Cormode, G.1    Muthukrishnan, S.2
  • 7
    • 8344244495 scopus 로고    scopus 로고
    • Runs bAsed Traffic Estimator (RATE): A Simple, Memory Efficient Scheme for Per-Flow Rate Estimation
    • Mar
    • M. Kodialam, T. Lakshman, and S. Mohanty. Runs bAsed Traffic Estimator (RATE): A Simple, Memory Efficient Scheme for Per-Flow Rate Estimation. In Proc. of IEEE INFOCOM, Mar. 2004.
    • (2004) Proc. of IEEE INFOCOM
    • Kodialam, M.1    Lakshman, T.2    Mohanty, S.3
  • 9
  • 10
    • 0346354497 scopus 로고    scopus 로고
    • Approximate Frequency Counts over Data Streams
    • G. Manku and R. Motwani. Approximate Frequency Counts over Data Streams. In Proc. VLDB, 2002.
    • (2002) Proc. VLDB
    • Manku, G.1    Motwani, R.2
  • 11
    • 34548346985 scopus 로고    scopus 로고
    • NLANR, Data
    • NLANR. Abilene-III Trace Data. http://pma.nlanr.net/Special/ipls3.html.
    • Abilene-III Trace
  • 12
    • 34249780184 scopus 로고    scopus 로고
    • Reverse hashing for high-speed network monitoring: Algorithms, evaluation, and applications
    • Barcelona, Spain, April
    • R. Schweller, Z. Li, Y. Chen, Y. Gao, A. Gupta, Y. Zhang, P. Dinda, M. Kao, and G. Memik. Reverse hashing for high-speed network monitoring: algorithms, evaluation, and applications. In IEEE INFOCOM, Barcelona, Spain, April 2006.
    • (2006) IEEE INFOCOM
    • Schweller, R.1    Li, Z.2    Chen, Y.3    Gao, Y.4    Gupta, A.5    Zhang, Y.6    Dinda, P.7    Kao, M.8    Memik, G.9


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