Title :
Finding Optimal Marking Probability to Reduce Convergence Time
Author :
Ma, Miao ; Tsang, Danny H K
Author_Institution :
Hong Kong Univ. of Sci. & Technol., Kowloon
Abstract :
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.
Keywords :
IP networks; Internet; probability; search problems; telecommunication security; telecommunication traffic; transport protocols; IP traceback; Internet traffic; Tabu marking scheme convergence; distributed denial-of-service attack; optimal probability packet marking scheme; Computer crime; Convergence of numerical methods; Information filtering; Information filters; Internet; Measurement; Numerical simulation; Robustness; Sampling methods; Security; IP traceback; Network security; Tabu Marking Scheme; convergence time; distributed denial-of-service attacks;
Conference_Titel :
Communications and Networking in China, 2007. CHINACOM '07. Second International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-1009-5
Electronic_ISBN :
978-1-4244-1009-5
DOI :
10.1109/CHINACOM.2007.4469374
