计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (29): 117-119.DOI: 10.3778/j.issn.1002-8331.2010.29.032

• 网络、通信、安全 • 上一篇    下一篇

改进的非重复性包标记IP追踪方案

张 梅1,任平安2,马建峰2   

  1. 1.陕西师范大学 计算机科学学院,西安 710062
    2.西安电子科技大学 计算机科学学院,西安 710071
  • 收稿日期:2009-03-10 修回日期:2009-06-01 出版日期:2010-10-11 发布日期:2010-10-11
  • 通讯作者: 张 梅

Improved scheme of un-overwriting PPM for IP traceback

ZHANG Mei1,REN Ping-an2,MA Jian-feng2   

  1. 1.College of Computer Science,Shaanxi Normal University,Xi’an 710062,China
    2.College of Computer Science,Xidian University,Xi’an 710071,China
  • Received:2009-03-10 Revised:2009-06-01 Online:2010-10-11 Published:2010-10-11
  • Contact: ZHANG Mei

摘要: IP追踪已成为防御拒绝服务攻击(DOS)的有效方案之一。其中,以Savage等人提出的概率包标记(PPM)已受到广泛重视。然而,概率包标记因为重复标记和固定概率而存在最弱链问题,从而导致重构路径的弱收敛性。提出一种新型的非重复性包标记的IP追踪方案,有效地减少了重构路径时的收敛时间以及计算开销,提高了路径重构的效率。

Abstract: IP traceback scheme has become one of the efficient coutermeasures to prevent the Denial Of Service(DOS) attack.Particularly,Probabilistic Packet Marking(PPM) first developed by Savage et al is promising and has many variants.But because of its overwritten marking and fixed marking probability,there exists the weakest link problem,which results in poor convergence of path reconstruction in PPM.A new scheme of un-overwriting PPM for IP traceback is presented.The convergent amount of marked packets requires path reconstruction and the computation overhead be both efficiently improved,and the efficiency of path reconstruction is increased.

中图分类号: