US 7,948,994 B2Grant
Method and apparatus for routing and forwarding between virtual routers within a single network element
Issue Date:2011-05-24
•16 Claims
•8 Drawing Sheets
Abstract
A method and apparatus for routing and forwarding between virtual routers is described. A method in a single network element comprises peering a first virtual router to a second virtual router, wherein the first and second virtual routers have separate address spaces and separate routing tables, distributing a set of one or more routes from the first virtual router to the second virtual router, wherein a first of the set of routes identifies the first virtual router as a next hop of the first route, said first route including a destination, and downloading to a set of one or more forwarding tables, the destination and the next hop.
Metadata
Assignee
- Ericsson AB
Inventor
- Naiming Shen
Application Information
Application Number:US 10/883,070
Filing Date:2004-06-30
Priority Date:2002-07-20
Art Unit:2477
Classifications
IPC:
H04L12/28G06F15/16
Patent Drawings (8 sheets)
Description
Cross-Reference to Related Applications
[0001] This application is a divisional of application Ser. No. 10/265,789, filed Oct. 7, 2002, now U.S. Pat. No. 6,907,039 which claims the benefit of U.S. Provisional Patent Application No. 60/397,353, entitled “Method and Apparatus for Routing and Forwarding Between Virtual Routers Within a Single Network Element” filed on Jul. 20, 2002, now issued as U.S. Pat. No. 6,907,039.
Background of the Invention
[0002] 1. Field of the Invention
[0003] The invention relates to the field of communication. More specifically, the invention relates to communication networks.
[0004] 2. Background of the Invention
[0005] The development of virtual routers within a single network element provided certain benefits and functionality unavailable with legacy routers. For example, a single network element with virtual routers could service multiple Internet Service Providers and/or corporations with the single network element.
[0006] FIG. 1 (Prior Art) is a diagram of a single network element with virtual routers. In FIG. 1 , a network element 101 includes virtual routers VR-A 111, VR-B 113, and VR-C 115. Each of the virtual routers 111, 113, and 115 respectively receive traffic from ingress ports 103A-103C and respectively transmit traffic out of the egress ports 151A-151C as illustrated in FIG. 1 . The virtual router VR-A 111 receives traffic 109A from the ingress port 103A and transmits the traffic 109A out of the egress port 151A. The virtual router VR-B 113 receives traffic 109B from the ingress port 103B and transmits the traffic 109B out of the ingress port 151B. The virtual router VR-C 115 receives traffic 109C from the ingress port 103C and transmits the traffic 109C out of the egress port 151C.
[0007] Network elements that support the virtual routers, performed inter-VR forwarding based on the forwarding scheme described (i.e., with standard interfaces). If VR-A 111 received a packet for transmission to VR-B 113, then the VR-A 111 looked up the next hop in its routing table, found an interface that was associated with the ingress port 103B, and forwarded the packet based on that interface.
[0008] Despite the advantages offered by virtual routers and the capability of a single network element to behave as multiple routers, the virtual routers within a single network element do not communicate routing and/or forwarding information as if separate routers.
Brief Summary of the Invention
[0009] A method and apparatus for routing and forwarding between virtual routers is described. According to one aspect of the invention, a method in a single network element provides for peering a first virtual router to a second virtual router, wherein the first and second virtual routers have separate address spaces and separate routing tables. A set of one or more routes are distributed from the first first virtual router to the second virtual router, wherein a first of the set of routes identifies the first virtual router as a next hop of the first route, said first route including a destination. In addition, the method provides for downloading to a set of one or more forwarding tables, the destination and the next hop.
[0010] These and other aspects of the present invention will be better described with reference to the Detailed Description and the accompanying Figures.
Brief Description of the Drawings
[0011] The invention may best be understood by referring to the following description and accompanying drawings that are used to illustrate embodiments of the invention. In the drawings:
[0012] FIG. 1 (Prior Art) is a diagram of a single network element with virtual routers.
[0013] FIG. 2 is an exemplary diagram illustrating forwarding between virtual routers according to one embodiment of the invention.
[0014] FIG. 3A is an exemplary diagram illustrating peering of virtual routers according to one embodiment of the invention.
[0015] FIG. 3B is an exemplary diagram illustrating additional peering of virtual routers according to one embodiment of the invention.
[0016] FIG. 3C is an exemplary diagram illustrating inter-VR interfaces as local area network interfaces according to one embodiment of the invention.
[0017] FIG. 4 is an exemplary diagram illustrating external route distribution between virtual routers according to one embodiment of the invention.
[0018] FIG. 5 is a diagram of an exemplary network element according to one embodiment of the invention.
Detailed Description of the Invention
[0019] In the following description, numerous specific details are set forth to provide a thorough understanding of the invention. However, it is understood that the invention may be practiced without these specific details. In other instances, well-known circuits, structures, standards, and techniques have not been shown in detail in order not to obscure the invention. The terms “routing table” and “forwarding table” are used throughout the description, but are not limited to being tables. A routing table and a forwarding table may be implemented with a variety of data structures (e.g., trees, tries, linked lists, hash tables, hybrid data structures, etc.).
[0020] FIG. 2 is an exemplary diagram illustrating forwarding between virtual routers according to one embodiment of the invention. FIG. 2 illustrates a network element 202 as including a virtual router 205A and a virtual router 205B. The virtual router 205A is identified as VR-A and the virtual router 205B is identified as VR-B.
[0021] The virtual router 205A includes interior gateway routing tables 209, an exterior gateway routing table 211, and a main routing table 213. Interior gateway routing protocol processes (e.g., OSPF, RIP, iBGP, IS-IS, etc.) build each of the interior gateway routing tables 209. The interior gateway routing tables 209 indicate routing information for reaching a destination, as determined by a corresponding interior gateway routing protocol process, that is internal to an autonomous system (AS), which includes the virtual router 205A. A process implementing an exterior gateway protocol (e.g., BGP-v4, EGP, etc.) builds the exterior gateway routing table 211. The exterior gateway routing table 211 indicates routing information for reaching destinations external to the AS of the virtual router 205A. The main routing table 213 is built using route entries from the interior gateway routing tables 209, the exterior gateway routing table 211, and interfaces from an interface manager 271.
[0022] The interface manager 271 includes a data structure that indicates interfaces and their corresponding reachable IP addresses via the interfaces. In certain embodiments of the invention, the interface manager also associates lower layer hardware information learned from lower layer protocols with interfaces. Each routing process exchanges routing information with other network elements through interfaces and install learned reachable routes into the main routing table, which are eventually downloaded into forwarding tables of the data plane from the main routing table in the control plane. The interface manager 271 indicates and maintains a status for each interface of the host network element. A routing process utilizes interface status to make correct routing decisions.
[0023] The first column of each entry within each of the routing tables 209, 211, and 213 indicates a destination. The last column of each entry within each of the routing tables 209, 211, and 213 as illustrated in FIG. 2 indicates a next hop. A next hop is either an interface next hop (i.e., a logical or physical interface) or a non-interface next hop (e.g., an IP address, a virtual router name, etc.). The remaining columns within each of the routing tables 209, 211, and 213 indicate additional routing information, such as line, metrics, etc.
[0024] The virtual router 205A also includes a forwarding module 207 and a forwarding table 219. The forwarding module 207 forwards packets that are received by the virtual router 205A in accordance with the forwarding table 219. The forwarding table 219 receives information downloaded from the main routing table.
[0025] In the example illustrated by FIG. 1 , the interior gateway routing tables 209 includes internal destinations ID1, ID2, and ID3 with corresponding next hops I/F1, VR-B, and ADDRESS, respectively. ID1, ID2 and ID3 are identifying data (e.g., IP addresses, prefixes, etc.) of other network elements within the same AS as the virtual router 205A. One or more of the internal destinations may also be another virtual router within the same network element (e.g., ID1 may be VR-B). While in one embodiment of the invention, internal destinations that are other virtual routers are identified with a virtual router identifier (i.e., virtual router handle), alternative embodiments of the invention may identify an internal destination with other techniques (e.g., IP address, inter-VR interface, etc.). The next hop I/F is a physical interface and the next hop VR-B may be a logical interface that indicates a VR instead of an IP address (i.e., an inter-VR interface), a virtual router handle, etc.
[0026] An inter-virtual router next hop is a unique value within the network element 202 that identifies a specific virtual router. When an administrator creates a virtual router, the administrator provides a user-friendly virtual router identifier (“VR name”) for the created virtual router. In response to the creation of a virtual router, the network element 202 creates and associates a unique virtual router identifier (“VR identifier”) to be utilized by the network element 202 to identify the created virtual router. While in one embodiment inter-virtual router next hops in the routing tables are VR identifiers, alternative embodiments of the invention may utilize alternative techniques to identify inter-VR next hops (e.g., the routing table indicates the VR name and a table that associates the VR name to a VR identifier is used to access the VR identifier, an inter-VR interface value is created within the network element and associated with a VR-identifier or VR-name in another data structure, etc.). For the purposes of this description, an inter-VR next hop is the VR identifier.
[0027] The exterior gateway routing table 211 as illustrated in FIG. 2 indicates external destinations ED1, ED2, and ED3 and corresponding next hops ADDRESS, I/F2, and VR-B, respectively. As with the internal destinations, the external destinations ED1, ED2, and ED3 can be IP addresses, prefixes, etc. While in one embodiment of the invention, external destinations that are other virtual routers are identified by an IP address or prefix, in alternative embodiments of the invention the external destination may be a VR name or VR identifier.
[0028] When the forwarding module 207 receives a packet 201, the forwarding module 207 determines the destination of the packet 201. The destination of the packet 201 is looked up in the forwarding table 219 to determine the appropriate outgoing interface. If the destination of the packet 201 is ID1, then the forwarding module 207 forwards the packet 201 to an egress port that corresponds to the outgoing interface I/F. If the destination of the packet 201 is ED3, then the forwarding module 207 forwards the packet 201 to the virtual router 205B. If the packet 201 is forwarded to the virtual router 205B, the virtual router 205B will process the packet 201 in accordance with its forwarding/routing information (e.g., drop the packet 201, forward the packet 201 to the appropriate egress port, forward the packet 201 to another virtual router, etc.).
[0029] The decision mechanism for determining whether a packet will be forwarded to an egress port or another virtual router can be implemented with a variety of techniques. In one embodiment of the invention, the forwarding module determines if the next hop indicated by the forwarding table for a packet is an inter-VR next hop. If the next hop is an inter-VR next hop then the corresponding packet is forwarded to the appropriate virtual router. If the next hop is not an inter-VR next hop (e.g., a logical or physical interface that does not indicate a virtual router, an IP address, etc.), then the packet is processed accordingly (e.g., if the next hop is a physical interface, then the packet is processed at lower layers in order to forward the packet along the appropriate hardware lines to the egress port). In another embodiment of the invention, a switching module is implemented separately from the forwarding module. If the next hop for a packet is a physical interface, then the forwarding module passes the packet to the switching module, which forwards the packet along the hardware lines that correspond to the physical interface. If the next hop is an inter-VR next hop, then the forwarding module forwards the packet to the appropriate virtual router.
[0030] In addition other techniques can be used to determine whether the next hop is a virtual router, an IP address, a physical interface, a logical interface, etc. In one embodiment of the invention, an additional field is included in each routing and forwarding table entry to explicitly indicate a type for the outgoing interface. In another embodiment of the invention, the value of the next hop implicitly indicates whether the next hop is a VR next hop or non-VR next hop.
[0031] Enabling inter-VR routing and forwarding provides additional functionality. A service provider that is a customer of a network provider, which owns a network element with inter-VR routing and forwarding, can allow its virtual private network (VPN) customers to exchange routes. In addition, inter-VR routing and forwarding enables a service provider's VPN customers to use the provider's network for Internet access. Inter-VR routing and forwarding can also be utilized to allow service providers to announce VPN customers' routes if they are part of the public address space.
[0032] Inter-VR routing and forwarding also enables virtual routers to replace customer premise equipment (CPE) routers. The service provider and/or network provider can utilize a virtual router to perform the tasks typically performed by a CPE router, especially for those customers that access the network from multiple locations.
[0033] If multiple customers of a network provider are on the same network element with virtual routers, then inter-VR routing and forwarding enables local area, metro area, and/or intra-continental private peerings without utilizing physical lines and/or ports to connect virtual routers.
[0034] Inter-VR routing and forwarding also provides additional capabilities with respect to testing and parallel network inter-communication. Since virtual routers can be connected without wires, then numerous virtual routers can be peered or connected to represent the topology of actual networks. The inter-VR routing and forwarding can then be used to simulate routing in different network topologies without cables and wires. For parallel network inter-communication, a service provider with an operational legacy network and a next generation network can utilize inter-VR routing and forwarding for experimental, trial, and/or operational exchanges of routes between the different networks (assuming the different networks include virtual routers within individual network elements). Moreover, the service provider can utilize inter-VR routing and forwarding to migrate their customers from a legacy network to a next generation network.
[0035] FIGS. 3A-3C are exemplary diagrams illustrating interior gateway routing tables being built with inter-VR routes according to one embodiment of the invention. FIG. 3A is an exemplary diagram illustrating peering of virtual routers according to one embodiment of the invention. In FIG. 3A , a virtual router 303A (VR-A) is peered with virtual routers 303B and 303C. The virtual routers 303A, 303B, and 303C respectively have IP addresses 10.1.1.1, 10.1.1.2, and 10.1.1.3. The virtual routers are peered with static routing (i.e., an administrator configures the connections between the virtual routers). An administrator configures an inter-VR interface 315L.B on the virtual router 303A to reach the virtual router 303B and an inter-VR interface 315L.C also on the virtual router 303A to reach the virtual router 303C. While configuring the interfaces on the virtual router 303A, the administrator also configures inter-VR interfaces 315B.L and 315C.L respectively on the virtual routers 303B and 303C. In response to the configuration, the interior gateway routing tables of the virtual routers are updated.
[0036] An interior gateway routing tables 307A for the virtual router 303A is updated to include a routing entry that indicates destination 10.1.1.2 reachable via next hop VR-B and a destination 10.1.1.3 reachable via next hop VR-C. While in one embodiment, the next hops to a virtual router are indicated with a VR identifier, alternative embodiments of the invention may indicate a virtual router next hop with the virtual router's name or IP address.
[0037] An interior gateway routing tables 307B for the virtual router 303B is updated to include a routing entry that indicates a destination 10.1.1.1 reachable via inter-VR interface 315B.L, which is the VR identifier for the virtual router 303A. An interior gateway routing tables 307C for the virtual router 303C is updated to include a routing entry that indicates the destination 10.1.1.1 reachable via inter-VR interface 315C.L.
[0038] In an embodiment that processes packets sent over inter-VR interfaces with a single routing process, a packet can be processed without inter-process communication. For example, if RIP is configured on inter-VR interface 315L.B and the RIP process sends a packet over the inter-VR interface 315L.B, the RIP packet immediately considers the packet as received on the inter-VR interface 315B.L by the single RIP process. Routing processes (both interior and exterior gateway routing protocol processes) can exchange routing information via the inter-VR interfaces. The routing processes download these routes into the main routing table using inter-VR interfaces as next hops.
[0039] FIG. 3B is an exemplary diagram illustrating peering of virtual routers that are not virtual router local (virtual router 303A) according to one embodiment of the invention. In FIG. 3B , the virtual routers 303B and 303C have been connected. The virtual router 303B has been configured to reach the virtual router 303C via the inter-VR interface 315B.C and the virtual router 303C has been configured to reach the virtual router 303B via the inter-VR interface 315C.B. Various techniques can be implemented to prevent redundant connections being created between virtual routers. In one embodiment of the invention, a check is performed when the administrator enters a configuration that binds interfaces of two virtual routers.
[0040] In another embodiment of the invention, an inter-VR point-to-point (p2p) interface is utilized. The interface manager ensures only a single bind number is utilized to connect a pair of virtual routers, although alternative embodiments of the invention may allow for multiple connections between virtual routers. An interior gateway routing protocol process registers an interest in the configured interfaces for each virtual router with the interface manager. In response, the interface manager provides the registering interior gateway routing protocol process with the corresponding bind number, bound virtual router, and the type of interface. For example, assume the following configuration is entered:
-
- [0041] virtualrouter A
- [0042] interface I/F1 inter-VR-p2p bind1
- [0043] igp router networkA
- [0044] virtualrouter B
- [0045] interface I/F2 inter-VR-p2p bind1
- [0046] igp router networkB
[0047] The first set of configuration commands configures the interface I/F1 on the virtual router A. The second set of commands configures the interface I/F2 on the virtual router B. The interface manager creates a tuple that reflects the configuration of these interfaces on their corresponding virtual routers. When the interior gateway routing protocol process learns this inter-VR interface binding from the interface state manager, the interior gateway routing protocol process can do peering between VR-A and VR-B across this inter-VR interface as if VR-A and VR-B were two separate network elements.
[0048] FIG. 3C is an exemplary diagram illustrating inter-VR interfaces as local area network interfaces according to one embodiment of the invention. In FIG. 3C , each of the virtual routers 303A, 303B and 303C are connected to a virtual router local area network (VR-LAN) 323. The VR-LAN 323 is identified as VR-LAN-1. Although the virtual routers 303A, 303B and 303C are illustrated as being connected to the VR-LAN 323 for this example, fewer or more virtual routers may be connected to the VR-LAN. In addition, multiple VR-LANs can be defined with various different groups of virtual routers connected to the different VR-LANS. For example, VR-B, VR-C and VR-A may be connected to VR-LAN-1, while VR-A, VR-C are connected to VR-LAN-2. Alternatively, VR-LAN-1 may comprise VR-A, VR-B and VR-C while VR-LAN-2 may comprise VR-A, VR-B, and VR-C.
[0049] After the administrator configures VR-LAN interfaces 315L.V, 315B.V, and 315C.V respectively on the virtual routers 303A, 303B and 303C, the interior gateway routing protocol process registers an interest in the interface 315L.V for the virtual router 303A with the interface manager. The interface manager provides the registering interior gateway routing protocol process with the associated VR-LAN number, VR-LAN-1, which identifies the VR-LAN 323. While in one embodiment of the invention, the interior gateway routing protocol process accesses a data structure (e.g., a linked list) which indicates each VR-LAN interface associated with the VR-LAN identified by the interface manager, alternative embodiments of the invention may provide the interior gateway routing protocol process the associated VR-LAN interfaces differently (e.g., the interface manager may maintain a data structure that indicates the VR-LAN and associated VR-LAN interfaces). The interior gateway routing protocol process updates its interior gateway routing tables to indicate the associated VR-LAN interfaces as illustrated in FIG. 3C . In an alternative embodiment of the invention, the interior gateway routing protocol process accesses the VR-LAN data structure that indicates associated VR-LAN interfaces instead of inserting the data structure in the interior gateway routing table. When the interior gateway routing protocol process transmits a control packet, the interior gateway routing protocol processes transmits to each VR-LAN interface associated with the VR-LAN. After transmitting the control packet, the interior gateway routing protocol process marks the associated VR-LAN interfaces as received. For example, assume OSPF is configured on interfaces 315L.V, 315B.V, 315C.V. If OSPF sends a packet on 315B.V to the VR-LAN 323 for the VR-B 303B, the sent OSPF packet is implicitly received on the interfaces 315L.V and 315C.V. In an embodiment that implements a single routing process for more than one virtual router, the single routing process (e.g., OSPF) handles the sending and receiving without inter-process communication.
[0050] Regardless of the interface technique being used, packets forwarded between virtual routers are passed directly between virtual routers and not passed down for lower layer processing. In alternative embodiments of the invention, packets may be passed down for lower layer processing (e.g., to the kernel socket, which is a communication channel between routing processes and the data plane that includes line cards) to maintain agnostic routing or minimize the amount of modification made to routing protocols.
[0051] FIG. 4 is an exemplary diagram illustrating external route distribution between virtual routers according to one embodiment of the invention. In FIG. 4 , a virtual router 401 with IP address 10.1.1.1 is peered with virtual routers 403A and 403B via inter-VR interfaces 415L.B and 415L.C, respectively. The peering is established with either static routing or with interior gateway routing protocol process. The virtual routers 401, 403A and 403B respectively have exterior gateway routing tables 405, 407A and 407B. The bolded entries in the exterior gateway routing tables 405, 407A, and 407B have been learned from other virtual routers.
[0052] The virtual router 401 has learned routes to external destinations ED2 and ED7 directly from virtual routers 403A and 403B, respectively. The virtual router 403A has learned routes to external destinations ED1 and ED7 from the virtual router 401. The virtual router 403B has learned routes to external destinations ED1, ED2, and ED5 from the virtual router 401.
[0053] Various route distribution policies can be applied to distribution of routes between virtual routers. If a customer does not want routes from its virtual router distributed, then the customer's virtual router should not be peered with any other virtual routers that do not fall under the customer's control. A policy may be implemented on a network element that allows the virtual router local to learn routes but not distribute routers. Alternatively, certain routes may be tagged as either restricted or unrestricted for inter-VR route distribution.
[0054] FIG. 5 is a diagram of an exemplary network element according to one embodiment of the invention. In FIG. 5 , a network element 500 includes a control card 503 coupled with a set of line cards 515A-515C via a transmission medium 551 (e.g., a packet mesh, switching medium, etc.). The control card 503 hosts external routing processes 505A-505F and corresponding exterior gateway routing tables 507A-507F. The control card 503 also hosts internal routing processes 506A-506F and corresponding interior gateway routing tables 509A-509F. Each of the internal routing processes 506A-506F and their corresponding VR interior gateway routing tables 509A-509F are used by a different virtual router configured on the network element 500. Each of the external routing processes 505A-505F and their corresponding VR exterior gateway routing tables 507A-507F are used by the different virtual router configured on the network element 500.
[0055] Each of the line cards 515A-515C include one or more forwarding tables. The line card 515A includes VR forwarding tables 517A-517F. The line card 515B includes VR forwarding tables 517B-517E. The line card 515C includes the VR forwarding table 517A. The forwarding tables 517A-517F are created from forwarding information downloaded from the control card 503. Each of the VR forwarding tables corresponds to a different virtual router configured on the network element 500. In an alternative embodiment of the invention, a virtual router uses more than one VR forwarding table, VR interior gateway routing table, and/or VR exterior gateway routing table. In another alternative embodiment of the invention, a single external and/or internal routing process is shared by different virtual routers.
[0056] The control card 503 and line cards 517A - 517C illustrated in FIG. 5 and the network elements described in the Figures include memories, processors, and/or ASICs. Such memories include a machine-readable medium on which is stored a set of instructions (i.e., software) embodying any one, or all, of the methodologies described herein. Software can reside, completely or at least partially, within this memory and/or within the processor and/or ASICs. For the purpose of this specification, the term “machine-readable medium” shall be taken to include any mechanism that provides (i.e., stores and/or transmits) information in a form readable by a machine (e.g., a computer). For example, a machine-readable medium includes machine readable storage media (e.g., read only memory (“ROM”), random access memory (“RAM”), magnetic disk storage media, optical storage media, flash memory devices), machine readable transmission media (e.g., electrical, optical, acoustical, or other forms of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.)), etc.
[0057] While the invention has been described in terms of several embodiments, those skilled in the art will recognize that the invention is not limited to the embodiments described. The method and apparatus of the invention can be practiced with modification and alteration within the spirit and scope of the appended claims The description is thus to be regarded as illustrative instead of limiting on the invention.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
I claim:
1. A non-transitory computer-readable storage medium that provides instructions which, when executed by a set of one or more processors, cause said set of processors to perform operations within a single network element comprising:
instantiating a first and second virtual router in the single network element;
indicating for a route a first logical interface as a next hop for a destination, wherein a logical interface couples virtual routers internally within the single network element, said first logical interface identifying the first virtual router, said first virtual router including a first routing table;
inserting said route into a second routing table of the second virtual router, wherein said first routing table is for a first address space different than the second routing table's address space and the first routing table has different content than the second routing table;
forwarding packets directly from the second virtual router to the first virtual router with the logical interface without lower layer processing.
2. The computer-readable storage medium of claim 1 further comprising:
indicating for a second route a second logical interface as a second next hop for a second destination, said second logical interface identifying the second virtual router;
inserting said second route into the first routing table; and
exchanging route information between the first and second virtual routers via the second and first logical interfaces.
3. The computer-readable storage medium of claim 1 further comprising downloading the destination and the first logical interface to a data plane.
4. The computer-readable storage medium of claim 1 further comprising:
transmitting a packet from the second virtual router to a third virtual router via a second logical interface that identifies a virtual local area network (VLAN); and
receiving the packet on a third logical interface associated with the VLAN and the third virtual router.
5. A non-transitory computer-readable storage medium that provides instructions, which, when executed by a set of one or more processors, cause said set of processors to perform operations within a single network element comprising:
instantiating a first and second virtual router in the single network element;
peering the first virtual router to the second virtual router through a first logical interface, wherein the first logical interface couples the first and second virtual routers internally within the single network element, the first and second virtual routers have separate address spaces and separate routing tables, and the routing table for the first virtual router has different content that the routing table for the second virtual router;
distributing a set of one or more routes from the first virtual router to the second virtual router, wherein a first of the set of routes identifies the first virtual router as a next hop of the first route, said first route including a destination;
downloading to a set of one or more forwarding tables, the destination and the next hop; and
forwarding packets directly from the second virtual router to the first virtual router with the logical interface without lower layer processing.
6. The computer-readable storage medium of claim 5 wherein said peering comprises:
generating the first logical interface that indicates the first virtual router;
generating a second logical interface that indicates the second virtual router;
associating the first logical interface with the second virtual router; and
associating the second logical interface with the first virtual router.
7. The computer-readable storage medium of claim 6 further comprising a routing protocol process exchanging routing information via the first and second logical interlaces.
8. The computer-readable storage medium of claim 5 wherein the next hop is a logical interface that indicates the first virtual router.
9. The computer-readable storage medium of claim 5 wherein the next hop is the first virtual router's identifier.
10. The computer-readable storage medium of claim 5 further comprising associating the first and second virtual routers with a virtual local area network (VLAN).
11. The computer-readable storage medium of claim 10 wherein said associating comprises:
generating in said second virtual router's routing table a first route that includes said VLAN as a destination and the first logical interface that indicates said first virtual router; and
generating in said first virtual router's routing table a second route that includes said VLAN as a destination and a second logical interface that indicates said second virtual router.
12. The computer-readable storage medium of claim 10 further comprising said first and second virtual routers exchanging routing information via the VLAN.
13. A non-transitory computer-readable storage medium that provides instructions which, when executed by a set of one or more processors, cause said set of processors to perform operations within a single network element comprising:
instantiating a first and second virtual router in the single network element;
inserting in a first virtual router's routing table a route, said route indicating a destination and a logical interface, wherein the logical interface couples virtual routers internally within the single network element, said logical interface identifying a second virtual router, wherein said first virtual router corresponds to a first address space different from a second address space that corresponds to the second virtual router and the first routing table has different content than the second routing table;
downloading the route to a forwarding table; and
forwarding packets directly from the first virtual router to the second virtual router with the logical interface without lower layer processing.
14. The computer-readable storage medium of claim 13 wherein said logical interface is the second virtual router's identifier.
15. The computer-readable storage medium of claim 13 further comprising said first virtual router exchanges routing information with said second virtual router via said route.
16. The computer-readable storage medium of claim 13 further comprising forwarding a packet from said first virtual router to said second virtual router in accordance with said logical interface indicated in said forwarding table.
Patent Citations (44)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5550816(A) | 1996-08-01 | Hardwick et al. | Examiner |
| US5920699(A) | 1999-07-01 | Bare | Applicant |
| US6148411(A) | 2000-11-01 | Ichinohe et al. | Applicant |
| US6151635(A) | 2000-11-01 | Bare | Applicant |
| US6192051(B1) | 2001-02-01 | Lipman et al. | Applicant |
| US6205488(B1) | 2001-03-01 | Casey et al. | Applicant |
| US6397260(B1) | 2002-05-01 | Wils et al. | Applicant |
| US6496510(B1) | 2002-12-01 | Tsukakoshi et al. | Examiner |
| US6556547(B1) | 2003-04-01 | Srikanth et al. | Applicant |
| US6560236(B1) | 2003-05-01 | Varghese et al. | Examiner |
| US6597699(B1) | 2003-07-01 | Ayres | Applicant |
| US6609153(B1) | 2003-08-01 | Salkewicz | Applicant |
| US6674756(B1) | 2004-01-01 | Rao et al. | Applicant |
| US6907039(B2) | 2005-06-01 | Shen | Applicant |
| US7085827(B2) | 2006-08-01 | Ishizaki et al. | Applicant |
| US7133365(B2) | 2006-11-01 | Klinker et al. | Examiner |
| US7209976(B2) | 2007-04-01 | Folkes et al. | Examiner |
| US7242665(B2) | 2007-07-01 | Langille et al. | Examiner |
| US7260648(B2) | 2007-08-01 | Tingley et al. | Examiner |
| US7272643(B1) | 2007-09-01 | Sarkar et al. | Applicant |
| US7274704(B1) | 2007-09-01 | Ould-Brahim et al. | Applicant |
| US7464152(B2) | 2008-12-01 | Ishizaki et al. | Applicant |
| US7715381(B2) | 2010-05-01 | Shen | Examiner |
| US7769862(B2) | 2010-08-01 | Singh et al. | Examiner |
| US2001/0048661(A1) | 2001-12-01 | Clear et al. | Examiner |
| US2002/0067725(A1) | 2002-06-01 | Oguchi et al. | Examiner |
| US2002/0097730(A1) | 2002-07-01 | Langille et al. | Examiner |
| US2002/0099849(A1) | 2002-07-01 | Alfieri et al. | Examiner |
| US2002/0133534(A1) | 2002-09-01 | Forslow | Examiner |
| US2002/0184387(A1) | 2002-12-01 | Yamaya et al. | Examiner |
| US2003/0051048(A1) | 2003-03-01 | Watson et al. | Applicant |
| US2003/0123446(A1) | 2003-07-01 | Muirhead et al. | Examiner |
| US2003/0126233(A1) | 2003-07-01 | Bryers et al. | Examiner |
| US2003/0169747(A1) | 2003-09-01 | Wang | Applicant |
| US2004/0073715(A1) | 2004-04-01 | Folkes et al. | Examiner |
| US2004/0076160(A1) | 2004-04-01 | Phaltankar | Examiner |
| US2004/0165581(A1) | 2004-08-01 | Oogushi | Examiner |
| US2004/0233913(A1) | 2004-11-01 | Shen | Applicant |
| US2004/0240429(A1) | 2004-12-01 | Shen | Applicant |
| US2004/0240455(A1) | 2004-12-01 | Shen | Applicant |
| US2005/0281249(A1) | 2005-12-01 | Chander et al. | Examiner |
| US2007/0183421(A1) | 2007-08-01 | Terrell et al. | Examiner |
| WOPCT/US03/20456 | 2003-11-01 | Applicant | |
| WOPCT/US03/20456 | 2004-05-01 | Applicant |
Non-Patent Literature (24)
- Gopal L., Ram, “Seperation of Control and Forwarding Plane Inside a Network Element,” Nokia Research Center, 0-7803-7600-5/02/$17.00 © 2002 IEEE, pp. 161-166.Applicant
- Gopal, Ram, “Forwarding Element Model draft-gopal-forces-femodel-00.txt.,” Internet Draft, Nokia, Feb. 2002, Expires Aug. 2002, http://www3.tools.ietf.org/html/draft-gopal-forces-femodel-00, (Aug. 28, 2007), pp. 1-13.Applicant
- Yu, Jessica, “Network Based IP VPN Architecture Using Virtual Routers”, Feb. 19, 2001, CoSineCommunications, all slides.Applicant
- Aweya, “On the design of IP routers. Part 1: Router Architectures”, Apr. 2000, Journal of Systems Architecture, vol. 46, Issue 6, pp. 483-511.Applicant
- Bjorkman, N. et al., “Open control of partitioned switches”, Jun. 26-29, 2000, IEEE, ISBN: 0-7803-5884-8, pp. 549-556.Applicant
- McDysan, D. et al., “Multiservice networking using a component-based switch and router architecture”, Jun. 26-29, 2000, IEEE, pp. 97-104.Applicant
- White, “Catalyst 8500 CSR Architecture”, 1988, Cisco Systems, pp. 1-19.Applicant
- Non-Final Office Action, U.S. Appl. No. 10/265,789, dated Oct. 27, 2003, 10 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 10/265,789, dated Apr. 19, 2004, 5 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 10/265,789, dated Apr. 5, 2005, 5 pages.Applicant
- Non-Final Office Action, U.S. Appl. No. 10/883,109, dated Aug. 21, 2007, 9 pages.Applicant
- Non-Final Office Action, U.S. Appl. No. 10/883,109, dated Feb. 22, 2008, 16 pages.Applicant
- Final Office Action, U.S. Appl. No. 10/883,109, dated Sep. 3, 2008, 12 pages.Applicant
- Non-Final Office Action, U.S. Appl. No. 10/883,109, dated Jan. 28, 2009, 10 pages.Applicant
- Final Office Action, U.S. Appl. No. 10/883,109, dated Sep. 11, 2009, 12 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 10/883,109, dated Dec. 29, 2009, 5 pages.Applicant
- Non-Final Office Action, U.S. Appl. No. 10/883,425, dated Sep. 17, 2007, 10 pages.Applicant
- Non-Final Office Action, U.S. Appl. No. 10/883,425, dated May 13, 2008, 15 pages.Applicant
- Final Office Action, U.S. Appl. No. 10/883,425, dated Oct. 29, 2008, 12 pages.Applicant
- Non-Final Office Action, U.S. Appl. No. 10/883,425, dated Apr. 28, 2009, 13 pages.Applicant
- Final Office Action, U.S. Appl. No. 10/883,425, dated Nov. 2, 2009, 18 pages.Applicant
- Non-Final Office Action, U.S. Appl. No. 10/883,425, dated Mar. 2, 2010, 17 pages.Applicant
- Final Office Action, U.S. Appl. No. 10/883,425, dated Jul. 20, 2010, 13 pages.Applicant
- Non-Final Office Action for U.S. Appl. No. 10/883,425, dated Jan. 21, 2011, 17 pages.Applicant