H04L69/40

KEY PERFORMANCE INDICATORS (KPI) FOR TRACKING AND CORRECTING PROBLEMS FOR A NETWORK-UNDER-TEST
20230085976 · 2023-03-23 · ·

The disclosed technology teaches testing a mesh network using new service application level KPIs that extend the TWAMP measurement architecture. A control-client receives and parses a configuration file to populate memory with IP addresses, ports, and test session parameters for disclosed KPIs used to originate two-way test sessions from a first network host; with control-servers and session-reflectors. The method extends the receiving, parsing and originating to dozens to thousands of control-clients, by sending to the control-clients configuration files to originate respective test sessions with control-servers in a mesh network using respective test session parameters; and while the test is running, sending an updated configuration file to at least one control-client that introduces a new control-server or replaces a control-server; and expanding the test to include the new or replacement control-server without stopping or restarting TW test sessions with other control-servers; and monitoring the running test sessions and receiving results.

DISTRIBUTED PROCESSING FOR DETERMINING NETWORK PATHS
20230090416 · 2023-03-23 ·

Provided is a process including: advertising a plurality of values corresponding to computing components to peer nodes of a peer-to-peer network; storing the plurality of values in a tamper-evident, distributed ledger; determining a target data center in the distributed computing environment, wherein the target data center performs computations based on data sent from a mobile computing device, and wherein the target data center executes a peer node of the peer-to-peer network; determining a network path that is linked to the target data center based on a distance to the target data center; and transferring a packet from the target data center, wherein the packet traverses the network path and comprises one or more computation results from the target data center.

DISTRIBUTED PROCESSING FOR DETERMINING NETWORK PATHS
20230090416 · 2023-03-23 ·

Provided is a process including: advertising a plurality of values corresponding to computing components to peer nodes of a peer-to-peer network; storing the plurality of values in a tamper-evident, distributed ledger; determining a target data center in the distributed computing environment, wherein the target data center performs computations based on data sent from a mobile computing device, and wherein the target data center executes a peer node of the peer-to-peer network; determining a network path that is linked to the target data center based on a distance to the target data center; and transferring a packet from the target data center, wherein the packet traverses the network path and comprises one or more computation results from the target data center.

RELAY DEVICE, RELAY SYSTEM, RELAY METHOD AND COMPUTER READABLE MEDIUM

The conventional relay device has a problem that a traffic load on a communication device is large when an output port of a frame including a destination address, which an address table has not learned yet, is a port connected to a branch circuit, since flooding is performed on all ports except for a port that has received the frame. A relay device (21) is provided with a destination determination unit (41) to transfer, when a time clocked by a timer unit (40) to start clocking is within a set time, a frame to ports (511 and 512) connected to trunk circuits (61 and 64), and when the time clocked by the timer unit (40) exceeds the set time, to transfer the frame to the ports (511 and 512) connected to the trunk circuits (61 and 64) and a port (513) connected to a branch circuit (65), in a case wherein it is impossible for a search unit (43) to obtain from a first storage unit (33) a port number corresponding to a destination address included in the frame received, and the first storage unit (33) is cleared.

INTERVALS FOR DATA REPLICATION
20230087089 · 2023-03-23 ·

A storage system performs data replication with a recovery point objective (RPO). The storage system replicates data at intervals through data transfers over a network. The storage system determines bandwidth of the network. The storage system determines the intervals for replicating the data, based on size of data transfers, network bandwidth, and the recovery point objective.

STORAGE SYSTEM AND CONTROL METHOD

In a storage system, a failover time is shortened while avoiding erroneous detection of a node failure according to network quality. The storage system includes a plurality of storage nodes having processors; a data storage device; the plurality of storage nodes having the processors for processing data to be input to and output from the storage device; and a network for connecting the plurality of storage nodes, wherein the plurality of storage nodes monitors the operation status of each other to perform node failure detection for determining the occurrence of a failure of the storage node on the basis of a time-out value, performs a failover process in which one of the other storage nodes takes over the process of the storage node when the failure occurs in the storage node, and adjusts the time-out value on the basis of the status of the network between the storage nodes.

Method and System for Synchronizing Configuration Data in a Plant
20220342397 · 2022-10-27 · ·

A system and method includes partitioning a network into first and second sub-networks connected by a network connection. A first component with first configuration data and a first local server are located in the first sub-network; a second component with second configuration data and a second local server are located in the second sub-network. The first configuration data is stored on the first and second local servers. The network connection is interrupted and the first configuration data is updated on the first local server. The network connection is re-connected, and if the first configuration data on the second local server is unchanged, the first configuration data on the second local server is overwritten.

CLOCK-SYNCHRONIZED EDGE-BASED DATA FLOW PRIORITY ASSIGNMENT
20220345412 · 2022-10-27 ·

Network traffic is monitored to coordinate control of data flows. Data flows between sender hosts and a receiver host are identified. A first data flow and a second data flow have respective priorities. Delay thresholds are assigned to the first data flow and second data flow based on their respective priorities. One-way delays of data packets of the first and second data flows are monitored relative to the assigned delay thresholds. Responsive to determining that the one-way delay of the first data flow's data packets exceed a first delay threshold, transmissions of the first data flow's data packets are paused for a first amount of time. Responsive to determining that the one-way delay of the second data flow's data packets exceed a second delay threshold, transmissions of the second data flow's packets are paused for a second amount of time that exceeds the first amount of time.

APPLICATION CONSISTENT NETWORK BACKUP USING THREE PHASE FULL QUORUM
20220342769 · 2022-10-27 ·

A three-phase full quorum commit method enabling backing up of network devices that do not offer direct hooks in order to have application consistent protection. Devices are verified to be ready to perform a backup, and a condition of reaching and maintaining a full quorum of devices within a maximum time period is required before the system can be backed up. The three phase backup process reduces the chance of changes to network devices from corrupting consistency among the saved states of the different and disparate network devices. Multiple devices of different makes and models participate together as a unified backup as a network partition and all devices are verified as being in a ready state. The device configuration data is moved from device memory to local disk, and can then be tiered to secondary storage.

Network address allocation management using prefix allocation trees with asynchronous workflows

Disclosed are various embodiments for managing network address allocations using prefix allocation trees. In one embodiment, a request is received to allocate a particular network address block. The request specifies one or more attributes and at least one of a prefix or a size for the particular network address block. A prefix allocation tree is updated to indicate that the particular network address block corresponding to the prefix is allocated instead of free and to associate the attribute(s) with the particular network address block. An identification of an allocation of the network address block is returned in response to the request to allocate the particular network address block. An attribute index of the prefix allocation tree is updated asynchronously to index the attribute(s) in association with the particular network address block.