At least one bandwidth-guaranteed segment routing (SR) path through a network is determined by: (a) receiving, as input, a bandwidth demand value; (b) obtaining network information; (c) determining a constrained shortest multipath (CSG.sub.i); (d) determining a set of SR segment-list(s) (S.sub.i=[sl.sub.1.sup.i, sl.sub.2.sup.i . . . sl.sub.n.sup.i]) a that are needed to steer traffic over CSG.sub.i; and (e) tuning the loadshares in L.sub.i, using S.sub.i and the per segment-list loadshare (L.sub.i=[l.sub.1.sup.i, l.sub.2.sup.i . . . l.sub.n.sup.i]), the per segment equal cost multipath (“ECMP”), and the per link residual capacity, such that the bandwidth capacity that can be carried over CSG.sub.i is maximized.

A router node may be configured for communication of multicast traffic in a network fabric which may include a plurality of spine nodes interconnected to a plurality of leaf nodes. The router node may be configured as one of the leaf nodes and serve as a first hop router for multicast traffic. At the router node, a message for flooding the network fabric may be sent based on an indication of communication of multicast traffic for a multicast group from a source device. The message may include at least one spine node identifier of at least one preferred spine node joined to the multicast group at the router node. The message may be for indicating, to at least one of the leaf nodes, to prioritize joining to the multicast group at the at least one preferred spine node according to at least one spine node identifier.

A data delivery service of a service provider may receive respective job specifications for different data transfer jobs between computing infrastructure collections (e.g., data centers). A job specification for a data transfer job may include an amount of data to be transferred for the data transfer job, one or more destinations of data transfers for the data transfer job, and/or one or more flexibility parameters for successful transfer of the data for the data transfer job (e.g., a deadline to transfer the data, available data delivery techniques). The data delivery service may determine a schedule for performing different data transfer jobs between two or more infrastructures based on an analysis of the amount of data to be transferred for each job, the destinations of the data transfer for each job, the flexibility parameters for each job (e.g., included in the respective job specifications), and the connectivity between computing infrastructure collections.

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 packet routing method includes computing, for a source node in the data network and a destination node in the data network, a set of multiple routes providing a set of shortest routes from the source to the destination that satisfy all the truth assignments for the Boolean algebra available from the path in the network. The method selects, for a packet flow, a route where logical conjunction of the policy constraints of the flow and the route is satisfied and where the route has sufficient bandwidth.

This application discloses a data forwarding method and device. The method includes: obtaining a first data unit sequence stream by using a first logical ingress port, where the first data unit sequence stream includes at least one first data unit; determining, according to a preconfigured mapping relationship between at least one logical ingress port and at least one logical egress port, a first logical egress port corresponding to the first logical ingress port, where the at least one logical ingress port includes the first logical ingress port; adjusting a quantity of idle units in the first data unit sequence stream, so that a rate of an adjusted first data unit sequence stream matches a rate of the first logical egress port; and sending the adjusted first data unit sequence stream by using the first logical egress port.

Methods and apparatuses are described for virtualizing routing of network traffic by offloading routing decisions to a controller in communication with a plurality of network devices. For load balancing applications, the controller may make up-front decisions as to both destination and route, rather than wait until traffic has been routed to a load balancing point before determining the destination.

In one aspect, a computerized method includes the step of providing process monitor in a Gateway. The method includes the step of, with the process monitor, launching a Gateway. Daemon (GWD). The GWD runs a GWD process that implements a Network Address Translation (NAT) process. The NAT process includes receiving a set of data packets from one or more Edge devices and forwarding the set of data packets to a public Internet. The method includes the step of receiving another set of data packets from the public Internet and forwarding the other set of data packets to the one or more Edge devices. The method includes the step of launching a Network Address Translation daemon (NATD). The method includes the step of detecting that the GWD process is interrupted; moving the NAT process to the NATD.

A wireless network device, for use within a wireless network, comprising: a processor; a memory; and an interface for receiving and transmitting data; wherein the wireless network device is adapted to: determine a first cost associated with communication between the wireless network device and a client device to which the wireless network device is connectable; determine a second cost associated with communication between the client device and a further wireless network device to which the client device is connectable; determine whether the first cost or the second cost is the lower cost; and if the second cost is the lower cost, the wireless network device is adapted to guide the client device to communicate with the further network device.

A computing system and a method are provided for determining a network traffic routing path through a service function chain (SFC). A joint network slicing and traffic engineering problem is provided that may be solved to identify network slicing configuration and traffic engineering parameters to provide a set of function nodes, the SFC, and the network traffic routing path from the source node to the destination node. The joint network slicing and traffic engineering problem P may be solved by minimizing a resource objective associated with the joint network slicing and traffic engineering problem, in accordance with a set of one or more constraints. Instructions may be transmitted to a network orchestrator to create the service function chain in a network slice on the set of network nodes in accordance with the identified network slicing configuration and traffic engineering parameters, to provide the network traffic routing path.