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

Packet track and traceback mechanism against denial of service attacks

different paths which could reduce the accuracy. The other one is that path identifiers provide little information besides the indication to distinguish different paths, which confines its application range. We observe that there is no single approach that can defend against (D) DoS attacks effectively by itself; there should be a combination among various schemes with different merits.

Pi is a tracking technique in nature, which is powerful in mitigating the impact of DoS attacks but unable to locate the origin of the attack, which is the motivation of IP traceback technique. In this article, we explore how to incorporate Pi with the IP traceback technique–iTrace [8], with the objective to integrate their merits and compromise their weaknesses. We propose a packet track and traceback (PTT) mechanism. The process is that: routers apply Pi’s marking scheme to mark passing packets, and they also send ICMP traceback messages, which is designed in iTrace method. In peace time, the destination host collects path identifiers carried in packets and traceback messages sent by routers to design a path-tree that reflects the network topology with itself as the center. In the times when there is an attack, besides filtering attack packets at home, the victim can traceback to their origins within the path-tree and take measures to filter packets upstream.

In our scheme, ICMP traceback messages provide detailed path information, allowing destinations to map path identifiers into full paths, which enables traceback operations. Designing the path-tree to store path information is effective and allows traceback operations to be carried out locally instead of going through the network. Furthermore, unlike the schemes, such as iTrace, which are only invoked during times under attack, the path-tree in our scheme is designed in peace time, which is insensitive to convergence time. Performing traceback locally is more efficient than performing it all over the network. Moreover, stresses that holding topology information is helpful in defending against DDoS attack [4]. The path-tree could be regarded as a pre-generated ‘map’ of network topology and also reflects the communication pattern of the host to some extent. In a DDoS attack, in order to develop rapidly responsive packet filters to protect it, the victim can drop packets that are not originated within the path-tree. In this way, some normal traffic could be retained before attackers are located or upstream nodes take measures for it. Some concepts used in packet track and traceback mechanism such as marking-bit-pattern and path-tree are defined as follows:

Definition 1 Marking-bit-pattern. Divide the marking field in the packet into some number, n, of smaller nonoverlapping fragments, where each fragment is a marking-bit-pattern as shown in Fig. 1. If the total length of the marking field is m b, then the length of a marking-bit-pattern is m/n b. Upon

forwarding a packet, the router creates a marking and inserts it into one marking-bit-pattern. At the destination, the value of

Packet track and traceback mechanism against denial of service attacks

Packet track and traceback mechanism against denial of service attacks

the marking field is taken as the path identifier.

Fig. 1 Relation of path identifier and marking-bit-pattern

Definition 2 Path-tree. It is a tree structure as seen in Fig. 2, with D as the root, Sxs as leaves, and Rys as internal nodes.D could either be a single host or a device representing many hosts. Nodes Rys represent the routers and leaves Sxsrepresent the origins of packets destined to the root. A leaf Sxcould either be a single host or a bunch of hosts under the same router. A path from Sx is the ordered list of routers betweenSx and D that the packets have traversed, for example, the path from S1 to D is <R6,R3,R1

Packet track and traceback mechanism against denial of service attacks

Packet track and traceback mechanism against denial of service attacks

Packet track and traceback mechanism against denial of service attacks

>.

Fig. 2 An example of the path tree

The rest of this article is structured in the following way. In the next section we analyze Pi’s packet marking scheme. Section 3 outlines our scheme and characterizes the algorithms for implementing it. In Sect. 4 we present the simulation experiments showing the scheme’s validity under a DoS attack and conclude the article in Sect. 5.

2 Analysis of Pi’s packet marking algorithm

In Pi’s marking scheme, the 16-bit IP identification field is used to hold the marking, which is the same as in our scheme. In Pi, for each passing packet, the router uses the TTL value as the index to insert the marking into the IP identification field. The marking is computed by the router using a Hash function whose input is the IP address of the last-hop router in the path and its own IP address. Clearly, the packet marking is deterministic–all packets traversing the same path carry the same marking. But it can not guarantee that the path identifier is globally unique, that is to say, different paths may have the same identifier, because each router only has local knowledge of a particular path and the space of the marking field is limited. The collision problem of path identifiers may lead to some problems in defending against (D) DoS attacks. Among

上一页第2页

你可能喜欢

热门文档

相关文档

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