Patent classifications
H04L49/55
Multi-path message distribution and message reassembly for large data flow using forward error correction with high-performance computing (HPC)
A reliable high-throughput data transmission may be accomplished using a multi-path message distribution and a message reassembly with a forward error correction protection. An incoming flow of data from a source is received at an input parser. The incoming flow of data is divided into a plurality of packets by the input parser. The plurality of the packets is encoded with a FEC and transmitted over a network with a plurality of transmission links. The transmitted plurality of FEC encoded packets are decoded. The decoded plurality of packets is merged to an outgoing flow of data with an output multiplexor and the outgoing flow of data is sent to a destination.
Method and apparatus for interfacing with a circuit switched network
An apparatus for interfacing with a circuit switched network may be configured to detect when a data carrier signal from a circuit switched network is offline. While the data carrier signal from the circuit switched network is offline, the apparatus may send, to a network element coupled with the circuit switched network via the apparatus, control packets indicating that the data carrier signal is offline. The apparatus may further maintain an active data carrier signal between the apparatus and the network device by sending, to the network element, protocol idle frames. The apparatus may buffer, at the apparatus, packets sent from the network element to the circuit switched network. Once the data carrier signal is restored, the apparatus may send, to the circuit switched network, control packets indicating that the data carrier signal is online and the packet buffered at the apparatus while the data carrier signal is offline.
Packet Processing Method and Apparatus, and Chip
A packet processing method includes generating, by a processor of a network device, a first encoding task based on M original packets in a to-be-processed first data stream, where M is a positive integer, and where the first encoding task instructs to encode the M original packets; and performing, by a target hardware engine of the network device and based on the first encoding task, forward error correction (FEC) encoding on the M original packets to obtain R redundant packets, where R is a positive integer.
Inter-processor communications fault handling in high performance computing networks
A computer-implemented method and system for inter-processor communications fault handling in high performance computing networks. The method includes detecting that an InfiniBand (IB) queue pair has transitioned into an error state based on an unsuccessful completion status that relates to unsuccessful delivery of a message from an initiator endpoint at a first server device to at least one target endpoint at a second server device. The initiator and target endpoints are associated with at least one application under execution. An embodiment includes inferring, when the unsuccessful completion status is indicated as flushed, that the message was in a send queue of the IB queue pair when the IB queue pair transitioned into the error state. An embodiment includes establishing an IB Direct Connect queue pair connection between the target and initiator endpoints. An embodiment includes re-queueing the message in the IB queue pair for dispatch to the target endpoint.
Packet-flow message-distribution system
Switchless interconnect fabric message distribution includes end-to-end partitioning of message pathways or multiple priority levels with interrupt capability. A switchless interconnect fabric message distribution system includes a data distribution module and at least two host-bus adapters connected to the data distribution module. The data distribution module includes partition first in first out buffers. Each of the host-bus adapters includes an input manager connected to input priority first in first out buffers and an output manager connected to priority first in first out buffers.
Visualization of path between logical network endpoints
Some embodiments provide a method that receives a request for information regarding a path between endpoints of a logical network. The method provides, for display, a visualization of the path including (i) a set of logical network components between the endpoints and (ii) a set of physical network components that implement the logical network components. The physical network components and the logical network components are aligned in the display. In some embodiments, the method receives data regarding a packet tracing operation between the endpoints. The method generates a display including (i) a visualization of the path between the endpoints of the logical network and (ii) a representation of the received data regarding the packet tracing operation, with the packet tracing operation data is visually linked to the components of the path.
Coordinated switch of activity in virtual network function components
An example operation may include a method, comprising one or more of: receiving a stop request from a VNFM, retrieving a last peer operational state from a heartbeat history datastore, staying in active state when the last peer operational state is not standby, sending a remaining check points message to a peer VNFCI when the last peer operational state is standby, sending a first heartbeat message to the peer VNFCI with an operational state of active and a desired operational state of shutdown, receiving, at the peer VNFCI, the first heartbeat message; sending a second heartbeat message to the VNFCI, determining an operational state of the VNFCI when the second heartbeat message is received from the peer VNFCI, staying in active state when the operational state in the second heartbeat message is activating, transitioning the VNFCI to a deactivating state, stopping accepting service traffic at the VNFCI, and transitioning to shutdown state at the VNFCI.
Transmission apparatus including a plurality of switches and output circuits for transmitting data and transmission method
A transmission apparatus, includes a plurality of input circuits, N+1 switches (N is a natural number of 2 or larger), and a plurality of output circuits, wherein a first input circuit divides inputted data into partial data in a predetermined length, and distributes to the N+1 switches continuous M pieces of partial data (M is a natural number of 2 or larger and N or smaller) and horizontal parities calculated over the M pieces of partial data for every the continuous M pieces of partial data obtained from the division, and a first output circuit restores the data inputted to the first input circuit and outputs the restored data using at least any of the M pieces of partial data and the horizontal parities which are distributed by the first input circuit to the N+1 switches and are transferred by the N+1 switches.
Data transmission protection method, device, system, and computer readable storage medium
The present disclosure discloses a data transmission protection method, a data transmission protection device, a data transmission protection system and a computer readable storage medium, the method includes: encapsulating a packet header for a data flow to be transmitted at an ingress node to form an encapsulated data flow, where the packet header includes a control word and a flow identification; copying the encapsulated data flow to obtain a copied data flow, and transmitting the encapsulated data flow and the copied data flow together; and recovering the data flow at a terminating node according to the control word and the flow identification.
METHOD FOR DISTRIBUTING MULTIPATH FLOWS IN A DIRECT INTERCONNECT NETWORK
Disclosed is a method of routing a flow of packets from a source node to a destination node over multiple pathways only when the destination node has determined and advised the source node that a packet reordering resource is available for use with multipath operation. Also disclosed is a method of detecting packet loss without incurring timeout delays when routing packets in a flow of packets over multiple pathways from a source node to a destination node. Further disclosed is a method of dynamically avoiding slower paths when routing packets between a source node and a destination node along multiple pathways. Also disclosed is a method of avoiding overflow of a destination node reorder window when routing packets between a source node and a destination node along multiple pathways.