dc.contributor.advisor | Sarangan, Venkatesh | |
dc.contributor.author | Gopalsamy, Radhakrishnan | |
dc.date.accessioned | 2014-04-15T18:31:07Z | |
dc.date.available | 2014-04-15T18:31:07Z | |
dc.date.issued | 2005-07-01 | |
dc.identifier.uri | https://hdl.handle.net/11244/8156 | |
dc.description.abstract | Denial-of -Service attack has emerged as a great threat to the Internet. Trace back is the scheme that is used to get Denial of Service attacker. Various trace back schemes have been proposed by others. The draw back in the existing schemes is router overload and takes a long time to get the trace. This happens because of maintaining constant marking probability. The new scheme proposed is "Hop count sensitive marking probability in probabilistic packet marking." In this approach marking probability is calculated based on the Hop count. So a variable marking probability is maintained. Having variable marking probability minimizes router overload and fastens the trace back process. This method is of great advantage to the critical services. The performance of the method is studied by simulation. | |
dc.format | application/pdf | |
dc.language | en_US | |
dc.publisher | Oklahoma State University | |
dc.rights | Copyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material. | |
dc.title | Hop-count Sensitive Packet Marking in Probabilistic Packet Marking | |
dc.type | text | |
dc.contributor.committeeMember | Chen, Debao | |
dc.contributor.committeeMember | Thomas, Johnson P. | |
osu.filename | Gopalsamy_okstate_0664M_1411.pdf | |
osu.college | Arts and Sciences | |
osu.accesstype | Open Access | |
dc.description.department | Computer Science Department | |
dc.type.genre | Thesis | |