Sciweavers

Share
CN
2006

Packet classification using diagonal-based tuple space search

10 years 11 months ago
Packet classification using diagonal-based tuple space search
Multidimensional packet classification has attracted considerable research interests in the past few years due to the increasing demand on policy based packet forwarding and security services. These network services typically involve determining the action to take on packets according to a set of rules. As the number of rules increases, time for determining the best matched rule for an incoming IP packet will increase and subsequently incur long processing delay. To address this issue, in this paper we propose a two-dimensional packet classification algorithm which focuses on reducing time for classification while keeping reasonable memory requirement in practice. Our approach extends the tuple space framework and then allows performing binary search on the tuple space. To our knowledge, the proposed scheme is the first binary search scheme on two-dimensional tuples. With the proposed scheme, given a filter set with n two-dimensional filters, it requires only O(log(w)) hash operations...
Fu-Yuan Lee, Shiuh-Pyng Shieh
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CN
Authors Fu-Yuan Lee, Shiuh-Pyng Shieh
Comments (0)
books