Abstract: An entity for RDMA is configured to maintain a time-based queue pair (QP). The time-based QP comprises a first area associated with a time-based indication and is configured to hold one or more first WQEs. The time-based indication indicates that the one or more WQEs in the first area are to be periodically processed. The entity is further configured to periodically process the one or more first WQEs in the first area according to the time-based indication.

Abstract: A data transmission controller is configured to generate one or more data transmission packets according to the modified QUIC protocol by generating one or more fields in the one or more data transmission packets to have a fixed field-size and generating a predefined number of frames of different frame-types in a predefined frame-type order in the one or more data transmission packets. The data transmission controller enables hardware Offload variant of the QUIC protocol for efficient hardware implementations of the modified QUIC protocol.

Abstract: A method for data transmission over a network and a related device are provided. The method includes generating, by a sending device a data packet for transmission, wherein a header of the data packet includes a routing hint field indicating a status of the data packet, and wherein the status is selected from a status list including a normal packet, a first packet in a heavy flow, wherein the heavy flow is a data flow having more than a predefined number of packets transmitted during a predefined period of time, and a last packet in the heavy flow. The method further includes transmitting, by the sending device, the data packet to a destination address over the network.

Abstract: The present disclosure relates to protocols for efficiently retransmitting lost data in a communication network. To this end, the disclosure proposes a first network device including processing circuitry configured to transmit a sequence of data packets to a second network device, receive at least one notification message from the second network device, and retransmit missing data packets as a next step after receiving the at least one notification message. The at least one notification message is indicative of both (i) a largest sequence number L of a data packet received at the second network device and (ii) one or more data packets that are missing from the sequence up to L at the second network device. Each missing data packet is indicated as a missing data packet after its first transmission, and a sequence number X of each missing data packet is less than L?K.

Abstract: A first network device is configured to: transmit data packets and poll messages to a second network device; and receive, in response to each poll message, at least one status message from the second network device. The at least one status message indicates which of the data packets sent before that poll message have been correctly received at the second network device and/or have been lost. The first network device is configured to adapt a rate of transmitting the poll messages based on a set of parameters. Further, a second network device is configured to: receive data packets from a first network device; and transmit at least one unsolicited status message to the first network device, in case of certain conditions.

Abstract: Approaches for routing a packet in a network having multiple cells each comprising a parent node and one or more child nodes include establishing and storing an identifier table including one or more link identifiers associated with the child node(s); upon receiving the packet, generating a string of one or more bits based at least in part on the link identifier(s); and transmitting the packet and the generated string to the child node(s).

Abstract: Approaches for updating a firmware file in a network having multiple transceiver nodes and being capable of receiving and transmitting the firmware file include dividing the firmware file into multiple of chunks, each chunk being able to be included in a single data packet transmitted between two of the transceiver nodes; transmitting each of the chunks from the first one of the transceiver nodes to the second one of the transceiver nodes; transmitting a request message from the first one of the transceiver nodes to the second one of the transceiver nodes, the request message including information associated with the chunks that have been transmitted in step (b); and transmitting a responding message from the second one of the transceiver nodes to the first one of the transceiver nodes, the responding message including information associated with one or more chunks that are included in the request message but not received by the second one of the transceiver nodes.

Abstract: Approaches for updating a firmware file in a network having multiple transceiver nodes and being capable of receiving and transmitting the firmware file include dividing the firmware file into multiple of chunks, each chunk being able to be included in a single data packet transmitted between two of the transceiver nodes; transmitting each of the chunks from the first one of the transceiver nodes to the second one of the transceiver nodes; transmitting a request message from the first one of the transceiver nodes to the second one of the transceiver nodes, the request message including information associated with the chunks that have been transmitted in step (b); and transmitting a responding message from the second one of the transceiver nodes to the first one of the transceiver nodes, the responding message including information associated with one or more chunks that are included in the request message but not received by the second one of the transceiver nodes.

Abstract: Approaches for multicast routing a group packet that includes a payload and routing information (e.g., a target identifier vector and a target multicast group ID) in a network having multiple cells each comprising a parent node and one or more child nodes include establishing and storing one or more child-node multicast group map tables associated with the child node(s) for each cell; receiving a multicast group packet; determining whether to forward the multicast group packet to the child node(s) based at least in part on the child-node multicast group map table(s) associated therewith and the received target identifier vector; and if so, causing the parent node to forward the multicast group packet to the child node(s).

Abstract: A first network device is configured to: transmit data packets and poll messages to a second network device; and receive, in response to each poll message, at least one status message from the second network device. The at least one status message indicates which of the data packets sent before that poll message have been correctly received at the second network device and/or have been lost. The first network device is configured to adapt a rate of transmitting the poll messages based on a set of parameters. Further, a second network device is configured to: receive data packets from a first network device; and transmit at least one unsolicited status message to the first network device, in case of certain conditions.

