Loading...
Please wait, while we are loading the content...
Similar Documents
Fast and Scalable Layer Four Switching (1998)
| Content Provider | CiteSeerX |
|---|---|
| Author | Waldvogel, Marcel Srinivasan, V. Varghese, George Suri, Subhash |
| Abstract | In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header fields of the packet such as source address, TCP and UDP port numbers. Layer Four switching unifies firewall processing, RSVP style resource reservation filters, QoS Routing, and normal unicast and multicast forwarding into a single framework. In this framework, the forwarding database of a router consists of a potentially large number of filters on key header fields. A given packet header can match multiple filters, so each filter is given a cost, and the packet is forwarded using the least cost matching filter. In this paper, we describe two new algorithms for solving the least cost matching filter problem at high speeds. Our first algorithm is based on a grid-of-tries construction and works optimally for processing filters consisting of two prefix fields (such as destination-source filters) using linear space. Our second algorithm, cross-productin... |
| File Format | |
| Publisher Date | 1998-01-01 |
| Access Restriction | Open |
| Subject Keyword | Rsvp Style Resource Reservation Filter Layer Four Switching Destination Address New Algorithm Single Framework Destination-source Filter Udp Port Number Qos Routing Cost Matching Filter Linear Space Normal Unicast Unifies Firewall Processing Header Field Multicast Forwarding Prefix Field Packet Header Key Header Field Cost Matching Filter Problem Second Algorithm Grid-of-tries Construction First Algorithm High Speed Source Address Multiple Filter Scalable Layer |
| Content Type | Text |
