Dynamic probabilistic packet marking with partial non-preemption

Abstract

This paper studies the technique of probabilistic packet marking. The main purpose is for the receiver to trace the true sources of the marked packets and rebuild their paths rapidly. In many existing schemes, marked packets are overwritten by other marking routers because of the nature of probabilistic packet marking. Although some IP traceback schemes can improve the overwriting problem, they usually make unrealistic assumption[11] or do not consider the load balancing issue of the routers. In probabilistic packet marking, how to address the re-mark problem and how to balance routers' overhead are two important design considerations. A scheme is proposed in this paper to address these problems in probabilistic packet marking. Using computer simulation, we observe that our scheme can greatly reduce re-marking. When compared with the current IP traceback schemes, our scheme can reduce 65% marked packets than the other scheme. Moreover, the overhead of marking packet in each router is even out in the proposed scheme than the other. © 2008 Springer-Verlag Berlin Heidelberg.