Advertisement

Two Novel Packet Marking Schemes for IP Traceback

  • Hanping Hu
  • Yi Wang
  • Lingfei Wang
  • Wenxuan Guo
  • Mingyue Ding
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4158)

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.

Keywords

Forwarding Path Attack Path Packet Marking Attack Source Probabilistic Packet Marking 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Belenky, A., Ansari, N.: On IP Traceback. IEEE Communications Magazine (July 2003)Google Scholar
  2. 2.
    Savage, S., Wetherall, D., Karlin, A., Anderson, T.: Practical Network Support for IP Traceback. In: Proceedings of the 2000 ACM SIGCOMM Conference (August 2000)Google Scholar
  3. 3.
    Boneh, A., Hofri, M.: The Coupon-collector Problem Revisited [J]. Commun. Statist. Stochastic Models 13 (1997)Google Scholar
  4. 4.
    Peng, T., Leckie, C., Ramamohanarao, K.: Adjusted Probabilistic Packet Marking for IP Traceback. In: Gregori, E., Conti, M., Campbell, A.T., Omidyar, G., Zukerman, M. (eds.) NETWORKING 2002. LNCS, vol. 2345, p. 697. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Theilmann, W., Rothermel, K.: Dynamic Distance Maps of the Internet. In: Proceedings of the 2000 IEEE INFOCOM Conference (March 2000)Google Scholar
  6. 6.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hanping Hu
    • 1
  • Yi Wang
    • 1
  • Lingfei Wang
    • 1
  • Wenxuan Guo
    • 1
  • Mingyue Ding
    • 1
  1. 1.Institute for Pattern Recognition and Artificial IntelligenceHuazhong University of Science and TechnologyWuhanP.R. China

Personalised recommendations