Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Finding Optimal Marking Probability to Reduce Convergence Time
By: Miao Ma; Tsang, D.H.K.;
2007 / IEEE / 978-1-4244-1008-8
This item was taken from the IEEE Conference ' Finding Optimal Marking Probability to Reduce Convergence Time ' On IP traceback, it is important to reduce the minimum number of packets required for path reconstruction (i.e., convergence time) for a probability packet marking (PPM) scheme. In this paper, we study the impact of the marking probability on the convergence time for Tabu Marking Scheme (TMS) and obtain its optimal marking probability. Both numerical and simulation results show that, the convergence time of TMS can be significantly reduced by using optimal marking probability. Moreover, the convergence time of TMS is robust subject to the deviation of the marking probability from the optimal one.
Optimal Probability Packet Marking Scheme
Tabu Marking Scheme Convergence
Distributed Denial-of-service Attack
Convergence Of Numerical Methods
Distributed Denial-of-service Attacks
Tabu Marking Scheme