On the difficulty of scalably detecting network attacks

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Kirill Levchenko University of California at San Diego
Ramamohan Paturi University of California at San Diego
George Varghese University of California at San Diego
Published in:
Cover Image
 
· Proceeding
CCS '04 Proceedings of the 11th ACM conference on Computer and communications security
Pages 12-20
ACM New York, NY, USA ©2004
table of contents ISBN:1-58113-961-6 doi>10.1145/1030083.1030087
On the difficulty of scalably detecting network attacks Published by ACM 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 35
· Downloads (cumulative): 1,691
· Citation Count: 11


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder