A method and apparatus for adjusting network flow are provided. An embodiment of the method may include: in response to the server meeting a network flow adjustment condition, acquiring network flow-related information of the server; determining network flow adjustment operations based on the network flow-related information, wherein the network flow adjustment operations indicate to determine at least one level of downlink flow from a plurality of levels of downlink flows according to an ascending order of the plurality of levels of downlink flows, to perform network flow downregulation on the determined at least one level of downlink flow, the at least one level not comprising a highest level in the plurality of levels, and in any two levels of downlink flows, a value of a downlink flow of a higher level being greater than a value of a downlink flow of a lower lever; and performing, according to a sequential order of operations in the network flow adjustment operations, at least one operation in the network flow adjustment operations.

A method, apparatus and computer program product for providing a best route selection rule is presented. A determination is made at a first edge router, whether a second edge router in a network advertises a first BMAC address and at least one other BMAC address When the second edge router advertises only a first BMAC address, then the first BMAC address is used in a routing table for a Layer 3 (L3) next hop for a route. When the second edge router advertises more than one BMAC address, at least one other BMAC address is used in the routing table for said L3 next hop for the route.

Embodiments solve a problem of minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. Embodiments solve an equivalent caching gain maximization problem, and consider both source routing and hop-by-hop routing settings. The respective offline problems are non-deterministic polynomial time (NP)-hard. Nevertheless, embodiments show that there exist polynomial time approximation methods producing solutions within a constant approximation from the optimal. Embodiments herein include distributed, adaptive networks, computer methods, systems, and computer program products that provide guarantees of routing cost reduction. Simulation is performed over a broad array of different topologies. Embodiments reduce routing costs by several orders of magnitude compared to existing approaches, including existing approaches optimizing caching under fixed routing.

A network management system (NMS) for a communications network has communications apparatus capable of being operated in different power consumption modes to provide different levels of performance, has a path computation apparatus configured to select paths for the traffic using the communications apparatus, based on information about traffic load in the network and on information about the power consumption modes of the communications apparatus of at least one of the nodes. A power mode controller is also provided for controlling the power consumption modes of the communications apparatus according to information about traffic load and according to information about the paths selected. By combining of path computation and the control of power consumption modes the overall power consumption of the network can be reduced. A slave power mode controller can be provided.

Disclosed are systems and methods for distributed denial of service (DDoS) protection. One or more nodes in a plurality of routes between a first node and a second node are identified. The one or more nodes can be identified at a predefined interval, or in response to one or more operational metrics exceeding a threshold. Network addresses of the identified one or more nodes are modified.

The present invention provides a method of preserving packet ordering in a multipath network having a plurality of network elements interconnected by network links wherein for each data packet arriving at an egress port of the multi-path network, a delivery acknowledgement is issued by the egress port and is transmitted across the network following in reverse the path taken by the data packet being acknowledged. The state of each link in the path taken by the data packet being acknowledged is updated by the acknowledgement. The present invention further provides a multi-path network for use in a bridge, switch, router, hub or the like, the multi-path network comprising a plurality of network ports; a plurality of network elements; and a plurality of network links interconnecting the network elements and the network ports for transporting data packets, each network egress port including an acknowledgement mechanism for issuing a delivery acknowledgement in response to receipt of a data packet and each network element being adapted to transmitted a delivery acknowledgment in the opposite direction along the path taken by the data packet being acknowledged and being further adapted to update the state of at least one of the network links to which it is connected in response to receipt of an acknowledgement. The invention further provides an Ethernet bridge or router incorporating such a multi-path network.

Techniques for realizing service chaining, a corresponding apparatus and an SDN (Software Defined Network) controller are disclosed. The method includes temporarily modifying an original destination MAC (media access control) address of a packet and an original source MAC address the packet during the time the packet makes a hop from one middlebox to another. A restore operation is used to restore the original source and destination MAC addresses after the hop is made.

A method includes receiving, by a network device, notification packets separately sent by a plurality of forwarding nodes, where each notification packet includes interface forwarding delay information of the forwarding node that sends the notification packet, device forwarding delay information of the forwarding node, and a transmission delay of a link connected to the forwarding node; obtaining the interface forwarding delay information and the device forwarding delay information of each of the plurality of forwarding nodes, and obtaining a transmission delay of a link between the plurality of forwarding nodes; and computing a forwarding path between a first forwarding node and a second forwarding node, where a forwarding delay of the forwarding path meets a delay requirement of a service.

The present disclosure describes local breakout for edge computing systems, wherein the local breakout selectively routes the traffic from/to a user equipment between an edge compute node or some other service such as a core network, cloud computing service, or the like. Packets related to microservices that are offered by the edge compute node are routed to the edge compute node instead of routing those packets to the core network, and packets that are not related to the microservices provided by the edge compute node are routed to the core network or to another network such as a data network or cloud computing service. In these ways, the local breakout mechanisms provide low latency and reduced network resource consumption for the microservices and decreased data traffic load on the core network.

In some implementations, a message indicating a request for delivery of data to user equipment (UE) (e.g. an IoT device) operative for communications in a mobile network may be received from an application server. One or more first loading or congestion indication values indicative of a first loading or congestion at one or more first network nodes along a first mobile network route may be obtained. In addition, one or more second loading or congestion indication values indicative of a second loading or congestion at one or more second network nodes along a second mobile network route may be obtained. The first or the second mobile network route may be selected based on at least one of the one or more first and the second loading or congestion indication values. The data may be delivered to the UE over the selected mobile network route.