Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Various techniques for managing forwarding tables in computer networks are disclosed herein. In one embodiment, a method includes receiving an indication of a network condition in a computer network having a network node and determining a routing table key based on the received indication of the network condition in the computing network. The routing table key corresponds to a routing table for the network node that is pre-computed under the indicated network condition in the computer network. The method then includes transmitting the determined routing table key to the network node for routing data in the computer network.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Embodiments of a network architecture include a backbone node having a plurality of independent routers or switches connected in a matrix, wherein the matrix includes a plurality of stages of routers or switches, to form a node having a node switching capacity that is greater than the node switching capacity of the individual routers or switches. A method includes assigning one of a plurality of backbone networks to a destination network address, associating a next hop loopback address with the destination network address, and advertising the destination network address in combination with the next hop loopback address through the selected backbone network address.

Abstract: Ethernet-based networks for routing Internet Protocol (IP) traffic between source and destination sites. One embodiment includes a plurality of discrete data transmission backbones between the source and destination sites. The source site includes control means for distributing IP traffic at the source site to the plurality of backbones for transmission to the destination site.

Abstract: Embodiments of a network architecture include a backbone node having a plurality of independent routers or switches connected in a matrix, wherein the matrix includes a plurality of stages of routers or switches, to form a node having a node switching capacity that is greater than the node switching capacity of the individual routers or switches. A method includes assigning one of a plurality of backbone networks to a destination network address, associating a next hop loopback address with the destination network address, and advertising the destination network address in combination with the next hop loopback address through the selected backbone network address.

Abstract: Embodiments of a network architecture include a backbone node having a plurality of independent routers or switches connected in a matrix, wherein the matrix includes a plurality of stages of routers or switches, to form a node having a node switching capacity that is greater than the node switching capacity of the individual routers or switches. A method includes assigning one of a plurality of backbone networks to a destination network address, associating a next hop loopback address with the destination network address, and advertising the destination network address in combination with the next hop loopback address through the selected backbone network address.

Abstract: Embodiments of a network architecture include a backbone node having a plurality of independent routers or switches connected in a matrix, wherein the matrix includes a plurality of stages of routers or switches, to form a node having a node switching capacity that is greater than the node switching capacity of the individual routers or switches. A method includes assigning one of a plurality of backbone networks to a destination network address, associating a next hop loopback address with the destination network address, and advertising the destination network address in combination with the next hop loopback address through the selected backbone network address.

Abstract: Embodiments of a network architecture include a backbone node having a plurality of independent routers or switches connected in a matrix, wherein the matrix includes a plurality of stages of routers or switches, to form a node having a node switching capacity that is greater than the node switching capacity of the individual routers or switches. A method includes assigning one of a plurality of backbone networks to a destination network address, associating a next hop loopback address with the destination network address, and advertising the destination network address in combination with the next hop loopback address through the selected backbone network address.

Abstract: Embodiments of a network architecture include a backbone node having a plurality of independent routers or switches connected in a matrix, wherein the matrix includes a plurality of stages of routers or switches, to form a node having a node switching capacity that is greater than the node switching capacity of the individual routers or switches. A method includes assigning one of a plurality of backbone networks to a destination network address, associating a next hop loopback address with the destination network address, and advertising the destination network address in combination with the next hop loopback address through the selected backbone network address.

Abstract: A system for determining packet quality on an Internet protocol-based (IP-based) network includes a packet test device that traces multiple paths on the IP-based network to obtain node identifiers corresponding to nodes on each path, and an Internet quality monitor (IQM) that associates a quality metric with each path, and associates an identified link between nodes in a path with one of the quality metrics. A method for monitoring quality of data on an Internet protocol (IP)-based network includes deriving a network topology corresponding to a portion of the IP-based network, determining a quality metric associated with a path in the network topology, deriving a link in the path, and determining a quality metric associated with the link based on the quality metric associated with the path.

Abstract: Ethernet-based networks for routing Internet Protocol (IP) traffic between source and destination sites. One embodiment includes a plurality of discrete data transmission backbones between the source and destination sites. The source site includes control means for distributing IP traffic at the source site to the plurality of backbones for transmission to the destination site.