With the fast development of network technology, packetclassification becomes more and more important in the new network applications. However, the packetclassification has many technical difficulties, such as multi...
详细信息
In this paper, we discuss about the classification of DDOS, which are widely regarded as a major threat to the Internet. Nature of DDoS attack is difficult to defend against and will continue to be an attractive and e...
详细信息
ISBN:
(纸本)9783319232041;9783319232034
In this paper, we discuss about the classification of DDOS, which are widely regarded as a major threat to the Internet. Nature of DDoS attack is difficult to defend against and will continue to be an attractive and effective form of attack. Though many solutions have been proposed, the problem has not been solved yet. The defense approaches can be classified as protection, detection and prevention. Therefore, for information security, it is needed to create own DDoS defense system to solve the DDoS attack problems. The aim of the research work is to protect Distributed Denial of Service attacks.
作者：
王志恒刘刚白英彩Department of Computer Science & Engineering
Shanghai Jiaotong University Shanghai 200030 Department of Computer Science & Engineering
Donghua University Shanghai 200051 Department of Computer Science & Engineering
Shanghai Jiaotong University Shanghai 200030acket classification (PC) has become the main method to support the quality of service and security of network application. And two-dimeusioual prefix packet classification (PPC) is the popular one. This paper analyzes the problem of ruler conflict and then presents a TCAM-based two-dimensional PPC algorithm. This algorithm makes use of the parallelism of TCAM to lookup the longest prefix in one instruction cycle. Then it uses a memory image and associated data structures to eliminate the conflicts between rulers and performs a fast two-dimeusional PPC. Compared with other algorithms this algorithm has the least time complexity and less space complexity.
packetclassification (PC) has become the main method to support the quality of service and security of network application. And two-dimeusioual prefix packetclassification (PPC) is the popular one. This paper analyz...
详细信息
packetclassification (PC) has become the main method to support the quality of service and security of network application. And two-dimeusioual prefix packetclassification (PPC) is the popular one. This paper analyzes the problem of ruler conflict, and then presents a TCAM-based two-dimensional PPC algorithm. This algorithm makes use of the parallelism of TCAM to lookup the longest prefix in one instruction cycle. Then it uses a memory image and associated data structures to eliminate the conflicts between rulers, and performs a fast two-dimeusional PPC. Compared with other algorithms, this algorithm has the least time complexity and less space complexity.
暂无评论