Two novel packet marking schemes for IP traceback

  • Authors:
  • Hanping Hu;Yi Wang;Lingfei Wang;Wenxuan Guo;Mingyue Ding

  • Affiliations:
  • Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science and Technology, Wuhan, P.R. China;Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science and Technology, Wuhan, P.R. China;Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science and Technology, Wuhan, P.R. China;Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science and Technology, Wuhan, P.R. China;Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science and Technology, Wuhan, P.R. China

  • Venue:
  • ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Two novel packet marking schemes, the non-Repeated Varying-Probability Packet Marking (nRVPPM) and the Compressed non-Repeated Varying-Probability Packet Marking (CnRVPPM), are presented. To solve the repeated marking problem, we propose in the nRVPPM that one packet is marked by routers only one time with the probability which is varying with the distance the packet has traveled. Besides, the nRVPPM makes the victim receives the packets marked by each router with the same probability. Based on the nRVPPM, we bring forward the CnRVPPM by employing the redundancy brought about by the similarity of IP addresses. Our simulation studies show that the proposed schemes offer high precision and efficiency, and can dramatically reduce the number of packets required for the traceback.