Title :
A marking scheme using Huffman codes for IP traceback
Author :
Choi, K.H. ; Dai, H.K.
Author_Institution :
Dept. of Comput. Sci., Oklahoma State Univ., Stillwater, OK, USA
Abstract :
In (distributed) denial of service attack ((D)DoS), attackers send a huge number of packets with spoofed source addresses to disguise themselves toward a target host or network Various IP traceback techniques such as link testing, marking, and logging to find out the real source of attacking packets have been proposed. We present a marking scheme (with marking and traceback algorithms) in which a router marks a packet with a link that the packet came through. Links of a router are represented by Huffman codes according to the traffic distribution among the links. If the packet runs out of space allotted for the marking field in the packet header, then the router stores the marking field in the router´s local memory along with a message digest of the packet. We analyze the memory requirement of routers to store marking fields, compare the scheme with other existing techniques, and address practical issues to deploy the scheme in the Internet. The scheme marks every packet, therefore IP traceback can be accomplished with only a packet unlike in probabilistic markings; also it requires far less amount of memory compared to logging methods and is robust in case of DDoS.
Keywords :
Huffman codes; Internet; security of data; telecommunication security; Huffman codes; IP traceback; Internet; distributed denial-of-service attacks; link testing; marking scheme; probabilistic markings; Computer crime; Computer science; Encoding; Information filtering; Information filters; Network interfaces; Protocols; Robustness; Testing; Web and internet services;
Conference_Titel :
Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on
Print_ISBN :
0-7695-2135-5
DOI :
10.1109/ISPAN.2004.1300516