Name
Abstract | ||
|---|---|---|
Two novel packet marking schemes, the non-Repeated Varying-Probability Packet Marking (nRVPPM) and the Compressed non-Repeated Varying-Probability Packet Marking (CnRVPPM), are presented. To solve the repeated marking problem, we propose in the nRVPPM that one packet is marked by routers only one time with the probability which is varying with the distance the packet has traveled. Besides, the nRVPPM makes the victim receives the packets marked by each router with the same probability. Based on the nRVPPM, we bring forward the CnRVPPM by employing the redundancy brought about by the similarity of IP addresses. Our simulation studies show that the proposed schemes offer high precision and efficiency, and can dramatically reduce the number of packets required for the traceback. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11839569_44 | ATC |
Keywords | Field | DocType |
simulation study,ip traceback,ip address,compressed non-repeated varying-probability packet,proposed scheme,non-repeated varying-probability packet marking,high precision,novel packet | Internet Protocol,Computer science,Network packet,Transmission delay,Computer network,IP traceback,Real-time computing,Link state packet,Router,Packet generator,Processing delay | Conference |
Volume | ISSN | ISBN |
4158 | 0302-9743 | 3-540-38619-X |
Citations | PageRank | References |
1 | 0.34 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hanping Hu | 1 | 178 | 18.63 |
| Yi Wang | 2 | 1 | 0.34 |
| Lingfei Wang | 3 | 50 | 5.54 |
| Wenxuan Guo | 4 | 22 | 4.70 |
| Mingyue Ding | 5 | 261 | 41.04 |