ACM Home Page
Please provide us with feedback. Feedback
Tracers placement for IP traceback against DDoS attacks
Full text PdfPdf (141 KB)
Source International Conference On Communications And Mobile Computing archive
Proceedings of the 2006 international conference on Wireless communications and mobile computing table of contents
Vancouver, British Columbia, Canada
SESSION: T1-B: computer and network security symposium table of contents
Pages: 355 - 360  
Year of Publication: 2006
ISBN:1-59593-306-9
Authors
Chun-Hsin Wang  Chung Hua University, Hsin Chu, Taiwan, R.O.C.
Chang-Wu Yu  Chung Hua University, Hsin Chu, Taiwan, R.O.C.
Chiu-Kuo Liang  Chung Hua University, Hsin Chu, Taiwan, R.O.C.
Kun-Min Yu  Chung Hua University, Hsin Chu, Taiwan, R.O.C.
Wen Ouyang  Chung Hua University, Hsin Chu, Taiwan, R.O.C.
Ching-Hsien Hsu  Chung Hua University, Hsin Chu, Taiwan, R.O.C.
Yu-Guang Chen  Chung Hua University, Hsin Chu, Taiwan, R.O.C.
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 56,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1143549.1143620
What is a DOI?

ABSTRACT

This paper explores the tracers deployment problem for IP traceback methods how many and where the tracers should be deployed in the network to be effective for locating the attack origins. The minimizing the number of tracers deployment problems depended on locating the attack origins are defined. The problem is proved to be NP-complete. A heuristic method which can guarantee that the distance between any attack origin and its first met tracer be within an assigned distance is proposed. The upper bound for the probability of an undetected attack node can be calculated in advance and used to evaluate the number of tracers needed for the proposed heuristic method. Extended simulations are performed to study the performance of the tracers deployment.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Rocky K. C. Chang, "Defending against Flooding-Based Distributed Denial-od-Service Attacks: A Tutorial," IEEE Communicatin Magazine, Oct. 2002, pp.42--51.
 
3
A. Belenky and N. Ansari, "On IP Traceback," IEEE Communicatin Magazine, July 2003, pp.142--153.
 
4
 
5
D. X. Song and A. Perring, "Advanced and Authenticated Marking Schemes for IP Traceback," Proc. INFOCOM, 2001, vol. 2, pp. 878--86.
 
6
A. Yaar, A. Perrig, and D. Song, "FIT: Fast Internet Traceback," Proc. INFOCOM, 2005, pp.1395--1406.
 
7
S. M. Bellovin, "ICMP Traceback Messages," IETF draft, 2000; http://www.research.att.com/smb/papers/draft-bellovin-itrace-00.txt.
 
8
 
9
 
10
H. Y. Chang et al., "Deciduous: Decentralized Source Identification for Network-Based Intrusion," Proc. 6th IFIP/IEEE Int'l, Symp. Integrated Net. Mgmt., 1999.
 
11
S. Kent and R. Atkinson. Security Architecture for the Internet Protocol. RFC 2401, November 1998.
 
12
 
13
R. Stone, "Centertrack: An IP Overlay Network for Tracing DoS Floods," Proc. 9th USENIX Sec. Symp., 2000, pp. 319--27.
 
14
M. R. Garey and D. S. Johnson, Computers and Intractability, San Francisco, CA: Freeman, 1979.
 
15
P. Erdös, "On the graph-theorem of Turán," Math. Lapok, vol. 21, pp. 249--251, 1970
 
16
 
17
 
18
B. M. Waxman, "Routing of Multipoint Connections," IEEE Journal on Selected Areas in Communications, vol. 6, no. 9, December 1988.


Collaborative Colleagues:
Chun-Hsin Wang: colleagues
Chang-Wu Yu: colleagues
Chiu-Kuo Liang: colleagues
Kun-Min Yu: colleagues
Wen Ouyang: colleagues
Ching-Hsien Hsu: colleagues
Yu-Guang Chen: colleagues