Method of providing virtual router functionality
19 claims: 2 independent, 17 dependent
- 1A 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 (106) and an additional packet field (108,110);forming a key (118) by concatenating the VLAN field and the additional packet field of the incoming packet;mapping the key to a virtual router identifier (102) via a two-step indirection mapping process, comprising a first step and a second step, the virtual router identifier (102) 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 routing packets at OSI layer three or higher, selected from a plurality of possible routing tables;wherein the first step of the two-step indirection mapping process comprising accessing a table (120) having a plurality of entries (120a, 120b, 120c), each having a content value and an index value (122), and locating a matching entry having a content value that matches the key;wherein the second step of the two-step indirection mapping process comprising mapping the index value of the matched entry from the first step of the two-step indirection mapping process into the virtual router identifier (102) by applying the index value to identify an entry in an associated data store element (124) that includes the virtual router identifier (102);mapping many different key values to the virtual router identifier (102) by appropriate settings of the index values (122) associated with the plurality of entries (120a, 120b, 120c) to increase a number of possible virtual routers presented to different end users, classes of service, or packets;configuring the networking device to have the particular configuration identified by the virtual router identifier (102) by selecting the routing table that characterizes the particular configuration identified by the virtual router identifier (102) for routing the packet at OSI layer three or higher;and routing the packet at OSI layer three or higher via the selected routing table that characterizes the particular configuration identified by the virtual router identifier.
- 2A 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 unit (104) for receiving an incoming packet having a VLAN field (106) and an additional packet field (108, 110);second logic unit (112) forming a key (118) by concatenating the VLAN field and the additional packet field of the incoming packet;first means (126) for mapping the key into a virtual router identifier (102) via 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;wherein the first step of the two-step indirection mapping process comprising accessing a table (120) having a plurality of entries (120a, 120b, 120c), each having a content value and an index value (122), and locating a matching entry having a content value that matches the key;wherein the second step of the two-step indirection mapping process comprising mapping the index value of the matched entry from the first step of the two-step indirection mapping process into the virtual router identifier (102) by applying the index value to identify an entry in an associated data store element (124) that includes the virtual router identifier (102);means for mapping many different key values to the virtual router identifier (102) by appropriate settings of the index values (122) associated with the plurality of entries (120a, 120b, 120c) to increase a number of possible virtual routers presented to different end users, classes of service, or packets;second means (428) for configuring the networking 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 third means for routing the packet at OSI layer three or higher via the selected routing table that characterizes the particular configuration identified by the virtual router identifier.
Independent claims2
60 paragraphs in 4 sections, as filed
BACKGROUND OF THE INVENTION
1. Field of the Invention.
0001This application relates generally to networking devices, and, specifically, to methods for configuring such devices so that they provide virtual router functionality, <i>i.e</i>., present different virtual router configurations to different end users, classes of service or packets.
2. Related Art.
0002Virtual 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.
0003This 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.
0004Another 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 4K different routing tables, which may not be sufficient for certain applications.
0005A 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.
0006A 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.
0007<patcit id="pcit0001" dnum="US20050074009A"><text>U.S. Patent Publication No. 2005/0074009</text></patcit>, entitled "Packet Transfer Unit," to Kanetake, <i>et al.</i> describes a packet transfer unit, which comprises a search key memory that stores a search key for a transfer destination of a packet and verification information generated from the search key, in association with a storage location of transfer information memorized in a transfer information memory. A transfer information acquisition unit searches the search key memory by using the search key generated based on the header information and the verification information generated from the search key, acquires storage location information of the transfer information from the search key memory when a match with the search key and the verification information memorized in the search key memory is found, and acquires the transfer information stored in the transfer information memory based on the acquired storage location information. A transfer unit transfers the packet based on the acquired transfer information.
0008<patcit id="pcit0002" dnum="US20040246981A"><text>U.S. Patent Publication No. 2004/0246981</text></patcit>, entitled "System and Method of Accessing and Transmitting Different Data Frames in a Digital Transmission Network, to He, <i>et al</i>.," describes a method and system for accessing and transmitting different types of data frames in a digital transmission network. The system includes a data processing and dispatching device having at least an inter-device interface, a processing flow database, and a control interface unit. The method includes the steps of extracting type number information from data frames, searching for rules in the processing flow database corresponding to the extracted type number, determining the retrieved result and discarding the data frames if the retrieval result it blank. Otherwise an inter-device interface number is extracted and the data frames are output via the inter-device interface with the extracted inter-device interface number.
0009A further method and system for an aggregated VLAN network architecture is shown in <patcit id="pcit0003" dnum="US6914905B"><text>US 6,914,905 to Yip et al</text></patcit>, in which several VLANs in a network share the same default router address and subnet mask, but remain isolated from one another's network traffic.
SUMMARY
0010The invention provides a method of presenting different virtual routers to different end users, classes of service, or packets according to the features of claim 1. The method may be performed in any networking device, and enables the device to provide virtual router functionality. The invention further applies to a system according to the features of claim 2.
0011The 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.
0012The 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.
0013Other 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
0014The 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. <ul id="ul0001" list-style="none"><li><figref idref="f0001">Figure 1</figref> is a block diagram showing the method steps, data structures and logic elements used in producing a virtual router identifier (VRID) 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.</li><li><figref idref="f0002">Figure 2a</figref> illustrates an example of a key format, and <figref idref="f0002">Figures 2b-2e</figref> illustrate various examples of key types wildcarding different ones of the fields making up the key format.</li><li><figref idref="f0003">Figure 3</figref> 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.</li><li><figref idref="f0004">Figure 4</figref> illustrates a particular switch architecture that embodies or utilizes the claimed method and system.</li><li><figref idref="f0005">Figure 5</figref> illustrates a plurality of routing tables that may be used to support virtual router functionality.</li><li><figref idref="f0005">Figures 6a, 6b and 6c</figref> illustrate examples of alternative data types that may apply depending on the type of VLAN field detected in the ingress packet.</li></ul>
DETAILED DESCRIPTION
0015Referring to <figref idref="f0001">Figure 1</figref>, 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>i.e</i>., one that virtually routes at OSI layer three, and a "heavyweight" virtual router, <i>i.e</i>., 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.
0016As 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).
0017The 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.
0018The ingress port number 110 is an identifier of the physical port on which the packet was received at the device.
0019Returning to <figref idref="f0001">Figure 1</figref>, 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.
0020The 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 <figref idref="f0002">Fig. 2a</figref>, 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.
0021Concurrently, 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, <figref idref="f0002">Fig. 2b</figref> 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, <figref idref="f0002">Fig. 2c</figref> illustrates a key type in which the ingress port field is wildcarded, and the VLAN and VMAN fields are used in the subsequent processing. <figref idref="f0002">Fig. 2d</figref> illustrates a key in which the VLAN field is wildcarded, and the ingress port and VMAN fields are used in the subsequent processing. <figref idref="f0002">Fig. 2e</figref> illustrates a key in which the VMAN field is wildcarded, and the ingress port and VLAN fields are used in the subsequent processing.
0022In the embodiment illustrated in <figref idref="f0001">Fig. 1</figref>, 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 <figref idref="f0002">Figs. 2b-2e</figref>. 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.
0023<figref idref="f0005">Fig. 6a</figref> 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.
0024Moreover, 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.
0025Referring again to <figref idref="f0001">Fig. 1</figref>, 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 <figref idref="f0001">Fig. 1</figref>, 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.
0026In 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 <figref idref="f0001">Fig. 1</figref>, entry 124b satisfies this condition. The content value of this entry is or contains the virtual router identifier 102.
0027In 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>i.e</i>., 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>i.e</i>., 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.
0028In 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.
0029Logic 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.
0030The 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.
0031Second, 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.
0032Third, 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>i.e</i>., 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 <figref idref="f0005">Fig. 6b</figref>, <i>i.e</i>., 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 <figref idref="f0005">Fig. 6c</figref>, <i>i.e</i>., a 6 bit ingress port field followed by a 24 bit ESID field. Upon encountering the key type of <figref idref="f0005">Fig. 6c</figref>, logic 112 in <figref idref="f0001">Fig. 1</figref> would format the key as indicated in this figure responsive to the fields 106, 108 and 110 from the packet parser, <i>i.e</i>., it would assume the VLAN field 106 is a 24 bit ESID field.
0033Fourth, 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 <figref idref="f0001">Fig. 1</figref>, 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.
0034<figref idref="f0003">Fig. 3</figref> 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 <figref idref="f0001">Fig. 1</figref>. Step 304 comprises the optional key type generation and masking processes performed by the logic 112 in <figref idref="f0001">Fig. 1</figref>, 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, soflware, or combinations of hardware and soflware.
0035Step 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 <figref idref="f0001">Fig. 1</figref>, 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.
0036Steps 306 and 308 are performed by logic 126 (illustrated in <figref idref="f0001">Fig. 1</figref>) through suitable accesses to table 120 and associated data element 124, as indicated by the dotted arrows between these elements.
0037Step 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 <figref idref="f0001">Fig. 1</figref>) 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 <figref idref="f0005">Fig. 5</figref>, 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.
0038Referring back to <figref idref="f0003">Fig. 3</figref>, 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.
0039<figref idref="f0004">Figure 4</figref> 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.
0040The 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.
0041In 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 <figref idref="f0001">Fig. 1</figref>), and a packet processor 428.
0042Parser 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.
0043Packet processor 428 is configured to classify and forward the packet, responsive to the context pointer provided by parser 104.
0044Content 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.
0045The 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.
0046The 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 <figref idref="f0001">Fig. 1</figref>.
0047In 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.
0048Parser 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.
0049Modification 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.
0050The modification RAMs ("MRAMs") 448a, 448b provides data and control structures for packet modification operations performed by the modification processors 432a, 432b.
0051Parser 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.
0052ACL 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.
0053L3/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.
0054In 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 <patcit id="pcit0004" dnum="US65574203A" dnum-type="L"><text>U.S. Patent Application Serial No. 10/655,742; filed September 4, 2003</text></patcit>, which is hereby fully incorporated by reference herein as though set forth in full.
0055In one embodiment, the logic elements depicted in <figref idref="f0001">Fig. 1</figref> are incorporated into the router of <figref idref="f0004">Fig. 4</figref> 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 <figref idref="f0001">Fig. 1</figref> performs the key generation step 302 of <figref idref="f0003">Fig. 3</figref> 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.
0056Packet processor 428 performs the configure device step 310 of <figref idref="f0003">Fig. 3</figref> 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 <figref idref="f0005">Fig. 5</figref>.
0057Packet 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.
0058While 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.
Contents4
5 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| EP1601137A1 | Cites | European Patent Office (EPO) | Examiner |
| US2005074009A1 | Cites | United States of America | Examiner |
| EP1601137A1 | Cites | European Patent Office (EPO) | – |
| WO03081857A | Cites | World Intellectual Property Organization (WIPO) | – |
| US2004246981A1 | Cites | United States of America | – |
| US2005074009A1 | Cites | United States of America | – |
| US6914905B1 | Cites | United States of America | – |
12 members in 5 offices
Priority claims9
| Document | Office | Kind | Date |
|---|---|---|---|
| 324159 | United States of America | – | |
| 32415905 | United States of America | A | |
| 32415905 | United States of America | A | |
| 2006049107 | United States of America | W | |
| 2006049107 | United States of America | W | |
| 2006049107 | – | – | – |
| 324159 | – | – | – |
| US20050324159 | – | – | – |
| WO2006US49107 | – | – | – |
Members12
| Document | Office | Kind | |
|---|---|---|---|
| US2007153808A1 | United States of America | A1 | |
| WO2007079035A1 | World Intellectual Property Organization (WIPO) | A1 | |
| EP1969778A1 | European Patent Office (EPO) | A1 | |
| CN101352003A | China | A | |
| JP2009522868A | Japan | A | |
| US7894451B2 | United States of America | B2 | |
| EP2375647A1 | European Patent Office (EPO) | A1 | |
| EP2375647B1 | European Patent Office (EPO) | B1 | |
| JP2013051729A | Japan | A | |
| JP5324225B2 | Japan | B2 | |
| EP1969778B1This record | European Patent Office (EPO) | B1 | |
| JP5567641B2 | Japan | B2 |
68 legal events, as 9 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Opt-out of the competence of the unified patent court (upc) registeredP01 | P01 | EP | |
| Fee paymentPLFP | PLFP | FR | |
| Amendment of ipc main classPREVIOUS MAIN CLASS: H04L0012931000R079 | R079 | DE | |
| Fee paymentPLFP | PLFP | FR | |
| Fee paymentPLFP | PLFP | FR | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Fee paymentPLFP | PLFP | FR | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent lapsedLapsedMM4A | MM4A | IE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent ceasedCeasedPL | PL | CH | |
| No opposition filed against granted patent, or epo opposition proceedings concluded without decisionGrantedR097 | R097 | DE | |
| No opposition filedOpposition26N | 26N | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| No opposition filed against granted patent, or epo opposition proceedings concluded without decisionGrantedR097 | R097 | DE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Discontinued in the netherlands as no translation has been filedVDEP | VDEP | NL | |
| Invalidated european patentMG4D | MG4D | LT | |
| Deletion acc. to par. 5 (withdrawal of the translation of the ep patent)MK05 | MK05 | AT | |
| Dpma publication of mentioned ep patent grantGrantedR096 | R096 | DE | |
| European patents granted designating irelandGrantedFG4D | FG4D | IE | |
| Reference to at number (ep patent validated in austria)REF | REF | AT | |
| Designated contracting statesAK | AK | EP | |
| European patent takes effect as a national patent in ch/liEP | EP | CH | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Intention to grant announcedINTG | INTG | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Amendment of ipc main classPREVIOUS MAIN CLASS: H04L0012460000R079 | R079 | DE | |
| Request for extension of the european patent (deleted)DAX | DAX | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 1969778
- Publication, DOCDB
- 1969778
- Publication, EPODOC
- EP1969778
- Application
- 68460179
- Application, DOCDB
- 06846017
- Application, EPODOC
- EP20060846017
Titles3
- German
- VERFAHREN ZUM BEREITSTELLEN DER FUNKTIONALITÄT EINES VIRTUELLEN ROUTERS
- English
- METHOD OF PROVIDING VIRTUAL ROUTER FUNCTIONALITY
- French
- PROCEDE PERMETTANT DE FOURNIR UNE FONCTIONNALITE DE ROUTEUR VIRTUEL
Classification
- CPC, 6
- H04L12/4641
- H04L45/00
- H04L49/205
- H04L49/25
- H04L49/354
- H04L49/70
- IPC, 7
- H04L12 931
- H04L12 46
- H04L12 947
- H04L12 701
- H04L45 58
- H04L45 74
- H04L45 80
Designated states1
- Contracting states, 1
- Türkiye
