完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLee, THen_US
dc.contributor.authorHuang, TYWen_US
dc.contributor.authorLin, Ien_US
dc.date.accessioned2014-12-08T15:25:10Z-
dc.date.available2014-12-08T15:25:10Z-
dc.date.issued2005en_US
dc.identifier.isbn0-7803-8938-7en_US
dc.identifier.issn1550-3607en_US
dc.identifier.urihttp://hdl.handle.net/11536/17558-
dc.description.abstractDeterministic packet marking (DPM) has recently been proposed as an alternative approach for IP traceback. It requires no extra bandwidth and is backward compatible with Internet equipments that do not implement it. Moreover, service providers can implement it without revealing their internal network topology. Unfortunately, the false positive rate could be very high if multiple hosts use the same source address to attack the victim simultaneously. Even worse, no source will be identified if attackers change their source addresses for every packet they send. These two problems can be solved with a modified DPM scheme which we called DPM with address digest (DPM-AD). We found that the false positive rate of the DPM-AD scheme could be much higher than it was claimed when the number of ingress router interfaces is larger than the number of attackers. In this paper, we propose and evaluate the false positive rate of a novel DPM scheme that is much more scalable than the DPM-AD scheme. Our analysis and simulation results show that the proposed DPM scheme can trace 1K simultaneous attackers at a false positive rate less than 0.5% with acceptable reconstruction complexity.en_US
dc.language.isoen_USen_US
dc.titleA deterministic packet marking scheme for tracing multiple Internet attackersen_US
dc.typeProceedings Paperen_US
dc.identifier.journalICC 2005: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5en_US
dc.citation.spage850en_US
dc.citation.epage854en_US
dc.contributor.department電信工程研究所zh_TW
dc.contributor.departmentInstitute of Communications Engineeringen_US
dc.identifier.wosnumberWOS:000231726401024-
顯示於類別:會議論文