Patent classifications
H04L12/855
Last Resort Frequency Mechanism In A Wireless Communication System
A novel and useful acknowledgement and adaptive frequency hopping mechanism for use in wireless communication systems such as IO-Link Wireless. One or two additional acknowledgement bits are added to packet transmissions. One is a current acknowledgment bit which indicates whether a packet was successfully received anytime during the current cycle. The second bit is a previous acknowledgment bit which indicates whether packets were received successfully anytime during the previous cycle. An adaptive hopping table is constructed using a greedy algorithm which chooses frequencies with the best PER for transmission of higher priority packets, while equalizing the PER products across cycles. A last resort frequency mechanism further improves transmission success by switching to a better performing channel for the last subcycle when previous attempts to transmit a high priority packet have failed.
Method for indicating a priority for relay data in a D2D communication system and device therefor
The present invention relates to a wireless communication system. More specifically, the present invention relates to a method and a device for indicating a priority in a D2D communication system, the method comprising: receiving a SDU with a priority corresponding to the SDU from an upper layer; generating a PDU including the SDU and the corresponding priority; and transmitting the PDU to a peer device.
Network management using entropy-based signatures
Systems and methods are disclosed herein for generating a signature of an anomalous network event capable of adversely affecting the performance of a computing resource service provider. A signature computing workflow service receives network traffic information received at the computing resources service provider, and parses the network traffic information into a set of entries. The set of entries may include data for a set of parameters useable for communicating over a network. Entropy values may be calculated for the data and anomalies for the set of parameters may be detected based on changes in entropy for the set of parameters. A signature of an anomalous network traffic event may be generated based on characteristic entropy changes in the parameters associated with the anomalies. The signature may be useable to detect the presence of the network event.
ADAPTIVE MONITORING OF COMPUTING SYSTEMS
An adaptive monitoring method, system, and computer program product including an intelligent monitoring system which obtains at least one preference from a user, where the at least one preference includes at least one maximum monitoring overhead.
Congestion control handling between communication apparatus and network
Methods and apparatuses pertaining to congestion control handling between a communication apparatus and a network apparatus. The communication apparatus may transmit a request message to the network apparatus. The network apparatus may transmit a reject message with a back-off timer value and a back-off priority indication to the communication apparatus. The communication apparatus may determine whether to send a further request message to the network apparatus according to the back-off priority indication.
COMMUNICATION APPARATUS, METHOD OF CONTROLLING COMMUNICATION APPARATUS, AND NON-TRANSITORY COMPUTER-READABLE STORAGE MEDIUM
A communication apparatus transmits a first packet to each of a plurality of other communication apparatuses, and transmits a Multi-User Block Acknowledgement Request (MU-BAR) for causing the other communication apparatus among the plurality of other communication apparatuses, from which an Acknowledgement (ACK) to the first packet is not received at a predetermined timing after the transmission of the first packet, to transmit the ACK.
In-band metadata export and removal at intermediate nodes
A method provided that is performed at one or more intermediate nodes in a path in a network. The node receives a packet having a header that includes metadata that has been accumulated as the packet travels along the path in the network. The node detects whether a trigger condition has occurred. In response to detecting that the trigger condition has occurred, the node exports, to a destination entity, at least a portion of the metadata that has been accumulated in the header so that the portion of the metadata is removed from the header after it has been exported.
Software defined networking multiple operating system rotational environment
Systems, methods, and storage media for utilizing software defined networking for a multiple operating system rotational environment, executing on a computing device are disclosed. Some implementations may: receive a request from a user device; modify a packet of the request with a destination address and a port of a first server; forward the modified packet of the request to a controller server; receive a flow modification from the controller server based on the modified packet; and modify further received packets from the user device based on the received flow modification.
Method for adjusting manner of issuing acknowledgement for downloading data and electronic device using the same
An electronic device which is able to acknowledge downloaded data packets at a maximum download speed includes at least one processor and a storage device. The resource allocations of a physical layer of a network are obtained, and a transmission volume of a download link of the physical layer is calculated. The rate of issuing and transmitting acknowledgments through an upload link, based on respective sizes of data packets and acknowledgments, is also calculated. A determination is made as to whether the rate of issuing acknowledgments per download packets should be changed to achieve effectively equal speed of issuing acknowledgments through the upload link and the manner of the issue is adjusted accordingly.
DISTRIBUTED RADIO TRANSPARENT CLOCK OVER A WIRELESS NETWORK
An example method comprises receiving, by a first PHY of a first transceiver, a timing packet, timestamping, by the first transceiver, the timing packet and providing the timing packet to a first intermediate node, determining a first offset between the first intermediate node and the first transceiver, updating a first field within the timing packet with the first offset between the first intermediate node and the first transceiver, the offset being in the direction of the second transceiver, receiving the timing packet by a second transceiver, the timing packet including the first field, information within the first field being at least based on the first offset, determining a second offset between the second transceiver and an intermediate node that provided the timing packet to the second transceiver and correcting a time of the second transceiver based on the information within the first field and the second offset.