00000cab a22000003a 4500 UP-99796217608682466 Buklod 20231007234632.0 m |o d | ta 090130s xx d | ||r ||||| || (iLib)UPD-00073797124 DENGII eng Gupta, Pankaj Packet classification on multiple fields. pp. 147-160 Routers classify packets to determine which flow they belong to, and to decide what service they should receive. Classification may, in general, be based on an arbitrary number of fields in the packet header. Performing classification quickly on an arbitrary number of fields is known to be difficult, and has poor worst-case performance. In this paper, we consider a number of classifiers taken from real networks. We find that the classifiers contain considerable structure and redundancy that can be exploited by the classification algorithm. In particular, we find that a simple multi-stage classification algorithm, called RFC (recursive flow classification), can classify 30 million packets per second in pipelined hardware, or one million packets per second in software. Computer systems organization. Computer communication networks. Network architecture and design. Packet switching networks. Internetworking. Routers. Computing methodologies. Pattern recognition. Design methodology. Classifer design and evaluation. Algorithms. Design. Measurement. Perfformance. Theory. Computer communication review. 29, 4 (1999). FO UPD DENG-II Article