Multiplex communications – Pathfinding or routing
Reexamination Certificate
2000-04-05
2004-03-02
Chin, Wellington (Department: 2664)
Multiplex communications
Pathfinding or routing
C709S238000
Reexamination Certificate
active
06700883
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention generally relates to routing of packets in a computer network and, more particularly, to a controllable mechanism for by-passing Layer 4 (L4) classification.
2. Background Description
The problem of the design of computer networks is partitioned into smaller subtasks, by dividing the problem into layers. The OSI (Open Systems Interconnection) reference model defines seven layers. This invention is primarily concerned with the protocols of Layer 3, the network layer, and Layer 4, the transport layer. Each layer communicates with its peer layer in another node in the network through the use of a protocol. A multicast address is intended to be destined to a group of nodes, as opposed to a unicast address which is destined for a single node in the network.
The general purpose of packet classification in a switch, is to classify (or identify) packets arriving from a network interface. Actions can be associated with classification rules so that the actions can be applied to matching packets. Furthermore, it is the intention of this design to support this level of packet classification, and to apply the associated actions to the packets at “wire speed”.
The Classifier Tree itself is at the core of the Classifier. The tree contains packet-handling rules. Each rule defines what to do with a packet (action) when it matches the criteria specified in the rule (description). Only certain bits (or fields) in a packet are of interest to an individual tree which is inherent to the tree definition. (Individual trees, of course, may be interested in different fields.) Both the tree creator and searcher must agree on which fields define the rules in any given tree. The creator and searcher may execute on different processors, but there must be agreement between the two on how the tree is defined.
Rules are added to the tree by applications. Applications typically (but not always) are tasked with performing one type of action on packets. As long as different applications (e.g., Network Dispatcher, Layer 3 (L3) filtering, Quality of Service (QoS)) are interested in the same packet fields, they can contribute rules to the same trees. In other words, multiple action types are supported in the same tree as long as the contributors agree on what fields in the packet are of interest. Multiple Classifier trees may be supported on the same system. Applications may decide more than one Classifier tree is needed because (for example):
Applications are interested in different fields. It may not be practical for IP (Internet Protocol) and IPX (Internet Packet Exchange) filter rules to share the same table.
Search applications may be interested in only a subset of rules at a particular time. Perhaps one set of actions is relevant to packets as they are received and yet another set of actions is relevant when transmitting packets. Received actions could be placed in one tree, and transmit actions could be placed in another tree.
Normal processing flow, which includes Layer 4 (L4) classification, is slow, especially if the classifier is a Software Managed Tree (SMT) or includes an SMT component.
SUMMARY OF THE INVENTION
It is therefore an object of the present invention to provide a controllable mechanism for by-passing Layer 4 (L4) classification.
According to a first embodiment of the invention, there is provided a method of routing a data packet which based on the insertion into a set of Layer 3 (L3) rules in an L3 lookup tree set of Layer 4 (L4) Classification Required Flags. The state of the L4 classification flag is set by comparing the L4 classification rule to an IP (Internet Protocol) lookup rule. Routing is accomplished by selecting which rule to apply to the data packet and reading the state of the corresponding L4 Classification Required Flag. In response to a first state of the corresponding L4 Classification Required Flag, an L4 classification is performed followed by a routing of the data packet. In response to a second state of the corresponding L4 Classification Required Flag performing a routing of said data packet.
According to a second embodiment of the invention, the method inserts into a set of L3 rules in L3 lookup means a set of L4 Classification Required Flags, and a Global Flag is inserted into memory. A first state of the L4 Classification Required Flag is set when a new rule is added to L4 classification means, the new rule being correlatable to a single entry in L3 lookup means. Routing is accomplished by selecting which rule to apply to the data packet and reading the state of the corresponding L4 classification required flag. In response to a first state of the corresponding L4 classification flag, a L4 classification is performed followed by a routing of the data packet. In response to a second state of the corresponding L4 classification flag, the state of the Global Flag is read, and in response to a first state of the Global flag, a L4 classification is performed followed by a routing of the data packet. In response to a second state of the Global Flag, the data packet is routed.
REFERENCES:
patent: 6343326 (2002-01-01), Acharya et al.
patent: 6549521 (2003-04-01), Edwards et al.
patent: 6600744 (2003-07-01), Carr et al.
Gallo Anthony Matteo
Gorti Brahmanand Kumar
Jones Donald Newland
Vaidhyanathan Natarajan
Verrilli Colin Beaton
Chin Wellington
International Business Machines - Corporation
Schultz William
Whitham C. Lamont
LandOfFree
Algorithm to bypass L4 processing in an internet protocol... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Algorithm to bypass L4 processing in an internet protocol..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithm to bypass L4 processing in an internet protocol... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3280974