Skip to main content

Two Novel Packet Marking Schemes for IP Traceback

  • Conference paper
  • 775 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNPSE,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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Belenky, A., Ansari, N.: On IP Traceback. IEEE Communications Magazine (July 2003)

    Google Scholar 

  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. Boneh, A., Hofri, M.: The Coupon-collector Problem Revisited [J]. Commun. Statist. Stochastic Models 13 (1997)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  5. Theilmann, W., Rothermel, K.: Dynamic Distance Maps of the Internet. In: Proceedings of the 2000 IEEE INFOCOM Conference (March 2000)

    Google Scholar 

  6. CAIDA, http://www.caida.org/tools/measurement/skitter/index.xml

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, H., Wang, Y., Wang, L., Guo, W., Ding, M. (2006). Two Novel Packet Marking Schemes for IP Traceback. In: Yang, L.T., Jin, H., Ma, J., Ungerer, T. (eds) Autonomic and Trusted Computing. ATC 2006. Lecture Notes in Computer Science, vol 4158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839569_44

Download citation

  • DOI: https://doi.org/10.1007/11839569_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38619-3

  • Online ISBN: 978-3-540-38622-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics