Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2018436.2018505acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
poster
Free access

Wide-area routing dynamics of malicious networks

Published: 15 August 2011 Publication History

Abstract

This paper studies the routing dynamics of malicious networks. We characterize the routing behavior of malicious networks on both short and long timescales. We find that malicious networks more consistently advertise prefixes with short durations and long inter- arrival times; over longer timescales, we find that malicious ASes connect with more upstream providers than legitimate ASes, and they also change upstream providers more frequently.

References

[1]
A. Dhamdhere and C. Dovrolis. Ten Years in the Evolution of the Internet Ecosystem. In Proceedings of ACM SIGCOMM/USENIX Internet Measurement Conference (IMC)., 2008.
[2]
Hostexploit. http://www.hostexploit.com.
[3]
H. A. Kim and B. Karp. Autograph: Toward automated, distributed worm signature detection. In the 13th conference on USENIX Security Symposium, 2004.
[4]
C. Kreibich and J. Crowcroft. Honeycomb: Creating intrusion detection signatures using honeypots. In 2nd Workshop on Hot Topics in Networks (HotNets-II), 2003.
[5]
A. Ramachandran and N. Feamster. Understanding the network-level behavior of spammers. In Proceedings of Sigcomm, 2006.

Cited By

View all
  • (2015)A Spam Traffic Cost Analysis for Network OperatorsProceedings of the 2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems10.1109/SBRC.2015.16(41-49)Online publication date: 18-May-2015

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGCOMM '11: Proceedings of the ACM SIGCOMM 2011 conference
August 2011
502 pages
ISBN:9781450307970
DOI:10.1145/2018436
  • cover image ACM SIGCOMM Computer Communication Review
    ACM SIGCOMM Computer Communication Review  Volume 41, Issue 4
    SIGCOMM '11
    August 2011
    480 pages
    ISSN:0146-4833
    DOI:10.1145/2043164
    Issue’s Table of Contents
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 August 2011

Check for updates

Author Tags

  1. bgp
  2. security
  3. spam

Qualifiers

  • Poster

Conference

SIGCOMM '11
Sponsor:
SIGCOMM '11: ACM SIGCOMM 2011 Conference
August 15 - 19, 2011
Ontario, Toronto, Canada

Acceptance Rates

SIGCOMM '11 Paper Acceptance Rate 32 of 223 submissions, 14%;
Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)29
  • Downloads (Last 6 weeks)12
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2015)A Spam Traffic Cost Analysis for Network OperatorsProceedings of the 2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems10.1109/SBRC.2015.16(41-49)Online publication date: 18-May-2015

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media