High-speed policy-based packet forwarding using efficient multi-dimensional range matching

@inproceedings{Lakshman1998HighspeedPP,
  title={High-speed policy-based packet forwarding using efficient multi-dimensional range matching},
  author={T. V. Lakshman and Dimitrios Stiliadis},
  booktitle={SIGCOMM '98},
  year={1998}
}
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… Expand
Efficient multi-field packet classification for QoS purposes
TLDR
It is concluded that multi-field classification is feasible in software and that high-performance classifiers can run on low-cost hardware. Expand
Novel Efficient And Scalable Packet Classification
TLDR
By revisiting the traditional techniques for 5-tuple packet classification, several optimization techniques for the decision tree based algorithm are proposed and the designing of the mapping is done in such a way that the high throughput is sustained along with maximum utilization of memory. Expand
Fast packet classification for two-dimensional conflict-free filters
TLDR
This paper shows that for two-dimensional conflict-free filters, a binary search scheme does work! and their lookup scheme requires O(log2 w) hashes in the worst case, and uses O(nlog 2 w) memory. Expand
Scalable Packet Classification for Enabling Internet Differentiated Services
TLDR
An enhanced tuple pruning search algorithm called "tuple pruning plus" (TPP) for packet classification, which outperforms the existing schemes on the scalability and a heuristic to further reduce the required storage to about 20 MB is presented. Expand
High-speed packet classification for differentiated services in next-generation networks
TLDR
An improved scheme to reduce the required storage and realize OC-192 wire-speed forwarding and the basic idea is to prevent unnecessary tuple probing by filtering out the "un-matched" situation of the incoming packet. Expand
Fast packet classification for two-dimensional conflict-free filters
  • P. Warkhede, S. Suri, G. Varghese
  • Computer Science
  • Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
TLDR
This paper shows that for two-dimensional conflict-free filters, a binary search scheme does work, and proposes a lookup scheme that performs as good as or better than existing schemes. Expand
Efficient packet classification with digest caches
TLDR
This chapter proposes a novel cache architecture that efficiently and effectively uses memory, given a slightly relaxed accuracy requirement, and can be applied to the design of a novel two-level exact cache, which can take the advantage of hierarchical memory to accelerate exact caching algorithms, with strong results. Expand
Fast Packet Classification Using Multi-Dimensional Encoding
TLDR
The low memory requirement of the proposed scheme means that it not only decreases the cost of packet classification engine, but also increases the classification performance, since memory access represents the performance bottleneck in the packets classification engine implementation using a network processor. Expand
Fast Packet Classification Using Multi-Dimensional Encoding
  • C. Huang, Chien Chen
  • Computer Science
  • 2007 Workshop on High Performance Switching and Routing
  • 2007
TLDR
The low memory requirement of the proposed scheme means that it not only decreases the cost of packet classification engine, but also increases the classification performance, since memory access represents the performance bottleneck in the packets classification engine implementation using a network processor. Expand
Lightweight Traffic-Aware Packet Classification for Continuous Operation
TLDR
This lightweight traffic-aware packet classifier reorganizes its internal data structure (rule tree) based on the traffic pattern to reduce the search time for the most frequently visited rules in the rule-set, resulting in higher throughput without compromising the accuracy. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 51 REFERENCES
Protocol Independent Multicast (PIM), Sparse Mode Protocol Specification
Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those groupExpand
Efficient Packet Demultiplexing for Multiple Endpoints and Large Messages
TLDR
A new packet filter mechanism that efficiently dispatches incoming network packets to one of multiple endpoints, for example address spaces, and provides an associative match function that enables similar but not identical filters to be combined together into a single filter. Expand
Application of sampling methodologies to network traffic characterization
TLDR
A study of the performance of various methods of sampling in answering questions related to wide area network traffic characterization, using a packet trace from a network environment that aggregates traffic from a large number of sources to reveal that the time-triggered techniques did not perform as well as the packet-trIGgered ones. Expand
The BSD Packet Filter: A New Architecture for User-level Packet Capture
TLDR
The BSD Packet Filter (BPF) uses a new, register-based filter evaluator that is up to 20 times faster than the original design, and uses a straighforward buffering strategy that makes its overall performance up to 100 times better than Sun's NIT running on the same hardware. Expand
RSVP: a new resource reservation protocol
TLDR
A resource reservation protocol (RSVP), a flexible and scalable receiver-oriented simplex protocol, that provides receiver-initiated reservations to accommodate heterogeneity among receivers as well as dynamic membership changes and supports a dynamic and robust multipoint-to-multipoint communication model. Expand
RSVP: a new resource ReSerVation Protocol
TLDR
A resource reservation protocol (RSVP), a flexible and scalable receiver-oriented simplex protocol, that provides receiver-initiated reservations to accommodate heterogeneity among receivers as well as dynamic membership changes and supports a dynamic and robust multipoint-to-multipoint communication model. Expand
The packer filter: an efficient mechanism for user-level network code
TLDR
The packet filter is described, a kernel-resident, protocol-independent packet demultiplexer, which performs quite well, and has been in production use for several years. Expand
A Provider Architecture for Differentiated Services and Traffic Engineering (PASTE)
TLDR
This document describes the Provider Architecture for Differentiated Services and Traffic Engineering (PASTE) for Internet Service Providers (ISPs) and the challenges faced in providing differentiated services in ISPs. Expand
Achieving 100% throughput in an input-queued switch
TLDR
This paper proves that if a suitable queueing policy and scheduling algorithm are used then it is possible to achieve 100% throughput for all independent arrival processes. Expand
Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification
This document specifies Protocol Independent Multicast - Sparse Mode (PIM-SM). PIM-SM is a multicast routing protocol that can use the underlying unicast routing information base or a separateExpand
...
1
2
3
4
5
...