文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > 高等教育 > 工学 > Packet track and traceback mechanism against denial of service attacks
侵权投诉

Packet track and traceback mechanism against denial of service attacks

M_BIT = number of bits each router marks mark_bit[l] = marking assigned to link l*/mark(ptmark) {

/* select the link from which the packet came */ prehop = Get_prehop(); /* insert the marking*/ ptmark = mark_bit[prehop]||(ptmark<<M_BIT); }

We can learn that the shift operation ‘<<’ makes sure that the current marking is always on the first marking-bit-pattern from right, and the first marking-bit-pattern from left is always the one to be dropped. Unlike the Pi scheme that uses the TTL value in the packet as an index, in our scheme, the markings are arranged in order from right to left. Therefore, we are able to compute sub-path identifiers because it is easy to locate each router’s marking. Same to the Pi scheme, there is collision problem in our scheme, but we do not depend on path identifiers wholly to defend against DoS attacks. With the path-tree discussed in next subsection, the victim can map the path identifier into several possible paths and make further distinction with detailed path information. 3.3 Path-tree designing algorithm

Collisions happen among path identifiers mainly because the path information is overly compressed. For the destination to get more path information, we introduce ICMP traceback message designed in iTrace method into our scheme. ICMP traceback message is a router-generated message containing an authenticated copy of a packet and router’s own IP address as well as the IP of the previous and next hop routers. In iTrace scheme, the router probabilistically generates an ICMP traceback message for the passing packet and forwards it either to the source or destination address. The destination or source collects traceback messages and redesigns the packet’s traversing path. We observe that there may have relations among different paths such as inclusion and convergence. For example, one path may be completely contained by another path; two paths may convergence at one node. In our scheme, we consider using path-tree to store path information. The structure of path-tree is defined in Sect. 1, which is an intuitive way of representing relations among different paths. At the very beginning, the path-tree only has the root, then the destination redesigns a new path and inserts it into the current path-tree. There are three cases as follows:

Case 1 If the new path is contained by an existing path, then no change should be made in the current path-tree.

Case 2 If the new path joins an existing path at one node, then we add a sub-path to this node. The sub-path is from the source of the new path to the joint node.

Case 3 If it is not the above two cases, we add the new

path directly to the root.

Following shows the path-tree design algorithm provided in pseudo C code.

/* root = a pointer pointed to path-tree’s root

path[n] = new path, an array of nodes, path[0] is the router closest to the destination */ struct path-tree {

struct path-tree *prev, *next; NODE node; };

path-tree_formation (path[K], root) {

for(intk = 0; k < K;k++) {

if (width_first_search (path[k],k)==NULL) { if (k==0)

append path to root; else {

subpath = get_subpath (path, k);append subpath to node path[k];}// if(k==0)break;

}//if (width… }//for}

The width_first_search function performs a breadth-first search at the appointed layer in the tree. The get_subpath function returns the sub-path from the source to the pointed node. The path-tree could be seen as a pre-generated ‘map’ of Internet topology with the destination as the center. Similar to iTrace method, traceback messages might incur significant overhead on network routers and cripple network performance sharply, so it must be generated with low probability, with the suggested value in iTrace as 2 000 [8]. Presumably, reducing the probability requires more packets to redesign the path, which amounts to more convergence time. In our scheme, the path-tree is designed in peace time, insensitive to convergence time. In next subsection, we discuss how to use path identifier and path-tree to defend against DoS attacks. 3.4 Defending against DoS attacks

There are generally three lines to defend against the DoS attack [9]: attack prevention and pre-emption, attack detection and filtering, and attack source traceback and identification. Our scheme mainly focuses on the third line of defense and is helpful to attack detection and filtering.

When a DoS attack is detected, the victim extracts the path identifier from the attack packet. The traceback process is as follows:

1) Search the path identifier within the path-tree. If a matching node is found, the process is ended. If there’s no

上一页第5页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email