H04L45/023

Network monitoring of time synchronization protocols using convolutional neural networks

A device and method monitor integrity of a communication network. A local clock maintains a local time. A network interface receives time synchronization packets and associates with each the local time of receipt at the network interface. A processing system implements a neural network for classifying whether integrity of the communication network is compromised from originate, receive, and transmit values determined from the time synchronization packets. The originate value is a difference between the local time of the receipt of the request packet and a transmission timestamp of the request packet. The receive value is a difference between a reception timestamp of the request packet or the reply packet and the local time of the receipt of the request packet or the reply packet. The transmit value is a difference between the local time of the receipt of the reply packet and a transmission timestamp of the reply packet.

Topology change processing in bridged networks using a spanning tree protocol

In a spanning tree network, topology change notifications are omitted when a port becomes forwarding if the peer port is an Alternate or Backup port in Discarding state. Other features are also provided.

EDGE COMPUTING DEVICE AND METHOD FOR CONTROLLING THEREOF

An edge computing device controlling method includes executing some function modules of a plurality of function modules for processing a service request from a user device on a first edge computing device of a plurality of edge computing devices and additionally executing the some function modules on a second edge computing device of the plurality of edge computing devices when additional resource is required for the some function modules.

Network Monitoring of Time Synchronization Protocols Using Convolutional Neural Networks
20210211360 · 2021-07-08 ·

A device and method monitor integrity of a communication network. A local clock maintains a local time. A network interface receives time synchronization packets and associates with each the local time of receipt at the network interface. A processing system implements a neural network for classifying whether integrity of the communication network is compromised from originate, receive, and transmit values determined from the time synchronization packets. The originate value is a difference between the local time of the receipt of the request packet and a transmission timestamp of the request packet. The receive value is a difference between a reception timestamp of the request packet or the reply packet and the local time of the receipt of the request packet or the reply packet. The transmit value is a difference between the local time of the receipt of the reply packet and a transmission timestamp of the reply packet.

TOPOLOGY CHANGE PROCESSING IN BRIDGED NETWORKS USING A SPANNING TREE PROTOCOL

In a spanning tree network, topology change notifications are omitted when a port becomes forwarding if the peer port is an Alternate or Backup port in Discarding state. Other features are also provided.

Micro-loop avoidance in networks

Systems and methods for micro-loop avoidance include detecting a remote link failure in a network and identifying an associated Point of Local Repair (PLR); determining destinations in the network that are impacted due to the remote link failure; and installing of a temporary tunnel to the PLR. The steps can further include sending traffic destined for nodes impacted by the remote link failure via the temporary tunnel to the PLR. The temporary tunnel can be implemented by a node Segment Identifier (SID) for the PLR.

Micro-loop avoidance in networks

Systems and methods for micro-loop avoidance include detecting a remote link failure in a network and identifying an associated Point of Local Repair (PLR); determining destinations in the network that are impacted due to the remote link failure; and installing of a temporary tunnel to the PLR. The steps can further include sending traffic destined for nodes impacted by the remote link failure via the temporary tunnel to the PLR. The temporary tunnel can be implemented by a node Segment Identifier (SID) for the PLR.

System and method of flow aware resilient ECMP

A method and apparatus of a network element that processes network data in an equal cost multi-path (ECMP) group is described. In an exemplary embodiment, the network element receives the network data, where the network data is part of network data flow. In addition, the network element detects that the network data flow is a new network data flow and selects a transmitting nexthop from a plurality of nexthops of the ECMP group. The network element further maps the new network flow to a slot of a table in an ECMP group and transmits the network data using the transmitting nexthop.

DYNAMIC PROVISIONING OF MULTIPLE RSS ENGINES

An approach for a dynamic provisioning of multiple RSS engines is provided. In an embodiment, a method comprises monitoring a CPU usage of hardware queues implemented in a plurality of RSS pools, and determining whether a CPU usage of any hardware queue, implemented in a particular RSS pool of the plurality of RSS pools, has increased above a threshold value. In response to determining that a CPU usage of a particular hardware queue, implemented in the particular RSS pool, has increased above the threshold value, it is determined whether the particular RSS pool includes an unused hardware queue (a queue with light CPU usage). If such an unused hardware queue is presented, then an indirection table that is associated with the particular RSS pool is modified to remap one or more data flows from the particular hardware queue to the unused hardware queue.

Dynamic provisioning of multiple RSS engines

An approach for a dynamic provisioning of multiple RSS engines is provided. In an embodiment, a method comprises monitoring a CPU usage of hardware queues implemented in a plurality of RSS pools, and determining whether a CPU usage of any hardware queue, implemented in a particular RSS pool of the plurality of RSS pools, has increased above a threshold value. In response to determining that a CPU usage of a particular hardware queue, implemented in the particular RSS pool, has increased above the threshold value, it is determined whether the particular RSS pool includes an unused hardware queue (a queue with light CPU usage). If such an unused hardware queue is presented, then an indirection table that is associated with the particular RSS pool is modified to remap one or more data flows from the particular hardware queue to the unused hardware queue.