Abstract: A system comprising nodes configured to form a network including virtual links in an overlay network provisioned over an underlay network. The system includes tenant networks formed in the network, and each tenant network corresponds to a tenant of the network. The system includes control planes, and each control plane is a component of a tenant network and includes routing algorithms corresponding to traffic classes. The tenant network is configured to use feedback data of link conditions of the tenant network with at least one routing algorithm to control routing of tenant traffic of a corresponding traffic class.

Abstract: A method comprising configuring a plurality of nodes to form a network including a plurality of virtual links in an overlay network provisioned over an underlay network. The method comprises instantiating virtual routers (VRs) at each node, and each VR is coupled to the network and to a tenant of the node. The method comprises configuring at least one VR to receive network data of a set of virtual links in real time during operation of the network, determine and dynamically adapt an optimal route through the network using the network data, and control routing of traffic flows through the network according to the optimal route, obviating routing based on pre-assigned link weights.

Abstract: A method comprises instantiating at least one virtual machine (VM) at each node of a network including virtual links in an overlay network provisioned over an underlay network. The method includes configuring the VM as a tenant VM to correspond to at least one tenant of the network, such that a tenant network includes the tenant VM at each node. The method comprises configuring the VM of a corresponding tenant network to generate a control plane configured as a tenant control plane to route traffic flows of the corresponding tenant, and a data plane configured as a tenant data plane for the traffic flows of the corresponding tenant. The network includes control planes corresponding to the tenants, and data planes corresponding to the tenants.

Abstract: A method comprising instantiating virtual routers (VRs) at each of a set of nodes that form a network. Each VR is coupled to the network and to a tenant of the node. The network comprises virtual links in an overlay network provisioned over an underlay network including servers of a public network. The method comprises configuring at least one VR to include a feedback control system comprising at least one objective function that characterizes the network. The method comprises configuring the VR to receive link state data of a set of virtual links of the virtual links, and control routing of a tenant traffic flow of each tenant according to a best route of the network determined by the at least one objective function using the link state data.

Abstract: A system comprising nodes configured to form a network comprising virtual links in an overlay network provisioned over an underlay network. The system includes virtual machines (VMs), and each node includes at least one VM coupled to the network and to a tenant of the node. The system includes a feedback control system in each VM. The feedback control system is configured to receive real time feedback data of the virtual links and, in response, dynamically adjust routing of traffic flows through the network to maintain the traffic flow on an optimal route.

Abstract: A system comprising nodes configured to form a network including virtual links in an overlay network provisioned over an underlay network. The system includes tenant networks in the network, and each tenant network corresponds to a tenant of the network. The system includes control planes, each of which is a component of a tenant network and includes at least one routing algorithm configured to optimize a cost function using feedback data of link conditions of the tenant network. Each tenant network is configured to determine and adapt at least one optimal route through the tenant network, and route traffic flows of the tenant, based on an output of the cost function.

Abstract: A system comprising nodes coupled to a network including virtual links in an overlay network provisioned over an underlay network. The system includes virtual machines (VMs) provisioned at the nodes and coupled to the network and to tenants of the network. Each VM is configured to receive feedback data of link conditions of the virtual links, and use the feedback data to dynamically determine and adapt an optimal route through the network. Each VM is configured to control routing of traffic flows of a corresponding tenant using the optimal route. The routing includes split routing of traffic flows from the corresponding node via two or more of the virtual links.

Abstract: Concepts and technologies disclosed herein are directed to routing stability in a hybrid software-defined networking (“SDN”) network in which control plane functionality is shared between a centralized SDN controller and a plurality of local routers. The controller can collect data plane messages from the plurality of local routers, extract information corresponding to source nodes and edges of a graph representative of the hybrid SDN network, and store the information as entries in a table. The controller can identify any outdated entries and remove any outdated entries from the table. The controller can obtain recovered information missing from the information collected from the data plane messages. The controller also can calculate an effective capacity of the edges. The controller can then generate a stable routing pattern based upon the recovered information and the effective capacity. The controller can deploy the stable routing pattern in the hybrid SDN network.

Abstract: A system of nodes configured to form a network including a plurality of virtual links in an overlay network provisioned over an underlay network. The system includes at least one virtual machine (VM) at each node. The VM is coupled to the network and configured as a tenant VM to correspond to a tenant of the network, and a tenant network includes the tenant VM at each node. The system includes numerous control planes, and each control plane is created by the VM of a corresponding tenant network and configured as a tenant control plane for routing of traffic flows of a corresponding tenant. The system includes numerous data planes, and each data plane is created by the VM and configured as a tenant data plane for traffic flows of a corresponding tenant.

Abstract: A system of nodes configured to form a network comprising virtual links in an overlay network provisioned over an underlay network including servers of a public network. The system includes virtual routers (VRs) at each node. Each VR is coupled to the network and to a tenant of the node, and configured to receive network data of a set of virtual links in real time during operation of the network. Each VR is configured to determine and dynamically adapt an optimal route through the network using the network data. At least one VR is configured to control routing of traffic flows through the network according to the optimal route, obviating routing based on pre-assigned link weights.

