Various approaches for allocating resources to an application having multiple application components, with at least one executing one or more functions, in a serverless service architecture include identifying multiple routing paths, each routing path being associated with a same function service provided by one or more containers or serverless execution entities; determining traffic information on each routing path and/or a cost, a response time and/or a capacity associated with the container or serverless execution entity on each routing path; selecting one of the routing paths and its associated container or serverless execution entity; and causing a computational user of the application to access the container or serverless execution entity on the selected routing path and executing the function(s) thereon.

Various approaches for allocating resources to an application having multiple application components, with at least one executing one or more functions, in a serverless service architecture include identifying multiple routing paths, each routing path being associated with a same function service provided by one or more containers or serverless execution entities; determining traffic information on each routing path and/or a cost, a response time and/or a capacity associated with the container or serverless execution entity on each routing path; selecting one of the routing paths and its associated container or serverless execution entity; and causing a computational user of the application to access the container or serverless execution entity on the selected routing path and executing the function(s) thereon.

A path establishment method and a controller are disclosed. The method includes: when detecting a path establishment request for establishing P2MP TE, computing a P2MP TE path by using head node information and tail node information included in the path establishment request; identifying a target branch node in the P2MP TE path, and obtaining a label of the target branch node; and when a third node corresponding to the head node information and the target branch node are not a same node, sending first information to the third node, and sending second information to the target branch node, where the second information is used to instruct the target branch node to generate a multicast forwarding entry. Embodiments of this application can reduce complexity of establishing the P2MP TE path.

A path establishment method and a controller are disclosed. The method includes: when detecting a path establishment request for establishing P2MP TE, computing a P2MP TE path by using head node information and tail node information included in the path establishment request; identifying a target branch node in the P2MP TE path, and obtaining a label of the target branch node; and when a third node corresponding to the head node information and the target branch node are not a same node, sending first information to the third node, and sending second information to the target branch node, where the second information is used to instruct the target branch node to generate a multicast forwarding entry. Embodiments of this application can reduce complexity of establishing the P2MP TE path.

A first network node is arranged to communicate with a second network node. The first and second network nodes are connected by a first path and a second path. The first path uses a first communications network and the second path uses a second communications network. The first network node has a first mode and a second mode of operation, such that in a first mode traffic between the first and second network nodes is transmitted over the first path and not the second path, and in a second mode traffic between the first and second network nodes is transmitted over the first path and the second path. The network node comprises a mode selector arranged to select the second mode of operation when the demanded amount of traffic between the first and second network nodes exceeds a threshold value for a period of time.

A first network node is arranged to communicate with a second network node. The first and second network nodes are connected by a first path and a second path. The first path uses a first communications network and the second path uses a second communications network. The first network node has a first mode and a second mode of operation, such that in a first mode traffic between the first and second network nodes is transmitted over the first path and not the second path, and in a second mode traffic between the first and second network nodes is transmitted over the first path and the second path. The network node comprises a mode selector arranged to select the second mode of operation when the demanded amount of traffic between the first and second network nodes exceeds a threshold value for a period of time.

Methods and systems are provided for performing lossy dropping and ECN marking in a flow-based network. The system can maintain state information of individual packet flows, which can be set up or released dynamically based on injected data. Each flow can be provided with a flow-specific input queue upon arriving at a switch. Packets of a respective flow are acknowledged after reaching the egress point of the network, and the acknowledgement packets are sent back to the ingress point of the flow along the same data path. As a result, each switch can obtain state information of each flow and perform per-flow packet dropping and ECN marking.

An example network orchestrator includes processing circuitry and a memory. The memory includes instructions that cause the network orchestrator to receive network probe information including delay times of network probes associated with a set of flows between devices. The instructions further cause the network orchestrator to generate a correlation matrix including correlations representing shared congested links between pairs of flows. The instructions further cause the network orchestrator to for each flow of the set of flows, determine a routing solution optimized for the each flow and select a total minimum cost solution from the determined routing solutions.

An example network orchestrator includes processing circuitry and a memory. The memory includes instructions that cause the network orchestrator to receive network probe information including delay times of network probes associated with a set of flows between devices. The instructions further cause the network orchestrator to generate a correlation matrix including correlations representing shared congested links between pairs of flows. The instructions further cause the network orchestrator to for each flow of the set of flows, determine a routing solution optimized for the each flow and select a total minimum cost solution from the determined routing solutions.

Various techniques for dynamic path selection and data flow forwarding are disclosed. For example, various systems, processes, and computer program products for dynamic path selection and data flow forwarding are disclosed for providing dynamic path selection and data flow forwarding that can facilitate preserving/enforcing symmetry in data flows as disclosed with respect to various embodiments.