摘要： 大多数概率包标记(PPM)因为重复标记和固定的标记概率而存在最弱链问题，从而导致重构路径的弱收敛性。文章提出了一种新的非重复性包标记的IP追踪方案，通过重载部分偏移域来获得更多的标记空间。具体以分片标记(FMS)方案为例，给出了标记算法和编码方式，分析了新方案在追踪范围、收敛时间、分片重组、误报和计算量等方面的性能。通过比较，证明新方案是优于FMS的。

关键词: 包标记, 最弱链, 收敛时间, 非重复标记

Abstract: There exists the weakest link problem, which results in poor convergence of path reconstruction in most probabilistic packet marking(PPM) schemes for their overwritten marking and fixed marking probability. A new scheme of un-overwriting PPM for IP traceback, which gets more available space for marking by overloading partial IP offset filed, is presented in this paper. With purpose of illustration, the detailed algorithmic description and coding method of FMS are given. The aspects of trace scope, convergence time, fragment reassembly, false positives and computational complexity performance are analyzed. The proposed scheme is shown to be superior to FMS by contrasting qualities.

Key words: Packet marking, Weakest link, Convergence time, Un-overwriting marking

中图分类号: 

• TP393.08