標題: | Ordered lookup with bypass matching for scalable per-flow classification in layer 4 routers |
作者: | Lin, YD Wei, HY Wu, KJ 資訊工程學系 Department of Computer Science |
關鍵字: | classification;layer 4 router;packet filtering;lookup;match;scalability |
公開日期: | 1-四月-2001 |
摘要: | In order to provide different service treatments to individual or aggregated hows, layer 4 routers in Integrated Services networks need to classify packets into different queues. The classification module of layer 4 routers must be fast enough to support gigabit links at a rate of millions of packets per second. In this work, we present a new software method OLBM to lookup multiple fields of a packet, in a dynamically pre-defined order, against the classification database. This algorithm also uses a technique called bypass matching and can classify packets at a rate of well over one million packets per second while scaling to support more than 300k flows. Complexity analysis and experiment measurements are also presented in this study. (C) 2001 Elsevier Science B.V. All rights reserved. |
URI: | http://dx.doi.org/10.1016/S0140-3664(00)00305-4 http://hdl.handle.net/11536/29751 |
ISSN: | 0140-3664 |
DOI: | 10.1016/S0140-3664(00)00305-4 |
期刊: | COMPUTER COMMUNICATIONS |
Volume: | 24 |
Issue: | 7-8 |
起始頁: | 667 |
結束頁: | 676 |
顯示於類別: | 期刊論文 |