US20100284407A1 - Nexthop to a forwarding table - Google Patents
Nexthop to a forwarding table Download PDFInfo
- Publication number
- US20100284407A1 US20100284407A1 US12/842,210 US84221010A US2010284407A1 US 20100284407 A1 US20100284407 A1 US 20100284407A1 US 84221010 A US84221010 A US 84221010A US 2010284407 A1 US2010284407 A1 US 2010284407A1
- Authority
- US
- United States
- Prior art keywords
- router
- forwarding
- forwarding table
- packets
- vpn
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/742—Route cache; Operation thereof
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/54—Organization of routing tables
Definitions
- a network infrastructure made up of interconnected nodes, such as routers and/or switches, connected by communication links such as optical fiber, copper cable, and wireless links.
- nodes such as routers and/or switches
- communication links such as optical fiber, copper cable, and wireless links.
- the topology of the network infrastructure is configured in such a way that the infrastructure contains more than one path through which data may be carried from one computer to another.
- the topology may include a partial mesh configuration, where a node is connected to multiple other nodes.
- a router in such a network therefore, may contain a plurality of interface ports for connection to multiple neighboring routers.
- Such a router typically receives data in discrete units (herein referred to as “packets,” which may include frames, cells, packets, or any other fixed- or variable-sized unit of data) at one or more of its ingress interface ports.
- packets discrete units
- the router examines destination address information embedded in the packets and determines the appropriate egress interface ports for outputting the respective packets, typically by performing a table lookup.
- routers may use dynamic routing protocols to systematically exchange information with other devices in the network to obtain a view of the network topology (this information being maintained in a routing database, such as one or more routing tables). Based on this information, the router constructs and updates a forwarding table, which associates ranges of destination addresses to respective egress interface ports.
- a router may use more than one forwarding table for forwarding packets.
- a router carrying traffic for both a virtual private network (“VPN”) and a public network may use one forwarding table for VPN traffic and a different forwarding table for public network traffic.
- the router has a set of ingress and egress interface ports dedicated to carrying VPN traffic and a set of ingress and egress interface ports dedicated to carrying public traffic. The router distinguishes traffic according to which ingress interface port respective packets are received at.
- Such an approach does not permit the router to pass packets from the VPN to the public network and vice-versa.
- One approach for permitting such passing is to include static routes in the VPN forwarding table, which contain nexthops to interfaces connected to the public network. Static routes, however, do not allow dynamic updates if changes in the network occur.
- a route lookup processor in a router receives destination address information for a packet and determines, among entries in a first forwarding table, a closest match for the received destination address information.
- the route lookup processor receives a pointer to a second forwarding table in accordance with the closest match determined in the first forwarding table and determines, among entries in the second forwarding table, a closest match for the received destination address information.
- FIG. 1A is a block diagram of a router incorporating principles of the invention according to a first embodiment
- FIG. 1B is a block diagram of a router incorporating principles of the invention according to a second embodiment
- FIG. 2 illustrates an example of two forwarding tables which may be used in a router (or other packet forwarding device) according to the invention
- FIG. 3 is a flow diagram of a process for setting up forwarding tables in a router according to the invention.
- FIG. 4 is a flow diagram of a process for the operation of a router according to the invention.
- FIG. 5 illustrates an example of a network in which the invention may be used
- a router may use two or more forwarding tables for packet forwarding.
- at least one of the tables includes at least one entry containing a pointer to another table. After the pointer is returned in response to a first lookup operation, a second lookup operation is performed in the forwarding table identified by the pointer.
- FIG. 1A shows router 100 .
- router 100 receives packets on the input lines and determines the output lines from which the packets are to be output.
- router 100 includes a plurality of interface (I/F) modules 110 , switch fabric(s) 120 , route lookup module(s) 130 , and routing engine 140 .
- I/F module 110 connects to one or more respective input lines and/or output lines.
- Each I/F module 110 contains one or more ingress interface ports (not shown) for receiving packets from respective input lines and/or one or more egress interface ports (also not shown) for transmitting packets to respective output lines.
- I/F module 110 may perform processing on the headers of respective packets (e.g., layer 2 / 3 header processing) so the packets are in the appropriate format for processing through switch fabric 120 (for packets received at the ingress interface ports) and for transmission over the output lines (for packets to be sent out the egress interface ports).
- I/F modules 110 are implemented as circuit boards that are insertable and removable from router 100 . One or more I/F modules 110 may be inserted at a time.
- Switch 120 contains logic for receiving packets from I/F modules 110 and for transmitting packets out to I/F modules 110 .
- switch fabric 120 may contain buffer memory for storing received packets.
- switch fabric may be a cross-connect connecting sets of I/F modules 110 with buffer memory contained in respective I/F modules 110 .
- Switch fabric 120 preferably provides packet header information (e.g. destination address information) for received packets to route lookup module 130 and receives identifiers specifying which egress interface ports in the I/F modules 110 to forward the packets to.
- packet header information e.g. destination address information
- Each of route lookup module(s) 130 examines characteristics of packets flowing through switch fabric 120 to determine the manner in which the packets are to be forwarded (e.g., determining the egress interface ports from which respective packets are to be output).
- route lookup module 130 examines packet header information for respective packets, which may include performing table lookups using one or more forwarding tables.
- route lookup module 130 includes a lookup processor and open or more forwarding tables stored in memory. The lookup processor may be implemented in hardware as circuit logic for carrying out the respective operation or as one or more processors programmed to carry out the operation.
- Routing engine 140 maintains a database of routing information which may be received in routing messages from other routers using routing protocols. Routing engine 140 preferably generates forwarding tables which are transmitted to route lookup module 130 . Routing engine 140 systematically receives updated information reflecting changes in the network, updates its database (which may be stored as routing tables), generates one or more forwarding tables from the database, and transmits the forwarding table to route lookup module 130 . Routing engine 140 preferably comprises a processor executing routing protocols for computing routes and/or network topology.
- FIG. 1B is a block diagram of router 102 .
- Router 102 is similar to router 100 , except that each I/F module 110 has a corresponding route lookup module 130 connected to it.
- routing engine 140 connects to each of the route lookup modules 130 .
- Router 102 operates in a manner similar to router 100 , except that a lookup operation is performed by the route lookup module 130 corresponding to the I/F module 110 at which packets are received.
- I/F modules 110 provide packet header information to the corresponding route lookup modules 130 and receive egress interface port information for each packet.
- I/F modules 110 transmit the packets and received egress interface port information to switch fabric 120 , which forwards the packets to the appropriate I/F modules 110 .
- each I/F module 110 in router 102 may contain buffer memory for storing packets.
- FIGS. 1A and 1B show different embodiments of routers that may be used with the invention.
- the invention may be used with other router or switch architectures or in any device that performs packet forwarding.
- FIG. 2 shows an example of two forwarding tables which may be used in a router (or other packet forwarding device) according to the invention.
- forwarding table 1 contains a plurality of entries, each associating a range of addresses (shown as “prefix”) to a corresponding nexthop (which may include egress interface port identifiers and/or addresses of neighboring nodes). At least one of the entries in forwarding table 1 contains a nexthop that points to forwarding table 2 .
- a lookup processor determines a closest match between the received destination address and a prefix in forwarding table 1 . In the example shown in FIG.
- the closest match is the entry containing prefix 20 / 8 .
- the nexthop contained in that entry points to forwarding table 2 .
- the lookup processor then performs a lookup operation in forwarding table 2 to determine the closest match between the destination address and a prefix in forwarding table 2 .
- the closest match is 20 / 8 , which is associated with egress interface port identifier 2 . 2 . 2 . 2 .
- lookup techniques other than closest match may be used.
- other types of entries may be included in these tables.
- FIG. 2 shows two forwarding tables with one entry in forwarding table 1 containing a pointer to forwarding table 2 .
- each forwarding table may contain one or more pointers to other forwarding tables.
- Each forwarding table may also have a default entry which is selected if none of the other entries adequately satisfies the closest match determination.
- each entry in a table may associate address ranges (prefixes) to not only egress interface port identifiers, but also addresses of the neighboring nodes (e.g., nexthops) to which the respective packet is to be forwarded. This may be used, for example, if the egress interface port is an Ethernet port.
- the forwarding tables and their entries may use different types of data and may arrange them in different data structures.
- one or more levels of indirection could be incorporated.
- the forwarding tables could associate address ranges to pointers to entries in a nexthop resolution table.
- the nexthop resolution table contains entries associating nexthop identifiers to actions to be performed (such as forwarding a packet to a particular egress interface port or performing a lookup in another table). Alternatively, these entries could also perform another level of indirection to another table.
- FIG. 3 is a flow diagram of a process for creating forwarding tables in a router (such as router 100 or 102 ).
- the router provides a first forwarding table (step 310 ).
- the first forwarding table contains entries associating ranges of addresses to nexthops in a first network and one or more entries associating a range of one or more addresses with a pointer that identifies the second forwarding table.
- the router provides the second forwarding table containing entries that associate ranges of addresses to nexthops in a second network (step 320 ).
- additional forwarding tables may be provided and entries in each table may associate address ranges with pointers to any of the other tables.
- the router advertises public addresses for devices in the first network to the second network (step 330 ).
- the router provides one or more entries in the second forwarding table associating public addresses for devices in the first network to nexthops corresponding to the second network (step 340 ). This allows the router to forward packets from devices in the second network directly to devices in the first network using the second component in a forwarding table.
- the second forwarding table could contain entries with pointers to the first forwarding table.
- FIG. 4 shows a flow diagram of a process for the operation of a component in a router (such as router 100 or 102 ).
- the component receives destination address information for a packet (step 410 ).
- the component determines a closest match to the destination address information in a first forwarding table (step 420 ).
- the component receives an egress interface port identifier in response to the closest match (step 450 ).
- the component may also receive the address of the neighboring router to which the packet is to be sent.
- lookup techniques other than closest match may be used.
- FIG. 5 shows an example of a network in which the invention may be used.
- an open access network such as the public Internet
- contains three routers at its edge (router 510 , router 512 , and router 514 ).
- Each of these routers not only carries traffic for the open access network, but also for one or more virtual private networks (VPNs).
- Router 510 for example, carries traffic for the open access network, as well as for VPN A and VPN B.
- Router 512 carries traffic for the open access network and VPN A
- router 514 carries traffic for the open access network and VPN B.
- Routers 510 , 512 , and 514 may be similar to router 100 (described in connection with FIG. 1A ) or router 102 (described in connection with FIG. 1B ).
- router 510 contains three forwarding tables.
- the first table is for VPN A traffic
- the second table is for VPN B traffic
- the third table is a master table for the open access network.
- Router 510 uses the table for VPN A to perform lookups for packets received on ingress interface ports dedicated to VPN A and to forward the packets to egress interface ports dedicated to VPN A.
- Router 510 uses the table for VPN B in a similar fashion for interface ports dedicated to VPN B.
- Router 510 uses the master table to perform lookups for packets received at ingress interface ports dedicated to the open access network and to forward the packets to any of the egress interface ports.
- public addresses for devices in VPN A and VPN B are advertised to the open access network and are included in the master table.
- the lookup processor can use the master table to determine a corresponding egress interface port, which may be dedicated to any of VPN A, VPN B, or the open access network.
- the forwarding table for VPN A may contain one or more entries with pointers to the master table. This allows packets received at ingress interface ports dedicated to VPN A to be forwarded into the open access network by performing a lookup operation on the table for VPN A and then a lookup operation on the master table.
- the forwarding table for VPN A may also have one or more entries with pointers to the forwarding table for VPN B, allowing packets to be forwarded from the VPN A network to the VPN B network through lookups in the VPN A forwarding table and in the VPN B forwarding table.
- Routers 512 and 514 contain forwarding tables for VPN A traffic and the open access network and forwarding tables for VPN B traffic and the open access network, respectively. As with router 510 , one or more forwarding tables in each of routers 512 and 514 may contain one or more entries with pointers to other tables.
Abstract
A router receives destination address information for a packet and determines, among entries in a first forwarding table, a closest match for the received destination address information. The router receives a pointer to a second forwarding table in accordance with the closest match determined in the first forwarding table and determines, among entries in the second forwarding table, a closest match for the received destination address information.
Description
- This application claims the benefit of U.S. Provisional Application Ser. No. 60/345,663; entitled “NEXTHOP TO A FORWARDING TABLE,” filed on Jan. 2, 2002, which is incorporated by reference herein.
- In a conventional computer network (e.g., the Internet), computers communicate over a network infrastructure made up of interconnected nodes, such as routers and/or switches, connected by communication links such as optical fiber, copper cable, and wireless links. Typically, the topology of the network infrastructure is configured in such a way that the infrastructure contains more than one path through which data may be carried from one computer to another. The topology, for example, may include a partial mesh configuration, where a node is connected to multiple other nodes. A router in such a network, therefore, may contain a plurality of interface ports for connection to multiple neighboring routers.
- Such a router typically receives data in discrete units (herein referred to as “packets,” which may include frames, cells, packets, or any other fixed- or variable-sized unit of data) at one or more of its ingress interface ports. The router examines destination address information embedded in the packets and determines the appropriate egress interface ports for outputting the respective packets, typically by performing a table lookup. To construct and update tables, routers may use dynamic routing protocols to systematically exchange information with other devices in the network to obtain a view of the network topology (this information being maintained in a routing database, such as one or more routing tables). Based on this information, the router constructs and updates a forwarding table, which associates ranges of destination addresses to respective egress interface ports.
- In some cases, a router may use more than one forwarding table for forwarding packets. For example, a router carrying traffic for both a virtual private network (“VPN”) and a public network (such as the Internet) may use one forwarding table for VPN traffic and a different forwarding table for public network traffic. The router has a set of ingress and egress interface ports dedicated to carrying VPN traffic and a set of ingress and egress interface ports dedicated to carrying public traffic. The router distinguishes traffic according to which ingress interface port respective packets are received at.
- Such an approach, however, does not permit the router to pass packets from the VPN to the public network and vice-versa. One approach for permitting such passing is to include static routes in the VPN forwarding table, which contain nexthops to interfaces connected to the public network. Static routes, however, do not allow dynamic updates if changes in the network occur.
- Thus, there is a need for an invention that more adequately addresses problems occurring in the network.
- It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.
- In one embodiment of the invention, a route lookup processor in a router receives destination address information for a packet and determines, among entries in a first forwarding table, a closest match for the received destination address information. The route lookup processor receives a pointer to a second forwarding table in accordance with the closest match determined in the first forwarding table and determines, among entries in the second forwarding table, a closest match for the received destination address information.
- The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate several embodiments of the invention and together with the description, serve to explain the principles of the invention.
-
FIG. 1A is a block diagram of a router incorporating principles of the invention according to a first embodiment; -
FIG. 1B is a block diagram of a router incorporating principles of the invention according to a second embodiment; -
FIG. 2 illustrates an example of two forwarding tables which may be used in a router (or other packet forwarding device) according to the invention; -
FIG. 3 is a flow diagram of a process for setting up forwarding tables in a router according to the invention; -
FIG. 4 is a flow diagram of a process for the operation of a router according to the invention. -
FIG. 5 illustrates an example of a network in which the invention may be used; - Reference will now be made in detail to preferred embodiments of the invention, examples of which are illustrated in the accompanying drawings. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.
- As described in greater detail below, a router may use two or more forwarding tables for packet forwarding. According to the invention, at least one of the tables includes at least one entry containing a pointer to another table. After the pointer is returned in response to a first lookup operation, a second lookup operation is performed in the forwarding table identified by the pointer.
-
FIG. 1A showsrouter 100. Generally,router 100 receives packets on the input lines and determines the output lines from which the packets are to be output. As shown inFIG. 1A ,router 100 includes a plurality of interface (I/F)modules 110, switch fabric(s) 120, route lookup module(s) 130, androuting engine 140. Each I/F module 110 connects to one or more respective input lines and/or output lines. - Each I/
F module 110 contains one or more ingress interface ports (not shown) for receiving packets from respective input lines and/or one or more egress interface ports (also not shown) for transmitting packets to respective output lines. I/F module 110 may perform processing on the headers of respective packets (e.g.,layer 2/3 header processing) so the packets are in the appropriate format for processing through switch fabric 120 (for packets received at the ingress interface ports) and for transmission over the output lines (for packets to be sent out the egress interface ports). In one embodiment, I/F modules 110 are implemented as circuit boards that are insertable and removable fromrouter 100. One or more I/F modules 110 may be inserted at a time. - Switch 120 contains logic for receiving packets from I/
F modules 110 and for transmitting packets out to I/F modules 110. In one embodiment,switch fabric 120 may contain buffer memory for storing received packets. In another embodiment, switch fabric may be a cross-connect connecting sets of I/F modules 110 with buffer memory contained in respective I/F modules 110. Switchfabric 120 preferably provides packet header information (e.g. destination address information) for received packets toroute lookup module 130 and receives identifiers specifying which egress interface ports in the I/F modules 110 to forward the packets to. - Each of route lookup module(s) 130 examines characteristics of packets flowing through
switch fabric 120 to determine the manner in which the packets are to be forwarded (e.g., determining the egress interface ports from which respective packets are to be output). In one embodiment,route lookup module 130 examines packet header information for respective packets, which may include performing table lookups using one or more forwarding tables. In one embodiment,route lookup module 130 includes a lookup processor and open or more forwarding tables stored in memory. The lookup processor may be implemented in hardware as circuit logic for carrying out the respective operation or as one or more processors programmed to carry out the operation. - Routing
engine 140 maintains a database of routing information which may be received in routing messages from other routers using routing protocols.Routing engine 140 preferably generates forwarding tables which are transmitted toroute lookup module 130. Routingengine 140 systematically receives updated information reflecting changes in the network, updates its database (which may be stored as routing tables), generates one or more forwarding tables from the database, and transmits the forwarding table toroute lookup module 130.Routing engine 140 preferably comprises a processor executing routing protocols for computing routes and/or network topology. -
FIG. 1B is a block diagram ofrouter 102.Router 102 is similar torouter 100, except that each I/F module 110 has a correspondingroute lookup module 130 connected to it. In addition,routing engine 140 connects to each of theroute lookup modules 130.Router 102 operates in a manner similar torouter 100, except that a lookup operation is performed by theroute lookup module 130 corresponding to the I/F module 110 at which packets are received. I/F modules 110 provide packet header information to the correspondingroute lookup modules 130 and receive egress interface port information for each packet. I/F modules 110 transmit the packets and received egress interface port information to switchfabric 120, which forwards the packets to the appropriate I/F modules 110. To carry out this operation, each I/F module 110 inrouter 102 may contain buffer memory for storing packets. -
FIGS. 1A and 1B show different embodiments of routers that may be used with the invention. In alternative embodiments, the invention may be used with other router or switch architectures or in any device that performs packet forwarding. -
FIG. 2 shows an example of two forwarding tables which may be used in a router (or other packet forwarding device) according to the invention. As shown inFIG. 2 , forwarding table 1 contains a plurality of entries, each associating a range of addresses (shown as “prefix”) to a corresponding nexthop (which may include egress interface port identifiers and/or addresses of neighboring nodes). At least one of the entries in forwarding table 1 contains a nexthop that points to forwarding table 2. When a destination address is received by the route lookup module, a lookup processor (not shown) determines a closest match between the received destination address and a prefix in forwarding table 1. In the example shown inFIG. 2 , the closest match is the entry containing prefix 20/8. The nexthop contained in that entry points to forwarding table 2. The lookup processor then performs a lookup operation in forwarding table 2 to determine the closest match between the destination address and a prefix in forwarding table 2. In this example, the closest match is 20/8, which is associated with egress interface port identifier 2.2.2.2. In alternative embodiments, lookup techniques other than closest match may be used. In addition, other types of entries may be included in these tables. -
FIG. 2 shows two forwarding tables with one entry in forwarding table 1 containing a pointer to forwarding table 2. In other embodiments, more than two forwarding tables may be used and each forwarding table may contain one or more pointers to other forwarding tables. Each forwarding table may also have a default entry which is selected if none of the other entries adequately satisfies the closest match determination. In addition, each entry in a table may associate address ranges (prefixes) to not only egress interface port identifiers, but also addresses of the neighboring nodes (e.g., nexthops) to which the respective packet is to be forwarded. This may be used, for example, if the egress interface port is an Ethernet port. - In other embodiments, the forwarding tables and their entries may use different types of data and may arrange them in different data structures. For example, rather than including interface port identifiers and table pointers directly in the forwarding tables, one or more levels of indirection could be incorporated. For example, the forwarding tables could associate address ranges to pointers to entries in a nexthop resolution table. The nexthop resolution table contains entries associating nexthop identifiers to actions to be performed (such as forwarding a packet to a particular egress interface port or performing a lookup in another table). Alternatively, these entries could also perform another level of indirection to another table.
-
FIG. 3 is a flow diagram of a process for creating forwarding tables in a router (such asrouter 100 or 102). In this process, the router provides a first forwarding table (step 310). The first forwarding table contains entries associating ranges of addresses to nexthops in a first network and one or more entries associating a range of one or more addresses with a pointer that identifies the second forwarding table. The router provides the second forwarding table containing entries that associate ranges of addresses to nexthops in a second network (step 320). In alternative embodiments, additional forwarding tables may be provided and entries in each table may associate address ranges with pointers to any of the other tables. - The router advertises public addresses for devices in the first network to the second network (step 330). The router provides one or more entries in the second forwarding table associating public addresses for devices in the first network to nexthops corresponding to the second network (step 340). This allows the router to forward packets from devices in the second network directly to devices in the first network using the second component in a forwarding table. In an alternative embodiment, the second forwarding table could contain entries with pointers to the first forwarding table.
-
FIG. 4 shows a flow diagram of a process for the operation of a component in a router (such asrouter 100 or 102). The component receives destination address information for a packet (step 410). The component determines a closest match to the destination address information in a first forwarding table (step 420). In response to the determined closest match, the component receives a pointer to a second forwarding table (step 430). The component determines a closest match to the destination address information in the second forwarding table (step 440). The component then receives an egress interface port identifier in response to the closest match (step 450). In appropriate cases (such as where the egress interface port is an Ethernet port), the component may also receive the address of the neighboring router to which the packet is to be sent. In alternative embodiments, lookup techniques other than closest match may be used. -
FIG. 5 shows an example of a network in which the invention may be used. As shown inFIG. 5 , an open access network (such as the public Internet) contains three routers at its edge (router 510,router 512, and router 514). Each of these routers not only carries traffic for the open access network, but also for one or more virtual private networks (VPNs).Router 510, for example, carries traffic for the open access network, as well as for VPN A andVPN B. Router 512 carries traffic for the open access network and VPN A, androuter 514 carries traffic for the open access network andVPN B. Routers FIG. 1A ) or router 102 (described in connection withFIG. 1B ). - As shown in
FIG. 5 ,router 510 contains three forwarding tables. The first table is for VPN A traffic, the second table is for VPN B traffic, and the third table is a master table for the open access network.Router 510 uses the table for VPN A to perform lookups for packets received on ingress interface ports dedicated to VPN A and to forward the packets to egress interface ports dedicated toVPN A. Router 510 uses the table for VPN B in a similar fashion for interface ports dedicated toVPN B. Router 510 uses the master table to perform lookups for packets received at ingress interface ports dedicated to the open access network and to forward the packets to any of the egress interface ports. As described in further detail in connection withFIG. 3 , public addresses for devices in VPN A and VPN B are advertised to the open access network and are included in the master table. When packets come in from the open access network, the lookup processor can use the master table to determine a corresponding egress interface port, which may be dedicated to any of VPN A, VPN B, or the open access network. - One or more of the tables contained in
router 510 contain entries with pointers to another table. For example, the forwarding table for VPN A may contain one or more entries with pointers to the master table. This allows packets received at ingress interface ports dedicated to VPN A to be forwarded into the open access network by performing a lookup operation on the table for VPN A and then a lookup operation on the master table. The forwarding table for VPN A may also have one or more entries with pointers to the forwarding table for VPN B, allowing packets to be forwarded from the VPN A network to the VPN B network through lookups in the VPN A forwarding table and in the VPN B forwarding table. -
Routers router 510, one or more forwarding tables in each ofrouters - Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. For example, while the invention has been described in connection with a router, the invention may also be used in a switch or other packet forwarding device. Further, while the invention has been described in connection with the tables (router tables and forwarding tables), the invention may also use route or forwarding information stored in other data structures/forms or in databases. In addition, while the invention has been described in connection with pointers and forwarding tables to other forwarding tables, pointers to other types of tables could also be used (such as routing tables). It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.
Claims (2)
1. A method for packet forwarding, comprising:
receiving destination address information for a packet;
determining, among entries in a first forwarding table, a closest match for the received destination address information;
receiving a pointer to a second forwarding table in accordance with the closest match determined in the first forwarding table; and
determining, among entries in the second forwarding table, a closest match for the received destination address information.
2-18. (canceled)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/842,210 US20100284407A1 (en) | 2002-01-02 | 2010-07-23 | Nexthop to a forwarding table |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US34566302P | 2002-01-02 | 2002-01-02 | |
US10/063,216 US7106740B1 (en) | 2002-01-02 | 2002-03-29 | Nexthop to a forwarding table |
US11/460,195 US7787466B1 (en) | 2002-01-02 | 2006-07-26 | Nexthop to a forwarding table |
US12/842,210 US20100284407A1 (en) | 2002-01-02 | 2010-07-23 | Nexthop to a forwarding table |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/460,195 Continuation US7787466B1 (en) | 2002-01-02 | 2006-07-26 | Nexthop to a forwarding table |
Publications (1)
Publication Number | Publication Date |
---|---|
US20100284407A1 true US20100284407A1 (en) | 2010-11-11 |
Family
ID=36951866
Family Applications (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/063,216 Active 2024-11-09 US7106740B1 (en) | 2002-01-02 | 2002-03-29 | Nexthop to a forwarding table |
US11/460,195 Expired - Lifetime US7787466B1 (en) | 2002-01-02 | 2006-07-26 | Nexthop to a forwarding table |
US12/842,210 Abandoned US20100284407A1 (en) | 2002-01-02 | 2010-07-23 | Nexthop to a forwarding table |
Family Applications Before (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/063,216 Active 2024-11-09 US7106740B1 (en) | 2002-01-02 | 2002-03-29 | Nexthop to a forwarding table |
US11/460,195 Expired - Lifetime US7787466B1 (en) | 2002-01-02 | 2006-07-26 | Nexthop to a forwarding table |
Country Status (1)
Country | Link |
---|---|
US (3) | US7106740B1 (en) |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20100309784A1 (en) * | 2008-01-23 | 2010-12-09 | Attila Mihaly | Selection of an Edge Node in a Fixed Access Communication Network |
US20140169365A1 (en) * | 2012-12-17 | 2014-06-19 | Dell Products L.P. | Systems and methods for routing information in an information handling system using extended l3 lookup tables |
US9065677B2 (en) | 2012-07-25 | 2015-06-23 | Qualcomm Incorporated | Forwarding tables for hybrid communication networks |
US20150341307A1 (en) * | 2014-05-21 | 2015-11-26 | Alcatel-Lucent Usa Inc. | Distributed Address Resolution Protocol Forwarding |
US9565277B2 (en) * | 2014-06-27 | 2017-02-07 | iPhotonix | Dual-homed external network access in a distributed internet protocol (IP) router |
US9590911B2 (en) | 2014-06-27 | 2017-03-07 | iPhotonix | Wireless area network (WAN) overloading |
US20170195218A1 (en) * | 2015-12-30 | 2017-07-06 | Qualcomm Incorporated | Routing in a hybrid network |
US9794172B2 (en) | 2014-06-27 | 2017-10-17 | iPhotonix | Edge network virtualization |
US9979698B2 (en) | 2014-06-27 | 2018-05-22 | iPhotonix | Local internet with quality of service (QoS) egress queuing |
Families Citing this family (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7106740B1 (en) * | 2002-01-02 | 2006-09-12 | Juniper Networks, Inc. | Nexthop to a forwarding table |
SE0200640D0 (en) * | 2002-02-28 | 2002-02-28 | Ericsson Telefon Ab L M | Arrangement and method for routing in virtual private network |
US7313605B2 (en) | 2003-07-03 | 2007-12-25 | At&T Corp. | Externally controlled reachability in virtual private networks |
FR2876853A1 (en) * | 2004-10-20 | 2006-04-21 | France Telecom | METHOD FOR ADDRESSING AN IP NETWORK CONNECTING TO ANOTHER IP NETWORK |
US7590123B2 (en) * | 2005-11-22 | 2009-09-15 | Cisco Technology, Inc. | Method of providing an encrypted multipoint VPN service |
US7817629B2 (en) * | 2006-05-12 | 2010-10-19 | Agere Systems Inc. | Methods and apparatus for performing network operations on packets of data in response to content of particular user-specified protocol header fields |
US8467301B2 (en) * | 2006-06-05 | 2013-06-18 | Hewlett-Packard Development Company, L.P. | Router misconfiguration diagnosis |
JP5050978B2 (en) * | 2008-04-21 | 2012-10-17 | 富士通株式会社 | Transmission information transfer apparatus and method |
US8064455B2 (en) * | 2008-06-08 | 2011-11-22 | Apple Inc. | Outbound transmission of packet based on routing search key constructed from packet destination address and outbound interface |
CN102064999B (en) * | 2009-11-18 | 2013-04-03 | 杭州华三通信技术有限公司 | Method and equipment for forwarding multicast message |
US8391174B2 (en) * | 2010-07-13 | 2013-03-05 | Hewlett-Packard Development Company, L.P. | Data packet routing |
CN103312579B (en) * | 2013-05-29 | 2016-06-08 | 深圳市深信服电子科技有限公司 | Circuit switching method and device |
US9762483B2 (en) | 2015-03-06 | 2017-09-12 | Telefonaktiebolaget Lm Ericsson (Publ) | BNG / subscriber management integrated, FIB based, per subscriber, opt-in opt-out, multi application service chaining solution via subscriber service chaining nexthop and meta IP lookup |
US11323369B2 (en) * | 2020-05-18 | 2022-05-03 | Juniper Networks, Inc. | Transforming a multi-level hybrid hierarchical forwarding information base format |
Citations (43)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5905725A (en) * | 1996-12-16 | 1999-05-18 | Juniper Networks | High speed switching device |
US6141738A (en) * | 1998-07-08 | 2000-10-31 | Nortel Networks Corporation | Address translation method and system having a forwarding table data structure |
US6188689B1 (en) * | 1996-10-04 | 2001-02-13 | Kabushiki Kaisha Toshiba | Network node and method of frame transfer |
US6192051B1 (en) * | 1999-02-26 | 2001-02-20 | Redstone Communications, Inc. | Network router search engine using compressed tree forwarding table |
US6266706B1 (en) * | 1997-09-15 | 2001-07-24 | Effnet Group Ab | Fast routing lookup system using complete prefix tree, bit vector, and pointers in a routing table for determining where to route IP datagrams |
US20010010692A1 (en) * | 1996-12-16 | 2001-08-02 | Juniper Networks | Memory organization in a switching device |
US20010013067A1 (en) * | 2000-02-04 | 2001-08-09 | Hisako Koyanagi | Data transmission apparatus selecting efficient network or service class |
US20010039591A1 (en) * | 1997-07-24 | 2001-11-08 | Yuji Nomura | Process and apparatus for speeding-up layer-2 and layer-3 routing, and for determining layer-2 reachability, through a plurality of subnetworks |
US20020003795A1 (en) * | 1996-12-16 | 2002-01-10 | Rasoul Mirzazadeh Oskouy | In-line packet processing |
US20020080798A1 (en) * | 2000-06-30 | 2002-06-27 | Yoichi Hariguchi | Network routing table and packet routing method |
US20020085567A1 (en) * | 2000-12-28 | 2002-07-04 | Maple Optical Systems, Inc. | Metro switch and method for transporting data configured according to multiple different formats |
US20020118682A1 (en) * | 2000-12-22 | 2002-08-29 | Myongsu Choe | Apparatus and method for performing high-speed IP route lookup and managing routing/forwarding tables |
US20020129086A1 (en) * | 2000-08-31 | 2002-09-12 | The Regents Of The University Of California | Cluster-based aggregated switching technique (CAST) for routing data packets and information objects in computer networks |
US6463067B1 (en) * | 1999-12-13 | 2002-10-08 | Ascend Communications, Inc. | Submission and response architecture for route lookup and packet classification requests |
US20020163913A1 (en) * | 2001-05-07 | 2002-11-07 | Jintae Oh | Pointer management and content matching packet classification |
US20020172203A1 (en) * | 2000-11-16 | 2002-11-21 | Hongbin Ji | Fast IP route lookup with 16/K and 16/Kc compressed data structures |
US20030037042A1 (en) * | 1999-12-08 | 2003-02-20 | Nec Corporation | Table searching technique |
US6529508B1 (en) * | 1999-02-01 | 2003-03-04 | Redback Networks Inc. | Methods and apparatus for packet classification with multiple answer sets |
US20030058860A1 (en) * | 2001-09-25 | 2003-03-27 | Kunze Aaron R. | Destination address filtering |
US6563823B1 (en) * | 1997-10-30 | 2003-05-13 | Marconi Communications, Inc. | Multi-resolution tree for longest match address lookups |
US6600724B1 (en) * | 1998-04-28 | 2003-07-29 | Cisco Technology, Inc. | Routing table structures |
US6658482B1 (en) * | 1999-02-08 | 2003-12-02 | Wen-Shyen Eric Chen | Method for speeding up internet protocol address lookups with efficient use of memory |
US6661787B1 (en) * | 1998-05-21 | 2003-12-09 | 3Com Technologies | Integrated data table in a network |
US6678274B1 (en) * | 1999-07-30 | 2004-01-13 | Riverstone Networks, Inc. | Method and system for managing forwarding tables |
US6711661B1 (en) * | 2000-06-29 | 2004-03-23 | Motorola, Inc. | Method and apparatus for performing hierarchical address translation |
US6798777B1 (en) * | 2000-04-17 | 2004-09-28 | Juniper Networks, Inc. | Filtering and route lookup in a switching device |
US6804230B1 (en) * | 1999-05-26 | 2004-10-12 | 3Com Corporation | Communication device with forwarding database having a trie search facility |
US6839703B2 (en) * | 2000-05-15 | 2005-01-04 | Fujitsu Limited | Information apparatus, table retrieval apparatus, table retrieval method, and recording medium |
US20050122966A1 (en) * | 1999-11-16 | 2005-06-09 | Bowes Michael J. | Network switch with high-speed serializing/deserializing hazard-free double data rate switch |
US6914883B2 (en) * | 2000-12-28 | 2005-07-05 | Alcatel | QoS monitoring system and method for a high-speed DiffServ-capable network element |
US6922410B1 (en) * | 1998-05-21 | 2005-07-26 | 3Com Technologies | Organization of databases in network switches for packet-based data communications networks |
US20050175005A1 (en) * | 2000-06-21 | 2005-08-11 | Mosaid Technologies, Inc. | Method and apparatus for physical width expansion of longest prefix match lookup table |
US6968393B1 (en) * | 2001-11-19 | 2005-11-22 | Redback Networks, Inc. | Method and apparatus for an attribute oriented routing update |
US7085235B2 (en) * | 2001-10-15 | 2006-08-01 | Accton Technology Corporation | Method and apparatus for constructing and searching IP address |
US7106740B1 (en) * | 2002-01-02 | 2006-09-12 | Juniper Networks, Inc. | Nexthop to a forwarding table |
US7111071B1 (en) * | 2000-06-29 | 2006-09-19 | Intel Corporation | Longest prefix match for IP routers |
US7212531B1 (en) * | 2001-11-27 | 2007-05-01 | Marvell Semiconductor Israel Ltd. | Apparatus and method for efficient longest prefix match lookup |
US7215637B1 (en) * | 2000-04-17 | 2007-05-08 | Juniper Networks, Inc. | Systems and methods for processing packets |
US7383244B2 (en) * | 2000-04-06 | 2008-06-03 | International Business Machines Corporation | Longest prefix match (LPM) algorithm implementation for a network processor |
US7616646B1 (en) * | 2000-12-12 | 2009-11-10 | Cisco Technology, Inc. | Intraserver tag-switched distributed packet processing for network access servers |
US7688727B1 (en) * | 2000-04-17 | 2010-03-30 | Juniper Networks, Inc. | Filtering and route lookup in a switching device |
US7813346B1 (en) * | 2001-11-21 | 2010-10-12 | Juniper Networks, Inc. | Filter-based forwarding in a network |
US7839869B1 (en) * | 2001-04-12 | 2010-11-23 | Force 10 Networks, Inc. | Method and apparatus for providing virtual point to point connections in a network |
-
2002
- 2002-03-29 US US10/063,216 patent/US7106740B1/en active Active
-
2006
- 2006-07-26 US US11/460,195 patent/US7787466B1/en not_active Expired - Lifetime
-
2010
- 2010-07-23 US US12/842,210 patent/US20100284407A1/en not_active Abandoned
Patent Citations (56)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6188689B1 (en) * | 1996-10-04 | 2001-02-13 | Kabushiki Kaisha Toshiba | Network node and method of frame transfer |
US20030108056A1 (en) * | 1996-12-16 | 2003-06-12 | Juniper Networks, Inc. | Memory organization in a switching device |
US20060023719A1 (en) * | 1996-12-16 | 2006-02-02 | Sindhu Pradeep S | Memory organization in a switching device |
US5905725A (en) * | 1996-12-16 | 1999-05-18 | Juniper Networks | High speed switching device |
US20020163916A1 (en) * | 1996-12-16 | 2002-11-07 | Oskouy Rasoul Mirzazadeh | In-line packet processing |
US20010010692A1 (en) * | 1996-12-16 | 2001-08-02 | Juniper Networks | Memory organization in a switching device |
US20090268740A1 (en) * | 1996-12-16 | 2009-10-29 | Juniper Networks, Inc. | Memory organization in a switching device |
US20050201396A1 (en) * | 1996-12-16 | 2005-09-15 | Sindhu Pradeep S. | Separation of data and control in a switching device |
US20020003795A1 (en) * | 1996-12-16 | 2002-01-10 | Rasoul Mirzazadeh Oskouy | In-line packet processing |
US20090109975A1 (en) * | 1996-12-16 | 2009-04-30 | Juniper Networks, Inc. | Separation of data and control in a switching device |
US6917620B1 (en) * | 1996-12-16 | 2005-07-12 | Juniper Networks, Inc. | Separation of data and control in a switching device |
US6792471B2 (en) * | 1997-07-24 | 2004-09-14 | Fujitsu Limited | Process and apparatus for speeding up layer 2 and layer 3 routing by determining layer 2 reach ability by determining whether layer 2 subnetworks are identical |
US20010039591A1 (en) * | 1997-07-24 | 2001-11-08 | Yuji Nomura | Process and apparatus for speeding-up layer-2 and layer-3 routing, and for determining layer-2 reachability, through a plurality of subnetworks |
US6266706B1 (en) * | 1997-09-15 | 2001-07-24 | Effnet Group Ab | Fast routing lookup system using complete prefix tree, bit vector, and pointers in a routing table for determining where to route IP datagrams |
US6563823B1 (en) * | 1997-10-30 | 2003-05-13 | Marconi Communications, Inc. | Multi-resolution tree for longest match address lookups |
US6600724B1 (en) * | 1998-04-28 | 2003-07-29 | Cisco Technology, Inc. | Routing table structures |
US6922410B1 (en) * | 1998-05-21 | 2005-07-26 | 3Com Technologies | Organization of databases in network switches for packet-based data communications networks |
US6661787B1 (en) * | 1998-05-21 | 2003-12-09 | 3Com Technologies | Integrated data table in a network |
US6141738A (en) * | 1998-07-08 | 2000-10-31 | Nortel Networks Corporation | Address translation method and system having a forwarding table data structure |
US20080031252A1 (en) * | 1998-08-04 | 2008-02-07 | Oskouy Rasoul M | In-line packet processing |
US20070147257A1 (en) * | 1998-08-04 | 2007-06-28 | Juniper Networks, Inc. | In-line packet processing |
US6529508B1 (en) * | 1999-02-01 | 2003-03-04 | Redback Networks Inc. | Methods and apparatus for packet classification with multiple answer sets |
US6658482B1 (en) * | 1999-02-08 | 2003-12-02 | Wen-Shyen Eric Chen | Method for speeding up internet protocol address lookups with efficient use of memory |
US6192051B1 (en) * | 1999-02-26 | 2001-02-20 | Redstone Communications, Inc. | Network router search engine using compressed tree forwarding table |
US6804230B1 (en) * | 1999-05-26 | 2004-10-12 | 3Com Corporation | Communication device with forwarding database having a trie search facility |
US6678274B1 (en) * | 1999-07-30 | 2004-01-13 | Riverstone Networks, Inc. | Method and system for managing forwarding tables |
US20050122966A1 (en) * | 1999-11-16 | 2005-06-09 | Bowes Michael J. | Network switch with high-speed serializing/deserializing hazard-free double data rate switch |
US20030037042A1 (en) * | 1999-12-08 | 2003-02-20 | Nec Corporation | Table searching technique |
US6463067B1 (en) * | 1999-12-13 | 2002-10-08 | Ascend Communications, Inc. | Submission and response architecture for route lookup and packet classification requests |
US20010013067A1 (en) * | 2000-02-04 | 2001-08-09 | Hisako Koyanagi | Data transmission apparatus selecting efficient network or service class |
US7383244B2 (en) * | 2000-04-06 | 2008-06-03 | International Business Machines Corporation | Longest prefix match (LPM) algorithm implementation for a network processor |
US6798777B1 (en) * | 2000-04-17 | 2004-09-28 | Juniper Networks, Inc. | Filtering and route lookup in a switching device |
US7688727B1 (en) * | 2000-04-17 | 2010-03-30 | Juniper Networks, Inc. | Filtering and route lookup in a switching device |
US7215637B1 (en) * | 2000-04-17 | 2007-05-08 | Juniper Networks, Inc. | Systems and methods for processing packets |
US6839703B2 (en) * | 2000-05-15 | 2005-01-04 | Fujitsu Limited | Information apparatus, table retrieval apparatus, table retrieval method, and recording medium |
US20050175005A1 (en) * | 2000-06-21 | 2005-08-11 | Mosaid Technologies, Inc. | Method and apparatus for physical width expansion of longest prefix match lookup table |
US6711661B1 (en) * | 2000-06-29 | 2004-03-23 | Motorola, Inc. | Method and apparatus for performing hierarchical address translation |
US7111071B1 (en) * | 2000-06-29 | 2006-09-19 | Intel Corporation | Longest prefix match for IP routers |
US20020080798A1 (en) * | 2000-06-30 | 2002-06-27 | Yoichi Hariguchi | Network routing table and packet routing method |
US20020129086A1 (en) * | 2000-08-31 | 2002-09-12 | The Regents Of The University Of California | Cluster-based aggregated switching technique (CAST) for routing data packets and information objects in computer networks |
US20020172203A1 (en) * | 2000-11-16 | 2002-11-21 | Hongbin Ji | Fast IP route lookup with 16/K and 16/Kc compressed data structures |
US7274697B2 (en) * | 2000-11-16 | 2007-09-25 | Tensilica, Inc. | Fast IP route lookup with 16/K and 16/Kc compressed data structures |
US7616646B1 (en) * | 2000-12-12 | 2009-11-10 | Cisco Technology, Inc. | Intraserver tag-switched distributed packet processing for network access servers |
US20020118682A1 (en) * | 2000-12-22 | 2002-08-29 | Myongsu Choe | Apparatus and method for performing high-speed IP route lookup and managing routing/forwarding tables |
US6914883B2 (en) * | 2000-12-28 | 2005-07-05 | Alcatel | QoS monitoring system and method for a high-speed DiffServ-capable network element |
US20020085567A1 (en) * | 2000-12-28 | 2002-07-04 | Maple Optical Systems, Inc. | Metro switch and method for transporting data configured according to multiple different formats |
US7839869B1 (en) * | 2001-04-12 | 2010-11-23 | Force 10 Networks, Inc. | Method and apparatus for providing virtual point to point connections in a network |
US20020163913A1 (en) * | 2001-05-07 | 2002-11-07 | Jintae Oh | Pointer management and content matching packet classification |
US20030058860A1 (en) * | 2001-09-25 | 2003-03-27 | Kunze Aaron R. | Destination address filtering |
US7085235B2 (en) * | 2001-10-15 | 2006-08-01 | Accton Technology Corporation | Method and apparatus for constructing and searching IP address |
US6968393B1 (en) * | 2001-11-19 | 2005-11-22 | Redback Networks, Inc. | Method and apparatus for an attribute oriented routing update |
US7813346B1 (en) * | 2001-11-21 | 2010-10-12 | Juniper Networks, Inc. | Filter-based forwarding in a network |
US20110007743A1 (en) * | 2001-11-21 | 2011-01-13 | Juniper Networks, Inc. | Filter-based forwarding in a network |
US7212531B1 (en) * | 2001-11-27 | 2007-05-01 | Marvell Semiconductor Israel Ltd. | Apparatus and method for efficient longest prefix match lookup |
US7787466B1 (en) * | 2002-01-02 | 2010-08-31 | Juniper Networks, Inc. | Nexthop to a forwarding table |
US7106740B1 (en) * | 2002-01-02 | 2006-09-12 | Juniper Networks, Inc. | Nexthop to a forwarding table |
Cited By (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20100309784A1 (en) * | 2008-01-23 | 2010-12-09 | Attila Mihaly | Selection of an Edge Node in a Fixed Access Communication Network |
US8401028B2 (en) * | 2008-01-23 | 2013-03-19 | Telefonaktiebolaget Lm Ericsson (Publ) | Selection of an edge node in a fixed access communication network |
US9294309B2 (en) | 2012-07-25 | 2016-03-22 | Qualcomm Incorporated | Forwarding tables for hybrid communication networks |
US9065677B2 (en) | 2012-07-25 | 2015-06-23 | Qualcomm Incorporated | Forwarding tables for hybrid communication networks |
US9231866B2 (en) * | 2012-12-17 | 2016-01-05 | Dell Products L.P. | Systems and methods for routing information in an information handling system using extended L3 lookup tables |
US20140169365A1 (en) * | 2012-12-17 | 2014-06-19 | Dell Products L.P. | Systems and methods for routing information in an information handling system using extended l3 lookup tables |
US20160099870A1 (en) * | 2012-12-17 | 2016-04-07 | Dell Products L.P. | Systems and methods for routing information in an information handling system using extended l3 lookup tables |
US9923819B2 (en) * | 2012-12-17 | 2018-03-20 | Dell Products L.P. | Systems and methods for routing information in an information handling system using extended L3 lookup tables |
US20150341307A1 (en) * | 2014-05-21 | 2015-11-26 | Alcatel-Lucent Usa Inc. | Distributed Address Resolution Protocol Forwarding |
US9729498B2 (en) * | 2014-05-21 | 2017-08-08 | Alcatel Lucent | Distributed address resolution protocol forwarding |
US9565277B2 (en) * | 2014-06-27 | 2017-02-07 | iPhotonix | Dual-homed external network access in a distributed internet protocol (IP) router |
US9590911B2 (en) | 2014-06-27 | 2017-03-07 | iPhotonix | Wireless area network (WAN) overloading |
US9794172B2 (en) | 2014-06-27 | 2017-10-17 | iPhotonix | Edge network virtualization |
US9979698B2 (en) | 2014-06-27 | 2018-05-22 | iPhotonix | Local internet with quality of service (QoS) egress queuing |
US20170195218A1 (en) * | 2015-12-30 | 2017-07-06 | Qualcomm Incorporated | Routing in a hybrid network |
Also Published As
Publication number | Publication date |
---|---|
US7106740B1 (en) | 2006-09-12 |
US7787466B1 (en) | 2010-08-31 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7787466B1 (en) | Nexthop to a forwarding table | |
US9106506B2 (en) | Filter-based forwarding in a network | |
US7660314B2 (en) | Apparatus and method for multi-protocol route redistribution in a massively parallel router | |
US7260096B2 (en) | Method and router for forwarding internet data packets | |
US8014293B1 (en) | Scalable route resolution | |
US20190007312A1 (en) | Techniques for routing and forwarding between multiple virtual routers implemented by a single device | |
US6658481B1 (en) | Router uses a single hierarchy independent routing table that includes a flag to look-up a series of next hop routers for routing packets | |
US7369561B2 (en) | Apparatus and method for route summarization and distribution in a massively parallel router | |
US5920566A (en) | Routing in a multi-layer distributed network element | |
US6014380A (en) | Mechanism for packet field replacement in a multi-layer distributed network element | |
US5996021A (en) | Internet protocol relay network for directly routing datagram from ingress router to egress router | |
KR100624681B1 (en) | Apparatus and method for combining forwarding tables in a distributed architecture router | |
US7630358B1 (en) | Mechanism for implementing multiple logical routers within a single physical router | |
EP0978977A1 (en) | A method and system for improving high speed internetwork data transfers | |
US8948049B2 (en) | Method and systems for determining path of a virtual connection through a network | |
JP2002508123A (en) | System and method for a multilayer network element | |
US7349427B1 (en) | Routing method and apparatus for optimising auto-tunnelling in a heterogeneous network | |
CA2496345C (en) | Efficient intra-domain routing in packet-switched networks | |
US20230081052A1 (en) | Method and apparatus for sending multicast packet | |
EP4246916A1 (en) | Route processing method, and related apparatus and network system | |
Cisco | Configuring IP Routing | |
KR100487126B1 (en) | Method for handling display of local routing table entries in distributed architecture router | |
CN117749700A (en) | Corresponding relation acquisition method, parameter notification method, device, equipment and medium | |
WO2022221788A1 (en) | Bier-te encapsulation with multiple sets | |
CN116827861A (en) | Message forwarding method and device |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |