Deterministic packet marking based on redundant decomposition for IP traceback

2006 ◽  
Vol 10 (3) ◽  
pp. 204-206 ◽  
Author(s):  
Guang Jin ◽  
Jiangang Yang
Keyword(s):  
Ip Traceback ◽  
Packet Marking

Dynamic probabilistic packet marking for efficient IP traceback

2007 ◽  
Vol 51 (3) ◽  
pp. 866-882 ◽  
Author(s):  
Jenshiuh Liu ◽  
Zhi-Jian Lee ◽  
Yeh-Ching Chung
Keyword(s):  
Ip Traceback ◽  
Packet Marking

scholarly journals Storage-Efficient 16-Bit Hybrid IP Traceback with Single Packet

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Ming Hour Yang
Keyword(s):  
User Interface ◽  
False Positive ◽  
High Accuracy ◽  
Small Degree ◽  
False Positives ◽  
Storage Requirement ◽  
Ip Traceback ◽  
Packet Marking

Since adversaries may spoof their source IPs in the attacks, traceback schemes have been proposed to identify the attack source. However, some of these schemes’ storage requirements increase with packet numbers. Some even have false positives because they use an IP header’s fragment offset for marking. Thus, we propose a 16-bit single packet hybrid IP traceback scheme that combines packet marking and packet logging with high accuracy and low storage requirement. The size of our log tables can be bounded by route numbers. We also set a threshold to determine whether an upstream interface number is stored in a log table or in a marking field, so as to balance the logging frequency and our computational loads. Because we store user interface information on small-degree routers, compared with current single packet traceback schemes, ours can have the lowest storage requirements. Besides, our traceback achieves zero false positive/negative rates and guarantees reassembly of fragmented packets at the destination.

Sign in / Sign up

Export Citation Format

Share Document