High-Speed Policy-based Packet Forwarding Using Efficient Multi-dimensional Range Matching (1998)
Cached
Download Links
- [www.dmi.ens.fr]
- [www.cs.rice.edu]
- [www.cs.rice.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In ACM SIGCOMM |
| Citations: | 117 - 0 self |
BibTeX
@INPROCEEDINGS{Lakshman98high-speedpolicy-based,
author = {T. V. Lakshman and Dimitrios Stiliadis},
title = {High-Speed Policy-based Packet Forwarding Using Efficient Multi-dimensional Range Matching},
booktitle = {In ACM SIGCOMM},
year = {1998},
pages = {203--214}
}
Years of Citing Articles
OpenURL
Abstract
The ability to provide differentiated services to users with widely varying requirements is becoming increasingly important, and Internet Service Providers would like to provide these differentiated services using the same shared network infrastructure. The key mechanism, that enables differentiation in a connectionless network, is the packet classification function that parses the headers of the packets, and after determining their context, classifies them based on administrative policies or real-time reservation decisions. Packet classification, however, is a complex operation that can become the bottleneck in routers that try to support gigabit link capacities. Hence, many proposals for differentiated services only require classification at lower speed edge routers and also avoid classification based on multiple fields in the packet header even if it might be advantageous to service providers. In this paper, we present new packet classification schemes that, with a worst-case and tr...







