Submit Manuscript

Information Technology Journal

Year: 2009 | Volume: 8 | Issue: 4 | Page No.: 504-512
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend

Total views 361

Search

Authors

Zaihong Zhou

Dongqing Xie

Bingwang Jiao

Keywords

Research Article

A Maekawa Set Based Marking Scheme

Zaihong Zhou, Dongqing Xie and Bingwang Jiao
This study describes a novel Maekawa-set-based probabilistic Marking Scheme (MMS). It aims at the disadvantages of the FMS scheme, which are the large number of false positives caused by fragment marking and the need of network topology in node exclusive-or (XOR) restore, etc. The MMS scheme is to split the edge, which is composed of the IP addresses of two neighboring routers into fragments and allocates fragment-id for each fragment. Then, it will generate a Maekawa set based on those fragment-ids. The number of subset is m and the length of subset is k for the Maekawa set. While packets pass through a router, the router will write the k fragments orderly to the IP header by m times with an optimal probability, where the fragments are split from the edge and recombined in Maekawa subset way. There is no false positive in this MMS scheme after the attack path is reconstructed theoretically. In addition, it has several other advantages, it requires fewer packets to reconstruct the attack path; computation overhead is low; it does not require the network topology support as well as is able to prevent the hijacked router from forging the markings.
PDF Fulltext XML References Citation

Leave a Comment

Your email address will not be published. Required fields are marked *