Probabilistic Packet Marking for Large-Scale IP Traceback

This paper presents an approach to IP traceback based on the probabilistic packet marking paradigm. Our approach, which we call randomize-and-link , uses large checksum cords to ldquolinkrdquo message fragments in a way that is highly scalable, for the checksums serve both as associative addresses a...

Full description

Saved in:
Bibliographic Details
Published inIEEE/ACM transactions on networking Vol. 16; no. 1; pp. 15 - 24
Main Author Goodrich, M.T.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.02.2008
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithm design and analysis
Associate addresses
Carbon capture and storage
checksum cords
Computer crime
Computer science
Computer security
Cords
Delay
distributed denial of service (DDOS)
Fires
Integrity
IP (Internet Protocol)
Large-scale systems
Messages
National security
Probabilistic methods
probabilistic packet marking
Probability theory
Routers
Spreads
traceback
Web and internet services
Online AccessGet full text

Cover

More Information
Summary:This paper presents an approach to IP traceback based on the probabilistic packet marking paradigm. Our approach, which we call randomize-and-link , uses large checksum cords to ldquolinkrdquo message fragments in a way that is highly scalable, for the checksums serve both as associative addresses and data integrity verifiers. The main advantage of these checksum cords is that they spread the addresses of possible router messages across a spectrum that is too large for the attacker to easily create messages that collide with legitimate messages.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2007.910594