Finding Optimal Marking Probability to Reduce Convergence Time

Miao Ma; Danny H. K. Tsang

2nd International ICST Conference on Communications and Networking in China

Research Article

Finding Optimal Marking Probability to Reduce Convergence Time

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/CHINACOM.2007.4469361,
    author={Miao Ma and Danny H. K. Tsang},
    title={Finding Optimal Marking Probability to Reduce Convergence Time},
    proceedings={2nd International ICST Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2008},
    month={3},
    keywords={IP traceback  Network security  Tabu Marking Scheme  convergence time  distributed denial-of-service attacks},
    doi={10.1109/CHINACOM.2007.4469361}
}

Miao Ma
Danny H. K. Tsang
Year: 2008
Finding Optimal Marking Probability to Reduce Convergence Time
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2007.4469361

Miao Ma¹^,*, Danny H. K. Tsang¹^,*

1: Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong

*Contact email: eemma@ust.hk, eetsang@ust.hk

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 traceback Network security Tabu Marking Scheme convergence time distributed denial-of-service attacks

Published: 2008-03-07
Publisher: IEEE
Modified: 2011-07-17

: http://dx.doi.org/10.1109/CHINACOM.2007.4469361