Finding optimal marking probability to reduce convergence time
Tsang, Danny H.K.
|Source||Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom August 2007 , 2008, pp. 249-253|
|Summary||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.|
View full-text via DOI
View full-text via Scopus