Abstract: To promote efficient and reliable communication of beacons among neighboring nodes in a wireless network, instead of having each node transmit beacons over its operational channel and switch to a different channel to receive its one-hop neighbors' beacons, nodes may transmit beacons over a different channel (i.e., different from the operational channel) and receive beacons over their operational channels. These outgoing “visitor beacons” may contain the usual beacon information but most importantly specify the operating channel of the transmitting node over which conventional beacons may be transmitted and received.

Abstract: Approaches for routing a packet in a network having multiple cells each comprising a parent node and one or more child nodes include establishing and storing an identifier table including one or more link identifiers associated with the child node(s); upon receiving the packet, generating a string of one or more bits based at least in part on the link identifier(s); and transmitting the packet and the generated string to the child node(s).

Abstract: Approaches for recovering a connectivity failure in a network having multiple cells, each (i) supporting communication among multiple transceiver nodes, (ii) being capable of receiving and transmitting a packet and (iii) being associated with a parent node and one or more child nodes, include assigning a rank number to each of the nodes; upon detecting a connectivity failure of one of the nodes to its parent node, searching for a new parent node based at least in part on the rank numbers assigned to the nodes; and upon identifying the new parent node within a first predetermined time period, reconnecting said one of the nodes to the network by associating it with the new parent node.

Abstract: Approaches for updating a firmware file in a network having multiple transceiver nodes and being capable of receiving and transmitting the firmware file include dividing the firmware file into multiple of chunks, each chunk being able to be included in a single data packet transmitted between two of the transceiver nodes; transmitting each of the chunks from the first one of the transceiver nodes to the second one of the transceiver nodes; transmitting a request message from the first one of the transceiver nodes to the second one of the transceiver nodes, the request message including information associated with the chunks that have been transmitted in step (b); and transmitting a responding message from the second one of the transceiver nodes to the first one of the transceiver nodes, the responding message including information associated with one or more chunks that are included in the request message but not received by the second one of the transceiver nodes.

Abstract: Approaches for multicast routing a group packet that includes a payload and routing information (e.g., a target identifier vector and a target multicast group ID) in a network having multiple cells each comprising a parent node and one or more child nodes include establishing and storing one or more child-node multicast group map tables associated with the child node(s) for each cell; receiving a multicast group packet; determining whether to forward the multicast group packet to the child node(s) based at least in part on the child-node multicast group map table(s) associated therewith and the received target identifier vector; and if so, causing the parent node to forward the multicast group packet to the child node(s).

Abstract: To promote efficient and reliable communication of beacons among neighboring nodes in a wireless network, instead of having each node transmit beacons over its operational channel and switch to a different channel to receive its one-hop neighbors' beacons, nodes may transmit beacons over a different channel (i.e., different from the operational channel) and receive beacons over their operational channels. These outgoing “visitor beacons” may contain the usual beacon information but most importantly specify the operating channel of the transmitting node over which conventional beacons may be transmitted and received.

Abstract: In a method for secure cloud computing, a virtual machine (VM) associated with a client is executed at a computer within a trusted computing cloud. An image including state information of the VM is obtained; storage of the image is arranged; a freshness hash of the image is determined; and the freshness hash is sent to the client. Subsequently, at the same computer or at a different computer within the trusted computing cloud, the stored image may be retrieved; a freshness hash of the retrieved image may be determined; the freshness hash of the retrieved image may be sent to the client; and an indication may be received from the client verifying the integrity of the freshness hash of the stored image.

Abstract: In a method for secure cloud computing, a virtual machine (VM) associated with a client is executed at a computer within a trusted computing cloud. An image including state information of the VM is obtained; storage of the image is arranged; a freshness hash of the image is determined; and the freshness hash is sent to the client. Subsequently, at the same computer or at a different computer within the trusted computing cloud, the stored image may be retrieved; a freshness hash of the retrieved image may be determined; the freshness hash of the retrieved image may be sent to the client; and an indication may be received from the client verifying the integrity of the freshness hash of the stored image.

Abstract: In a method for secure cloud computing, a virtual machine (VM) associated with a client is executed at a computer within a trusted computing cloud. An image including state information of the VM is obtained; storage of the image is arranged; a freshness hash of the image is determined; and the freshness hash is sent to the client. Subsequently, at the same computer or at a different computer within the trusted computing cloud, the stored image may be retrieved; a freshness hash of the retrieved image may be determined; the freshness hash of the retrieved image may be sent to the client; and an indication may be received from the client verifying the integrity of the freshness hash of the stored image.

Abstract: In a method for secure cloud computing, a virtual machine (VM) associated with a client is executed at a computer within a trusted computing cloud. An image including state information of the VM is obtained; storage of the image is arranged; a freshness hash of the image is determined; and the freshness hash is sent to the client. Subsequently, at the same computer or at a different computer within the trusted computing cloud, the stored image may be retrieved; a freshness hash of the retrieved image may be determined; the freshness hash of the retrieved image may be sent to the client; and an indication may be received from the client verifying the integrity of the freshness hash of the stored image.