US 7,894,451 B2Grant
Method of providing virtual router functionality
Issue Date:2011-02-22
•27 Claims
•6 Drawing Sheets
Abstract
A method of presenting different virtual routers to different end users, classes of service, or packets is provided. An incoming packet is received having a VLAN field and at least one additional field. A key is formed from the VLAN field and at least one other packet field, and mapped into a virtual router identifier (VRID) using an indirection mapping process. The VRID identifies a particular virtual router configuration from a plurality of possible virtual router configurations. A networking device is configured to have the particular virtual router configuration identified by the VRID, and the packet is then forwarded by the configured device.
Metadata
Assignee
- Extreme Networks, Inc.
Inventors
- David K. Parker
- Denton Gentry
Application Information
Application Number:US 11/324,159
Filing Date:2005-12-30
Priority Date:2005-12-30
Art Unit:2465
Classifications
IPC:
H04L12/28H04L12/56
Patent Drawings (6 sheets)
Description
[0001] This application is related to U.S. patent application Ser. No. 11/324,209, entitled “MAC ADDRESS DETECTION DEVICE FOR VIRTUAL ROUTERS,” filed concurrently herewith; U.S. patent application Ser. No. 11/323,998, entitled “METHOD OF PROVIDING VIRUTAL ROUTER FUNCTIONALITY THROUGH ABSTRACTED VIRTUAL IDENTIFIERS,” filed concurrently herewith; and U.S. patent application Ser. No. 11/324,205, entitled “METHOD OF EXTENDING DEFAULT FIXED NUMBER OF PROCESSING CYCLES IN PIPELINED PACKET PROCESSOR ARCHITECTURE,” filed concurrently herewith, each of which is hereby incorporated by reference herein as though set forth in full.
Background of the Invention
[0002] 1. Field of the Invention
[0003] This application relates generally to networking devices, and, specifically, to methods for configuring such devices so that they provide virtual router functionality, i.e., present different virtual router configurations to different end users, classes of service or packets.
[0004] 2. Related Art
[0005] Virtual router functionality refers to the capability of the same physical networking device to present different virtual router configurations to different end users, classes of desired service, or packets. As a result of this capability, the same physical device appears as a plurality of different virtual routers. To implement this capability, current routers directly map a packet field of interest, typically the VLAN field, into the identifier of a particular routing table, and then use the particular routing table to route the packet. The VLAN field designates a virtual LAN, a collection of network elements that may be physically disparate but are logically related such that they may be considered part of the same LAN for OSI layer two routing/switching purposes. For example, all the network elements in a particular VLAN receive broadcasts from any other element in the VLAN at OSI layer two.
[0006] This approach, whereby the VLAN of the incoming packet is directly mapped into an identifier of a routing table, worked fine as long as different end users used non-overlapping VLANs, so that the VLAN could be used to present different virtual routers to different end users. However, as VLAN usage proliferated, different end users began using overlapping sets of VLANs, so the VLAN could no longer be used to present different virtual routers to different end users.
[0007] Another problem is that the number of virtual routers that are possible is limited by the size of the VLAN field. A VLAN of 12 bits, for example, identifies only 4 K different routing tables, which may not be sufficient for certain applications.
[0008] A third problem is the lack of flexibility in this approach. If, for example, the VLAN type or format changes as network usage evolves or as network standards change, the approach would be rendered obsolete as it is tied to a particular VLAN type and format.
[0009] A fourth problem is the lack of scalability of this approach with an increase in the number of virtual routers that may need to be accommodated. With this approach, for example, an increase in the size of the VLAN field to allow for an increase in virtual routers multiplies in direct proportion the number of routing tables that need to be maintained.
Summary
[0010] The invention provides a method of presenting different virtual routers to different end users, classes of service, or packets. The method may be performed in any networking device, and enables the device to provide virtual router functionality.
[0011] The method begins when a packet is received having a VLAN field and at least one additional field. Upon receipt of the packet, a key is formed from the VLAN field and at least one additional packet field, for example, a VMAN field.
[0012] The key is then mapped into a virtual router identifier (VRID) using an indirection mapping process. According to this indirect mapping process, a table having a plurality of entries, each having a content value and an index value, is accessed to locate an entry having a content value that matches the key. The index value of the matching entry is then mapped into the VRID using an associated data store element. The result is a virtual router identifier that identifies a particular virtual router configuration from a plurality of possible virtual router configurations.
[0013] Other systems, methods, features and advantages of the invention will be or will become apparent to one with skill in the art upon examination of the following figures and detailed description. It is intended that all such additional systems, methods, features and advantages be included within this description, be within the scope of the invention, and be protected by the accompanying claims.
Brief Description of the Figures
[0014] The invention can be better understood with reference to the following figures. The components in the figures are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention. Moreover, in the figures, like reference numerals designate corresponding parts throughout the different views.
[0015] FIG. 1 is a block diagram showing the method steps, data structures and logic elements used in producing a virtual router identifier (VRIID) according to one embodiment, characterized in that an indirect mapping process is used to map a key, generated from one or more packet fields, to the VRID.
[0016] FIG. 2 a illustrates an example of a key format, and FIGS. 2 b-2e illustrate various examples of key types wildcarding different ones of the fields making up the key format.
[0017] FIG. 3 is a flowchart illustrating the method steps in one embodiment, characterized in that the networking device is configured responsive to the VRID, and the packet then routed in accordance with the configured device.
[0018] FIG. 4 illustrates a particular switch architecture that embodies or utilizes the claimed method and system.
[0019] FIG. 5 illustrates a plurality of routing tables that may be used to support virtual router functionality.
[0020] FIGS. 6 a, 6b and 6c illustrate examples of alternative data types that may apply depending on the type of VLAN field detected in the ingress packet.
Detailed Description
[0021] Referring to FIG. 1 , a block diagram depicting the steps of a method 100, performed in a networking device, of presenting different virtual router configuration to different end users, classes of service, or packets. Also shown are the data structures used in the performance of the method, and the logic elements that perform the method steps. In this particular embodiment, the method is performed in the device after the packet has been parsed by packet parser 104, thus making available for use by the method certain packet fields successfully parsed by the parser 104, including VLAN 106, VMAN 108, and ingress port 110. The method may be performed in any networking device that is capable of forwarding or classifying packets at OSI layer three or above, including but not necessarily limited to routers, switches, or combination routers/switches. For purposes of this disclosure, a “virtual router” includes both a “lightweight” virtual router, i.e., one that virtually routes at OSI layer three, and a “heavyweight” virtual router, i.e., one that virtually routes at OSI layer three, but in addition implements distinct OSI layer two functions per virtual router. Additionally, for purposes of this disclosure, the singular terms “device” or “router” include plural devices or routers, respectively.
[0022] As previously explained, the VLAN field 106 designates a virtual LAN, a collection of network elements that may be physically disparate but are logically related such that they may be considered part of the same LAN for OSI layer two routing/switching purposes. Presently, the primary usage of the VLAN terminology is to uniquely identify logically related end user equipment within a VMAN (see below).
[0023] The VMAN field 108 designates a virtual metropolitan network, a collection of network elements that may be physically disparate but are logically related such that they may be considered part of the same network. Although the term originally applied only to metropolitan networks, that usage has evolved such that the term is now used to designate any network, metropolitan or non-metropolitan. In fact, as VMAN usage has proliferated, the term is now primarily used by service providers to designate logically related infrastructure equipment. At the same time, as explained above, the VLAN terminology is now primarily used to uniquely identify logically related end user equipment within a VMAN. Significantly, as a VLAN value uniquely identifies a VLAN within a VMAN, the same VLAN value may not be used to refer to different end user equipment within a VMAN.
[0024] The ingress port number 110 is an identifier of the physical port on which the packet was received at the device.
[0025] Returning to FIG. 1 , the object of the method is to determine a virtual router identifier (VRID) 102 responsive to the incoming packet, wherein the virtual router identifier 102 identifies a particular virtual router configuration from a plurality of possible virtual router configurations.
[0026] The method begins when key generation logic 112 forms a key from the VLAN 106, VMAN 108 and ingress port 110 fields. In the particular embodiment illustrated, the key is formed by concatenating these three fields together, although it should be appreciated that other methods of forming the key are possible. Thus, for example, in one embodiment, an incoming packet received over ingress port X, having a VLAN of Y, and a VMAN of Z, has a key 200 formatted as illustrated in FIG. 2 a, with three concatenated fields, the first field 202 holding ingress port X, the second field 204 holding VLAN Y, and the third field 206 holding VMAN Z.
[0027] Concurrently, in one embodiment, the ingress port 110 is input to a lookup table 114 to determine a key type 116. In this embodiment, the key type functions as a mask, by indicating which of the three fields of the key are to be wildcarded, i.e., ignored in the subsequent processing, and which are to be used. In this particular embodiment, each of the three fields can be independently wild-carded or not. Thus, for example, FIG. 2 b illustrates a key type in which the ingress port and VMAN fields are wildcarded (designated by the X appearing in the corresponding fields), and only the VLAN field used in the subsequent processing. Similarly, FIG. 2 c illustrates a key type in which the ingress port field is wildcarded, and the VLAN and VMAN fields are used in the subsequent processing. FIG. 2 d illustrates a key in which the VLAN field is wildcarded, and the ingress port and VMAN fields are used in the subsequent processing. FIG. 2 e illustrates a key in which the VMAN field is wildcarded, and the ingress port and VLAN fields are used in the subsequent processing.
[0028] In the embodiment illustrated in FIG. 1 , the key type 116 is determined responsive to the ingress port field 110, which forms the input to lookup table 114. The table 114 has a plurality of entries each having an index value and a content value that specifies a particular key type, for example, such as illustrated in FIGS. 2 b-2e. A lookup occurs by mapping the ingress port field 110 into a particular index, looking up the entry having that index, and setting the key type to the content value of that entry. In other embodiments, the key type may be determined responsive to other packet fields and more than one packet field.
[0029] FIG. 6 a illustrates an implementation where the key type is a 3 bit field, identified with numeral 602, that is appended to the key, and indicates both the format of the key and which fields of the key are to be wildcarded. For example, the key type for key 604 indicates both that the key is 9 bits, and that the VLAN and VMAN fields are to be wildcarded; the key type for key 606 indicates both that the key is 15 bits, and that the ingress port and VMAN fields are to be wildcarded; the key type for key 608 indicates both that the key is 15 bits, and that the ingress port and VLAN fields are to be wildcarded; the key type for key 610 indicates both that the key is 21 bits, and that the VMAN field is to be wildcarded; the key type for key 612 indicates both that the key is 27 bits, and that the ingress port field is to be wildcarded; and the key type for key 614 indicates that the key is 33 bits, and that none of the fields are to be wildcarded.
[0030] Moreover, as will be discussed in greater detail below, in the case where a ternary CAM is used to perform the indirection mapping process, whereby the key is indirectly mapped into a virtual router identifier, just discussed key type generation and key masking processes are unnecessary as individual fields in the content values corresponding to the ternary CAM entries can be wildcarded, i.e., set as don't care values. In the case where a binary CAM is used to perform the indirection mapping process, the just discussed key type generation and key masking processes should generally be retained.
[0031] Referring again to FIG. 1 , the key 118, masked or unmasked as the case may be, is then mapped into the virtual router identifier 102 using a two-step indirection mapping process performed by logic 126. In the first step, as illustrated, a table 120 is accessed, the table having a plurality of entries 120a, 120b, 120c, each having a content value and an index value, and locating an entry having a content value that matches the key. In FIG. 1 , the content value of entry 120b is shown as matching the key 118. The index value of the matching entry, identified with numeral 122, forms an input to the second step of the process.
[0032] In the second step, the index value 122 of the matching entry 120b is mapped into the virtual router identifier 102 using an associated data store element 124. The associated data store element 124 has a plurality of entries 124a, 124b, each having an index value and a content value. In one embodiment, the mapping is performed by selecting the entry in the associated data store element 124 whose index value matches the index value 122 for the matching entry in the table 120. In the particular example illustrated in FIG. 1 , entry 124b satisfies this condition. The content value of this entry is or contains the virtual router identifier 102.
[0033] In one implementation, the table 120 is stored on a CAM, and the first step of the two-step process occurs by having the CAM search for and locate the entry 120b whose content value matches the key 118. In the case where the CAM is a binary CAM, i.e., a CAM where each bit in the content value of an entry can only take on the binary values “0” and “1,” the previously described key type generation and masking processes should generally be performed as these functions are not available through the CAM. However, in the case where the CAM is a ternary CAM, i.e., a CAM where each bit in the content value of an entry can take on the binary values “0” and “1,” but also a “don't care” value, the previously described key type generation and masking processes are optional as these functions may be performed through suitable settings of the content values of the CAM entries.
[0034] In a second implementation, the table 120 is stored in RAM, and the first step of the two-step process occurs by applying a hash function to the key 118 to determine a table index for a starting entry, and then searching the table 120, beginning with the starting entry, to locate the entry 120b whose content value matches the key 118.
[0035] Logic 128 configures the device in accordance with the VRID 102, and the configured device then forwards the packet. In one embodiment, as will be discussed in more detail later, logic 128 selects or generates a CAM searching key responsive to the VRID 102. The CAM searching key is used in making a classification and forwarding decision for the packet. By setting the key that is used throughout the classification and forwarding process responsive to the VRID 102, the logic 128 in effect selects the routing table that is used to route the packet.
[0036] The foregoing embodiment overcomes the problems identified at the outset with the conventional approach for providing virtual router functionality. First, since a key can be formed from a combination of a VLAN and VMAN field, and a VLAN is a unique identifier within a particular VMAN, the embodiment allows the VLAN to be used once again for virtual routing purposes.
[0037] Second, the embodiment dramatically increases the number of virtual routers that are possible. In the case, for example, where the table 120 is stored on a CAM, the number of virtual routers that can be presented is limited only by the size of the CAM. No longer does the size of the VLAN field limit the number of virtual routers than can be supported.
[0038] Third, the embodiment is flexible and easily accommodates changes in network usage or standards. Consider, for example, the recent addition of a super-wide (24 bit) VLAN field, i.e., the ESID field, to the list of permissible Ethertypes. That is handled simply by defining a new key type in the lookup table 114. For example, while the normal data type might have the format illustrated in FIG. 6 b, i.e., 12 bits for each of the VLAN, and VMAN fields, and 6 bits for the ingress port field, when a super-wide VLAN (ESID) is detected, the data type 116 might have the format illustrated in FIG. 6 c, i.e., a 6 bit ingress port field followed by a 24 bit ESID field. Upon encountering the key type of FIG. 6 c, logic 112 in FIG. 1 would format the key as indicated in this figure responsive to the fields 106, 108 and 110 from the packet parser, i.e., it would assume the VLAN field 106 is a 24 bit ESID field.
[0039] Fourth, the embodiment is scaleable as an increase in the number of possible virtual routers would not necessarily require a commensurate increase in the number of routing tables that are maintained. Instead, many different key values could be mapped into the same VRID through appropriate settings of the index values associated with the entries 120a, 120b, 120c in the table 120. For example, in FIG. 1 , if it were desired that the index values for entries 120b and 120c map into the same VRID, the index values for the entries 120b and 120c would be set to the same value.
[0040] FIG. 3 summarizes the steps that are performed in one embodiment of the overall method. Step 302 comprises the key generation step performed by the logic 112 in FIG. 1 . Step 304 comprises the optional key type generation and masking processes performed by the logic 112 in FIG. 1 , with the key type determined through an access to lookup table 112. For purposes of this disclosure, the term “logic” refers to implementations in hardware, software, or combinations of hardware and software.
[0041] Step 306 comprises the two-step indirection mapping process, wherein the first step involves searching or having performed a search through table 120, which may or may not be stored on a CAM, to find the entry 120b whose content value matches the key 118, and the second step involves locating the entry 124b in the associated data store 124, typically a RAM, whose index value matches the index value 122 of the matching entry in the table 120. Step 308 comprises outputting the virtual router identifier (VRID) 102. In FIG. 1 , this step involves outputting the content value, or a designated field in the content value, of the entry 124b whose index value matches the index value 122 of the matching entry in the table 120.
[0042] Steps 306 and 308 are performed by logic 126 (illustrated in FIG. 1 ) through suitable accesses to table 120 and associated data element 124, as indicated by the dotted arrows between these elements.
[0043] Step 310 comprises configuring the device to have the particular configuration identified by the virtual router identifier. In one embodiment, this step is performed by logic 128 (illustrated in FIG. 1 ) when it selects or generates the CAM searching key that is used in making a classification and forwarding decision for the packet. By setting the key that is used throughput the classification and forwarding process, the logic 128 in effect selects a routing table from a plurality of routing tables for use in routing the packet. Conceptually, the process is as illustrated in FIG. 5 , which shows selecting a routing table, for example, table 504, from a plurality of possible routing tables 502, 504, 506 responsive to the VRID, and preparing to forward the packet of interest using the selected routing table.
[0044] Referring back to FIG. 3 , step 312 comprises forwarding the packet in accordance with the configured device. In one embodiment, this step is performed by a packet processor in the device. For purposes of this disclosure, the term “processor” refers to any device capable of executing one or more commands, instructions or state transitions, and includes, without limitation, a general- or special-purpose microprocessor, finite state machine, controller, computer, digital signal processor (DSP), or the like.
[0045] FIG. 4 illustrates an embodiment 400 of a particular router architecture in which the aforementioned method may operate. In this embodiment, as shown, the router is structured as a packet processing system comprising a packet classification/forwarding system 402 and a packet modification system 404. The packet classification/forwarding system 402 has an ingress portion 406 and an egress portion 408 through which ingress (network-side) packets may respectively enter and exit the packet classification/forwarding system 402. Similarly, the packet modification system 404 has an ingress portion 410 and an egress portion 412 through which egress (switch-side) packets may respectively enter and exit the packet modification system 404.
[0046] The ingress portion 406 of the packet classification/forwarding system 402 is coupled, through interface 418, to one or more network-side devices 414, and the egress portion 408 of the packet classification/forwarding system 402 is coupled, through interface 420, to one or more switch-side devices 416. Similarly, the ingress portion 410 of the packet modification system 404 is coupled, through interface 422, to the one or more switch-side devices 416, and the egress portion 412 of the packet modification system 404 is coupled, through interface 423, to the one or more network-side devices 414.
[0047] In addition to the ingress and egress portions 406, 408, the packet classification system 402 further comprises a first packet parser 104 (the same packet parser 104 illustrated in FIG. 1 ), and a packet processor 428.
[0048] Parser 104 is configured to parse an ingress packet and provide context pointers to the beginning of the packet layers, for example, pointers to the beginning of OSI layers 2, 3, and 4.
[0049] Packet processor 428 is configured to classify and forward the packet, responsive to the context pointer provided by parser 104.
[0050] Content Addressable Memory (CAM) 442 is used by the packet classification/forwarding system 402 to perform packet searches to arrive at a classification/forwarding decision for a packet. The CAM 442 may be ternary, binary, or a combination of binary and ternary.
[0051] The associated RAMs (ARAMs) 444a, 44b provide associated data for each entry in the CAM 442. The ARAMs 444a, 444b are accessed using the address (index value) returned by the CAM 442 as a result of a search operation. The ARAM 444a, 444b entry data is used to supply intermediate classification/forwarding information for the packet that is used by the packet processor 428 in making a final classification/forwarding decision for the packet.
[0052] The table 120, which may or may not be stored on a CAM, and the associated data store 124, which collectively may be referred to as a Virtual Router Indirection Mapper (VRIM), are the same elements previously discussed in relation to FIG. 1 .
[0053] In addition to the ingress and egress portions 410, 412, the packet modification system 404 further comprises a second packet parser 430 for parsing an egress packet, modification processor 432, a fragment processor 436, a third packet parser 436, Access Control Logic (“ACL”) 438a, and L3/L4 checksum logic 438b
[0054] Parser 430 is configured to parse an egress packet and provide context pointers to the beginning of the packet layers, for example, pointers to the beginning of OSI layers 2, 3, and 4.
[0055] Modification processor 432 modifies some or all of an egress packet responsive to the context pointers provided by parser 430, in the process disassembling the packet into fragments. Fragment processor 436 re-assembles the fragmented packet.
[0056] The modification RAMs (“MRAMs”) 448a, 448b provides data and control structures for packet modification operations performed by the modification processors 432a, 432b
[0057] Parser 436 is configured to parse the reassembled packet and provide context pointers to the beginning of the packet layers, for example, pointers to the beginning of OSI layers 2, 3, and 4.
[0058] ACL logic 438b arrives at an ACL decision with respect to a packet, such as CPU copy, mirror copy; and kill, responsive to the parsed packet layers provided by parser 436. The CPU copy action forwards a copy of the packet to a host 438 coupled to the system. The mirror copy action implements an egress mirroring function, in which a copy of the packet is forwarded to mirror FIFO 440 and then on to the egress portion 408 of the packet classification/forwarding system 402. The kill action either kills the packet or marks it for killing by a downstream Medium Access Control (MAC) processor.
[0059] L3/L4 checksum logic 438b is configured to compute a checksum for a modified packet. In one embodiment, logic 438b is configured to independently calculate a layer three (IP) and layer four (TCP/UDP) checksum.
[0060] In one implementation, the interfaces 418, 420, 422, 424, and one or more of the CAM, VRIM, ARAM, or MRAM interfaces (not identified, may be a QDR- or DDR-type interface as described in U.S. patent application Ser. No. 10/655,742, filed Sep. 4, 2003, which is hereby fully incorporated by reference herein as though set forth in full.
[0061] In one embodiment, the logic elements depicted in FIG. 1 are incorporated into the router of FIG. 4 within the forwarding and classification system 402, just downstream from the packet parser 104 and parallel with the packet processor 428. In this embodiment, logic 112 in FIG. 1 performs the key generation step 302 of FIG. 3 responsive to parsed packet data provided by parser 104. Logic 112 also performs the optional key type generation and masking step 304 if a ternary CAM is not included in the VRIM 120, 124 and used as part of the indirection mapping process 306. If a ternary CAM is included in the VRIM 120, 124, and used as part of the indirection mapping process 306, the key type generation and masking step 304 may be performed by this CAM. Logic 126 further performs the indirection mapping process 306 in conjunction with the elements of VRIM 120, 124, as well as the VRID outputting step 308.
[0062] Packet processor 428 performs the configure device step 310 of FIG. 3 by using the VRID as the starting key to CAM 442, which determines the starting address of a sequence of commends executed by the packet processor 306 to make a classification and forwarding decision for an ingress packet. By using the VRID as the starting key to the CAM 442, the packet processor 428 implicitly selects a routing table from a plurality of possible routing tables, as illustrated in FIG. 5 .
[0063] Packet processor 428 also performs step 312 by classifying and forwarding the ingress packet responsive to the CAM searching process that is performed, at least initially, with the key determined responsive to the VRID 102.
[0064] While various embodiments of the invention have been described, it will be apparent to those of ordinary skill in the art that many more embodiments and implementations are possible that are within the scope of this invention. Accordingly, the invention is not to be restricted except in light of the attached claims and their equivalents.
Claims
What is claimed is:
1. A method, performed in, by or for a networking device, of presenting different virtual routers to different end users, classes of service, or packets comprising the steps of:
receiving an incoming packet having a VLAN field and at least one additional packet field;
forming a key from the VLAN field and the at least one additional packet field;
mapping the key into a virtual router identifier using a two-step indirection mapping process, comprising a first step and a second step, the virtual router identifier identifying a particular virtual router configuration from amongst a plurality of possible virtual router configurations, each of which is characterized by a routing table, for use in routing packets at OSI layer three or higher, selected from a plurality of possible routing tables;
the first step of the two-step indirection mapping process comprising accessing a table having a plurality of entries, each having a content value and an index value, and locating a matching entry having a content value that matches the key;
the second step of the two-step indirection mapping process comprising mapping the index value of the matched entry into the virtual router identifier by using the index value to identify an entry in an associated data store element containing or including the virtual router identifier;
configuring the device to have the particular configuration identified by the virtual router identifier by selecting the routing table that characterizes the particular configuration identified by the virtual router identifier for use in routing the packet at OSI layer three or higher; and
routing the packet at OSI layer three or higher using the selected routing table that characterizes the particular configuration identified by the virtual router identifier,
wherein the number of possible virtual routers is increased by mapping many different key values into the same virtual router identifier through appropriate settings of the index values.
2. The method of claim 1 wherein the key is a masked key.
3. The method of claim 1 wherein the key is an unmasked key.
4. The method of claim 1 wherein the key is masked using a key type determined responsive to one or more packet fields.
5. The method of claim 1 wherein the at least one additional packet field comprises a VMAN field.
6. The method of claim 1 wherein the at least one additional packet field comprises VMAN and ingress port fields.
7. The method of claim 1 wherein the at least one additional packet field comprises an ingress port field.
8. The method of claim 1 wherein the table is stored on a CAM, and the number of virtual routers is only limited by the memory size of the CAM.
9. The method of claim 3 wherein the key is masked by wildcarding one or more fields of entries of a ternary CAM.
10. A method, performed in, by or for a networking device, of presenting different virtual routers to different end users, classes of service, or packets comprising the steps of:
receiving an incoming packet having a VLAN field and at least one additional packet field;
forming a key from the VLAN field and the at least one additional packet field;
masking the key using a key type determined responsive to one or more packet fields;
mapping the masked key into a virtual router identifier using a two-step indirection mapping process, comprising a first step and a second step, the virtual router identifier identifying a particular virtual router configuration from amongst a plurality of possible virtual router configurations, each of which is characterized by a routing table, for use in routing packets at OSI layer three or higher, selected from a plurality of possible routing tables;
the first step of the two-step indirection mapping process comprising accessing a table having a plurality of entries, each having a content value and an index value, and locating a matching entry having a content value that matches the key;
the second step of the two-step indirection mapping process comprising mapping the index value of the matched entry into the virtual router identifier by using the index value to identify an entry in an associated data store element containing or including the virtual router identifier;
configuring the device to have the particular configuration identified by the virtual router identifier by selecting the routing table that characterizes the particular configuration identified by the virtual router identifier for use in routing the packet at OSI layer three or higher; and
routing the packet at OSI layer three or higher using the selected routing table that characterizes the particular configuration identified by the virtual router identifier,
wherein the routing table characterizing the particular configuration identified by the virtual router identifier is implicitly selected by determining, responsive to the virtual router identifier, a starting address of a sequence of commands that are executed by a packet processor to route the packet.
11. A method, performed in, by or for a networking device, of presenting different virtual routers to different end users, classes of service, or packets comprising the steps of:
receiving an incoming packet having a VLAN field and at least one additional packet field;
forming a key from the VLAN field and at least one additional packet field;
masking the key using a key type determined responsive to the ingress port field;
mapping the masked key into a virtual router identifier using a two-step indirection mapping process, comprising a first step and a second step, the virtual router identifier identifying a particular virtual router configuration from amongst a plurality of possible virtual router configurations, each of which is characterized by a routing table, for use in routing packets at OSI layer three or higher, selected from a plurality of possible routing tables;
the first step of the two-step indirection mapping process comprising accessing a table having a plurality of entries, each having a content value and an index value, and locating a matching entry having a content value that matches the key;
the second step of the two-step indirection mapping process comprising mapping the index value of the matched entry into the virtual router identifier by using the index value to identify an entry in an associated data store element containing or including the virtual router identifier;
configuring the device to have the particular configuration identified by the virtual router identifier by selecting the routing table that characterizes the particular configuration identified by the virtual router identifier for use in routing the packet at OSI layer three or higher; and
routing the packet at OSI layer three or higher using the selected routing table that characterizes the particular configuration identified by the virtual router identifier,
wherein the key type is determined by inputting an ingress port field of the packet to a lookup table, and wherein the number of possible virtual routers is increased by mapping many different key values into the same virtual router identifier through appropriate settings of the index values.
15. The method of any one of claims 1- and 11 wherein the routing table characterizing the particular configuration identified by the virtual router identifier is implicitly selected by determining, responsive to the virtual router identifier, a starting address of a sequence of commands that are executed by a packet processor to route the packet.
17. A system, in or associated with a networking device, of presenting different virtual routers to different end users, classes of service, or packets comprising:
first logic for receiving an incoming packet having a VLAN field and at least one additional packet field;
second logic forming a key from the VLAN field and the at least one additional packet field;
means for mapping the key into a virtual router identifier using a two-step indirection mapping process, comprising a first step and a second step, the virtual router identifier identifying a particular virtual router configuration from amongst a plurality of possible virtual router configurations, each of which is characterized by a routing table, for use in routing packets at OSI layer three or higher, selected from a plurality of possible routing tables;
the first step of the two-step indirection mapping process comprising accessing a table having a plurality of entries, each having a content value and an index value, and locating a matching entry having a content value that matches the key;
the second step of the two-step indirection mapping process comprising mapping the index value of the matched entry into the virtual router identifier by using the index value to identify an entry in an associated data store element containing or including the virtual router identifier; and
one or more packet processors for (1) configuring the device to have the particular configuration identified by the virtual router identifier by selecting the routing table that characterizes the particular configuration identified by the virtual router identifier for use in routing the packet at OSI layer three or higher; and (2) routing the packet at OSI layer three or higher using the selected routing table that characterizes the particular configuration identified by the virtual router identifier,
wherein the key is masked using a key type, the key type is determined by inputting an ingress port field of the packet to a lookup table, and wherein the number of possible virtual routers is increased by mapping many different key values into the same virtual router identifier through appropriate settings of the index values.
18. The system of claim 17 wherein the table is stored on a CAM, the first step of the two-step indirection mapping process comprises having a CAM search for and locate an entry whose content value matches the key, and the associated data store element comprises an associated RAM.
19. The system of claim 17 wherein the table is stored in a RAM, the first step of the two-step indirection mapping process comprises applying a hash function to the key to determine a table index for a starting entry, and then searching the table beginning with the starting entry to locate an entry whose content value matches the key.
20. The system of claim 18 wherein the CAM is a binary CAM.
21. The system of claim 18 wherein the CAM is a ternary CAM.
22. The system of claim 17 wherein the key is a masked key.
23. The system of claim 17 wherein the key is an unmasked key.
24. The system of claim 22 wherein the key is masked using a key type determined responsive to one or more packet fields.
25. The system of 24 wherein the key is masked by wildcarding one or more fields of the key responsive to key type.
26. The system of claim 22 wherein the key is masked by wildcarding one or more fields of entries of a ternary CAM.
27. The system of claim 17 wherein the routing table characterizing the particular configuration identified by the virtual router identifier is implicitly selected by determining, responsive to the virtual router identifier, a starting address of a sequence of commands that are executed by a packet processor to route the packet.
Patent Citations (111)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5072443(A) | 1991-12-01 | Hahne et al. | Applicant |
| US5282270(A) | 1994-01-01 | Oppenheimer et al. | Applicant |
| US5473599(A) | 1995-12-01 | Li et al. | Applicant |
| US5764636(A) | 1998-06-01 | Edsall | Applicant |
| US5852607(A) | 1998-12-01 | Chin | Applicant |
| US5923660(A) | 1999-07-01 | Shemla et al. | Applicant |
| US5999518(A) | 1999-12-01 | Nattkemper et al. | Applicant |
| US6034957(A) | 2000-03-01 | Haddock et al. | Applicant |
| US6098109(A) | 2000-08-01 | Kotzur et al. | Applicant |
| US6172980(B1) | 2001-01-01 | Flanders et al. | Applicant |
| US6173333(B1) | 2001-01-01 | Jolitz et al. | Applicant |
| US6208649(B1) | 2001-03-01 | Kloth | Examiner |
| US6256314(B1) | 2001-07-01 | Rodrig et al. | Applicant |
| US6275861(B1) | 2001-08-01 | Chaudri et al. | Applicant |
| US6295299(B1) | 2001-09-01 | Haddock et al. | Applicant |
| US6351801(B1) | 2002-02-01 | Christie et al. | Applicant |
| US6362990(B1) | 2002-03-01 | Gibson et al. | Examiner |
| US6381162(B1) | 2002-04-01 | Peterson | Examiner |
| US6381242(B1) | 2002-04-01 | Maher, III et al. | Applicant |
| US6384750(B1) | 2002-05-01 | Brown | Examiner |
| US6397260(B1) | 2002-05-01 | Wils et al. | Applicant |
| US6463067(B1) | 2002-10-01 | Hebb et al. | Applicant |
| US6515963(B1) | 2003-02-01 | Bechtolsheim et al. | Examiner |
| US6553002(B1) | 2003-04-01 | Bremer et al. | Applicant |
| US6570877(B1) | 2003-05-01 | Kloth et al. | Applicant |
| US6631465(B1) | 2003-10-01 | Chen et al. | Applicant |
| US6658002(B1) | 2003-12-01 | Ross et al. | Examiner |
| US6661791(B1) | 2003-12-01 | Brown | Examiner |
| US6735670(B1) | 2004-05-01 | Bronstein et al. | Examiner |
| US6738892(B1) | 2004-05-01 | Coon et al. | Applicant |
| US6763023(B1) | 2004-07-01 | Gleeson et al. | Applicant |
| US6765881(B1) | 2004-07-01 | Rajakarunanayake | Applicant |
| US6792502(B1) | 2004-09-01 | Pandya et al. | Examiner |
| US6842791(B2) | 2005-01-01 | Navada et al. | Applicant |
| US6871262(B1) | 2005-03-01 | Oren et al. | Applicant |
| US6882642(B1) | 2005-04-01 | Kejriwal et al. | Applicant |
| US6888797(B1) | 2005-05-01 | Cao et al. | Applicant |
| US6914905(B1) | 2005-07-01 | Yip et al. | Examiner |
| US6917617(B2) | 2005-07-01 | Jin et al. | Applicant |
| US6957258(B2) | 2005-10-01 | Maher, III et al. | Applicant |
| US6975581(B1) | 2005-12-01 | Medina et al. | Applicant |
| US6976158(B2) | 2005-12-01 | Catherwood et al. | Applicant |
| US6980552(B1) | 2005-12-01 | Belz et al. | Applicant |
| US6999462(B1) | 2006-02-01 | Acharya | Examiner |
| US7062398(B1) | 2006-06-01 | Rothberg | Applicant |
| US7062641(B1) | 2006-06-01 | Devanagondi et al. | Applicant |
| US7079407(B1) | 2006-07-01 | Dimitrelis | Applicant |
| US7092354(B2) | 2006-08-01 | Jensen | Applicant |
| US7111101(B1) | 2006-09-01 | Bourke et al. | Applicant |
| US7139271(B1) | 2006-11-01 | Parruck et al. | Examiner |
| US7152191(B2) | 2006-12-01 | Kessler et al. | Applicant |
| US7154902(B1) | 2006-12-01 | Sikdar | Examiner |
| US7190696(B1) | 2007-03-01 | Manur et al. | Applicant |
| US7212837(B1) | 2007-05-01 | Calhoun et al. | Examiner |
| US7248584(B2) | 2007-07-01 | Hooper | Applicant |
| US7248585(B2) | 2007-07-01 | Kohn et al. | Applicant |
| US7260648(B2) | 2007-08-01 | Tingley et al. | Applicant |
| US7274693(B1) | 2007-09-01 | Kloth et al. | Examiner |
| US7286520(B2) | 2007-10-01 | Takeda et al. | Applicant |
| US7296100(B1) | 2007-11-01 | Venkatesh et al. | Applicant |
| US7304996(B1) | 2007-12-01 | Swenson et al. | Applicant |
| US7444405(B2) | 2008-10-01 | Gangadharan | Applicant |
| US7487938(B2) | 2009-02-01 | Brady et al. | Applicant |
| US7515589(B2) | 2009-04-01 | Bacher et al. | Applicant |
| US7561531(B2) | 2009-07-01 | Lewites et al. | Applicant |
| US2001/0005876(A1) | 2001-06-01 | Srinivasan et al. | Examiner |
| US2001/0015976(A1) | 2001-08-01 | Harasawa et al. | Examiner |
| US2001/0025315(A1) | 2001-09-01 | Jolitz | Applicant |
| US2001/0028651(A1) | 2001-10-01 | Murase | Examiner |
| US2001/0048661(A1) | 2001-12-01 | Clear et al. | Applicant |
| US2002/0184387(A1) | 2002-12-01 | Yamaya et al. | Applicant |
| US2002/0191605(A1) | 2002-12-01 | Lunteren et al. | Applicant |
| US2003/0005210(A1) | 2003-01-01 | Thummalapally et al. | Examiner |
| US2003/0026259(A1) | 2003-02-01 | Brown | Applicant |
| US2003/0028713(A1) | 2003-02-01 | Khanna et al. | Examiner |
| US2003/0069973(A1) | 2003-04-01 | Ganesan et al. | Applicant |
| US2003/0154380(A1) | 2003-08-01 | Richmond et al. | Examiner |
| US2003/0165144(A1) | 2003-09-01 | Wang | Applicant |
| US2003/0169612(A1) | 2003-09-01 | Hu | Examiner |
| US2003/0193949(A1) | 2003-10-01 | Kojima et al. | Applicant |
| US2004/0003110(A1) | 2004-01-01 | Ozguner | Applicant |
| US2004/0015683(A1) | 2004-01-01 | Emma et al. | Applicant |
| US2004/0100956(A1) | 2004-05-01 | Watanabe | Applicant |
| US2004/0120173(A1) | 2004-06-01 | Regev et al. | Examiner |
| US2004/0202162(A1) | 2004-10-01 | Vu | Examiner |
| US2004/0205056(A1) | 2004-10-01 | Mori et al. | Applicant |
| US2004/0205753(A1) | 2004-10-01 | Moore | Applicant |
| US2004/0208197(A1) | 2004-10-01 | Viswanathan | Examiner |
| US2004/0246981(A1) | 2004-12-01 | He et al. | Examiner |
| US2004/0258062(A1) | 2004-12-01 | Narvaez | Applicant |
| US2005/0055339(A1) | 2005-03-01 | Richardson | Examiner |
| US2005/0074009(A1) | 2005-04-01 | Kanetake et al. | Examiner |
| US2005/0180429(A1) | 2005-08-01 | Ghahremani et al. | Applicant |
| US2005/0190639(A1) | 2005-09-01 | Hu | Examiner |
| US2005/0198362(A1) | 2005-09-01 | Navada et al. | Applicant |
| US2005/0226242(A1) | 2005-10-01 | Parker | Applicant |
| US2005/0281191(A1) | 2005-12-01 | McGee et al. | Applicant |
| US2006/0007917(A1) | 2006-01-01 | Saito et al. | Examiner |
| US2006/0039374(A1) | 2006-02-01 | Belz et al. | Applicant |
| US2006/0056420(A1) | 2006-03-01 | Okuda et al. | Applicant |
| US2006/0092950(A1) | 2006-05-01 | Arregoces et al. | Applicant |
| US2006/0106934(A1) | 2006-05-01 | Figaro et al. | Applicant |
| US2006/0233168(A1) | 2006-10-01 | Lewites et al. | Applicant |
| US2007/0291791(A1) | 2007-12-01 | English et al. | Examiner |
| US2008/0034112(A1) | 2008-02-01 | Imai et al. | Applicant |
| US2008/0075078(A1) | 2008-03-01 | Watanabe | Applicant |
| US2008/0186968(A1) | 2008-08-01 | Farinacci et al. | Applicant |
| US2008/0205264(A1) | 2008-08-01 | Rorie | Applicant |
| US2008/0222094(A1) | 2008-09-01 | Cox | Applicant |
| CN1604568 | 2005-04-01 | Applicant | |
| WO3/081857 | 2003-10-01 | Applicant |
Non-Patent Literature (11)
- Van Ess, D., A Circular FIFO, PSoC Style, Cypress Microsystems, Application Note AN2036, Rev. B, pp. 1-5, Jun. 21, 2002.Applicant
- Network Working Group, RFC 1071—Computing the Internet Checksum, Sep. 1988, available at: http://www.faqs.org/rfcs/rfc1071.html.Applicant
- Network Working Group, RFC 1141—Incremental Updating of the Internet Checksum, Jan. 1990, available at: http://www.faqs.org/rfcs/rfc1141.html.Applicant
- Network Working Group, RFC 1624—Computation of the Internet Checksum via incremental update, May 1994, available at: http://www.faqs.org/rfcs/rfc1624.html.Applicant
- Netlogic Microsystems, Product Brief NSE5000GLQ, Copyright 2004, available at: http://www.netlogicmicro.com/datasheets/nse5000glq.html.Applicant
- Zhang, Z., Recovery of Memory and Process in DSM Systems: HA Issue #1, Hewlett-Packard Co. HPL-2001-76, Mar. 30, 2001.Applicant
- Non-Final Office Action for U.S. Appl. No. 11/324,209 Mailed Jan. 21, 2010, 23 Pages.Applicant
- Final Office Action for U.S. Appl. No. 11/324,209, Mailed Jul. 21, 2009, 19 Pages.Applicant
- Non-Final Office Action for U.S. Appl. No. 11/324,209 Mailed Oct. 30, 2008, 23 Pages.Applicant
- Non-Final Office Action for European Application No. 06846017.9 Mailed Apr. 21, 2010, 6 Pages.Applicant
- Office Action for Chinese Patent Application No. 200680050164.9 mailed Aug. 4, 2010, 19 pages.Applicant