An efficient probabilistic packet marking scheme (NOD-PPM)

Authors:
Huifang Yin;Jun Li
Affiliations:
Computer Network Information Center, Chinese Academy of Sciences, China;Computer Network Information Center, Chinese Academy of Sciences, China
Venue:
ISC'06 Proceedings of the 9th international conference on Information Security
Year:
2006

Citing 5
Cited 0

Providing guaranteed services without per flow management

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Practical network support for IP traceback

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Efficient packet marking for large-scale IP traceback

Proceedings of the 9th ACM conference on Computer and communications security
Server Selection Using Dynamic Path Characterization in Wide-Area Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
You Can Run, But You Can't Hide: An Effective Statistical Methodology to Trace Back DDoS Attackers

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an efficient scheme of probabilistic packet marking. The main idea is to preserve the victims' IP addresses at the routers participating in the packet marking scheme, based on the precondition that a router won't begin to marking until it receives a signal from the victim. Then, the destination address field of IP header can be used to carry edge information without fragmenting, and the identification field can be used to check attack paths' validity under DDoS. We describe the scheme and discuss the number of packets required for reconstructing the attack paths, the number of false positives of attackers and the extra cost at routers in this paper.