Abstract: Concepts and technologies disclosed herein are directed to routing stability in a hybrid software-defined networking (“SDN”) network in which control plane functionality is shared between a centralized SDN controller and a plurality of local routers. The controller can collect data plane messages from the plurality of local routers, extract information corresponding to source nodes and edges of a graph representative of the hybrid SDN network, and store the information as entries in a table. The controller can identify any outdated entries and remove any outdated entries from the table. The controller can obtain recovered information missing from the information collected from the data plane messages. The controller also can calculate an effective capacity of the edges. The controller can then generate a stable routing pattern based upon the recovered information and the effective capacity. The controller can deploy the stable routing pattern in the hybrid SDN network.

Abstract: Alternate data packet routing includes employing an existing enterprise MPRS network that includes an edge enterprise network and a core network as defined by an internet service provider to the enterprise. Data is more optimally routed using multipath routing algorithms, rather than traditional single path routing as typical in MPRS networks. In an embodiment, if a particular path is experiencing delays, any alternative path can be used provided the alternative path has a round-trip time less than a predefined performance requirement time. Embodiments include collecting packet traffic data and generating routing tables that may indicate more efficient routes not available through the ISP routing procedures.

Abstract: A clock synchronization system and methods including an algorithm, or protocol, that synchronizes to any source of time without the need of estimating frequency errors and only performing frequency adaptions. Specifically, a clock synchronization protocol synchronizes networked nodes without explicit estimation of the clock skews and steep corrections on the time. The algorithm is guaranteed to converge even in the presence of timing loops which allow different clients to share timing information and even collectively outperform individual clients when the time source has large jitter.

Abstract: Alternate data packet routing includes employing an existing enterprise MPRS network that includes an edge enterprise network and a core network as defined by an internet service provider to the enterprise. Data is more optimally routed using multipath routing algorithms, rather than traditional single path routing as typical in MPRS networks. In an embodiment, if a particular path is experiencing delays, any alternative path can be used provided the alternative path has a round-trip time less than a predefined performance requirement time. Embodiments include collecting packet traffic data and generating routing tables that may indicate more efficient routes not available through the ISP routing procedures.

Abstract: Alternate data packet routing includes employing the public internet as well as an existing enterprise MPLS network. Data is more optimally routed using multipath routing algorithms, rather than traditional single path routing as typical in MPLS networks. In an embodiment, if a particular path is experiencing delays (as indicated by latency measurement), any alternative path can be used provided the alternative path has a round-trip time less than a predefined performance requirement time. Embodiments include collecting packet traffic data and generating routing tables that may indicate more efficient routes (including public internet routes) not available through the ISP routing procedures.

Abstract: Known intra-domain routing methods (e.g., OSPF and IS-IS) are link-state routing protocols with hop-by-hop forwarding that sacrifice optimal traffic engineering for ease of implementation and management. Known optimal traffic engineering procedures are either not link-state methods or require source routing—characteristics that make them difficult to implement. Certain embodiments of the present invention include a fully distributed, adaptive, link-state routing protocol with hop-by-hop forwarding configured to achieve optimal traffic engineering. Such embodiments facilitate significant performance improvements relative to known intra-domain routing methods and decrease network infrastructure requirements.

Abstract: A clock synchronization system and methods including an algorithm, or protocol, that synchronizes to any source of time without the need of estimating frequency errors and only performing frequency adaptions. Specifically, a clock synchronization protocol synchronizes networked nodes without explicit estimation of the clock skews and steep corrections on the time. The algorithm is guaranteed to converge even in the presence of timing loops which allow different clients to share timing information and even collectively outperform individual clients when the time source has large jitter.

Abstract: Known intra-domain routing methods (e.g., OSPF and IS-IS) are link-state routing protocols with hop-by-hop forwarding that sacrifice optimal traffic engineering for ease of implementation and management. Known optimal traffic engineering procedures are either not link-state methods or require source routing—characteristics that make them difficult to implement. Certain embodiments of the present invention include a fully distributed, adaptive, link-state routing protocol with hop-by-hop forwarding configured to achieve optimal traffic engineering. Such embodiments facilitate significant performance improvements relative to known intra-domain routing methods and decrease network infrastructure requirements.

Abstract: The invention provides a congestion control scheme that is a delay based scheme that includes a scalable queue size and one-way queueing delay measurement to reduce network congestion. Queue size is managed by queue control, a scalable utility function, dynamic alpha tuning, and/or randomized alpha tuning. One-way queueing delay is accomplished by measuring backward queueing delay management using various methods of estimating the receiver clock period. Embodiments include estimating the receiver clock period using single sample and multiple sample periods. The system includes a method for detecting route change.

Abstract: The invention provides a congestion control scheme that is a delay based scheme that includes a scalable queue size and one-way queueing delay measurement to reduce network congestion. Queue size is managed by queue control, a scalable utility function, dynamic alpha tuning, and/or randomized alpha tuning. One-way queueing delay is accomplished by measuring backward queueing delay management using various methods of estimating the receiver clock period. Embodiments include estimating the receiver clock period using single sample and multiple sample periods. The system includes a method for detecting route change.