Transmitter that does not resend a packet despite receipt of a message to resend the packet
US-10789115-B2 · Sep 29, 2020 · US
US12284038B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12284038-B2 |
| Application number | US-202318353571-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 17, 2023 |
| Priority date | Apr 13, 2023 |
| Publication date | Apr 22, 2025 |
| Grant date | Apr 22, 2025 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Methods and systems for uneven segmentation of data packets to reduce retransmission penalty accumulated as a result of having to retransmit one or more of the last segments. The method includes segmenting a data packet into segments of different sizes, with generally larger segments in the first half and smaller segments in the second half, and transmitting the segments over an intermediate communication link to another node. The transmission of the segments begins before receiving the entire data packet, and retransmission of a corrupted segment takes place as soon as an indication indicative of the corrupted segment is detected.
Opening claim text (preview).
What is claimed is: 1. A method for transmitting uneven segments of a data packet over an intermediate communication link, comprising: receiving the data packet by a first node; segmenting, by the first node, the data packet into N segments such that average size of first N/2 segments, excluding the first segment, is greater by more than 30% compared to average size of second N/2 segments, excluding the last segment; transmitting the segments over the intermediate communication link to a second node, wherein the transmitting begins before completely receiving the data packet; and retransmitting original data of a corrupted segment responsive to detecting an indication indicative of the corrupted segment. 2. The method of claim 1 , wherein average size of the first N/3 segments, excluding the first segment, is greater by more than 50% compared to average size of the third N/3 segments, excluding the last segment. 3. The method of claim 1 , wherein the shorter size of the segments included in the second N/2 segments, relative to the size of the segments included in the first N/2 segments, causes average retransmission latency of a segment selected from the second N/2 segments to be shorter than average retransmission latency of a segment selected from the first N/2 segments, which reduces total average forwarding time of data packets over the intermediate communication link during retransmissions. 4. The method of claim 1 , wherein average size of first N/3 segments, excluding the first segment, is greater by more than 25% compared to average size of second N/3 segments, that is greater by more than 25% compared to average size of third N/3 segments, excluding the last segment. 5. The method of claim 1 , wherein average size of first N/3 segments is greater than average size of second N/3 segments, that is greater than average size of third N/3 segments. 6. The method of claim 1 , further comprising determining size of at least last two segments of the data packet as a function of bit error rate (BER) of the intermediate communication link, such that the last two segments are shorter when the BER is above a predetermined threshold compared to when the BER is below the predetermined threshold. 7. The method of claim 1 , further comprising determining size of at least last two segments of the data packet based on propagation latency of the intermediate communication link, such that the last two segments are shorter when the propagation latency exceeds a predetermined threshold compared to when the propagation latency is below the predetermined threshold. 8. The method of claim 1 , wherein most of the segments segmented from the data packet have a monotonically decreasing size. 9. A non-transitory computer readable medium storing one or more computer programs configured to cause a processor-based system to execute steps comprising: receiving a data packet by a first node; segmenting, by the first node, the data packet into N segments such that average size of first N/2 segments, excluding the first segment, is greater by more than 30% compared to average size of second N/2 segments, excluding the last segment; transmitting the segments over an intermediate communication link to a second node, wherein the transmitting begins before completely receiving the data packet; and retransmitting original data of a corrupted segment responsive to detecting an indication indicative of the corrupted segment. 10. A system comprising: a first node comprising a processor, a transmitter, and a receiver; the first node is configured to: receive a data packet, and segment the data packet into N segments such that average size of first N/2 segments, excluding the first segment, is greater by more than 30% compared to average size of second N/2 segments, excluding the last segment; transmit the segments, over an intermediate communication link to a second node, wherein the transmission begins before the processor completely received the data packet; and retransmit original data of a corrupted segment responsive to detecting an indication indicative of the corrupted segment. 11. The system of claim 10 , wherein average size of the first N/3 segments, excluding the first segment, is greater by more than 50% compared to the average size of the third N/3 segments, excluding the last segment. 12. The system of claim 10 , wherein the shorter size of the segments included in the second N/2 segments, relative to the size of the segments included in the first N/2 segments, causes average retransmission latency of a segment selected from the second N/2 segments to be shorter than average retransmission latency of a segment selected from the first N/2 segments, which reduces total average forwarding time of data packets over the intermediate communication link during retransmissions. 13. The system of claim 10 , wherein average size of first N/3 segments is greater by more than 25% compared to average size of second N/3 segments, that is greater by more than 25% compared to average size of third N/3 segments. 14. The system of claim 10 , wherein length of the intermediate communication link is between 10 and 50 meters, and bandwidth of the intermediate communication link is high enough to ensure that first retransmission of any of the first N/4 segments is completed before transmission of the last segment begins. 15. The system of claim 10 , wherein the second node is further configured to reassemble a restored data packet from the segments, and to transmit the restored data packet to its destination. 16. The system of claim 10 , wherein the first node is further configured to determine size of at least last two segments of the data packet based on bit error rate (BER) of the intermediate communication link, such that the at least last two segments are shorter when the BER is above a predetermined threshold compared to when the BER is below the predetermined threshold. 17. The system of claim 10 , wherein the first node is further configured to determine size of at least last two segments of the data packet based on bit error rate (BER) of the intermediate communication link, such that the at least last two segments are shorter when the BER is above 0.1% compared to when the BER is below 0.001%. 18. The system of claim 10 , wherein the first node is further configured to determine size of at least last two segments of the data packet based on propagation latency of the intermediate communication link, such that the last two segments are shorter when the propagation latency exceeds 150 nanoseconds compared to when the propagation latency is below 50 nanoseconds. 19. The system of claim 10 , wherein the data packet is received from a USB3 port, the received data packet is a USB data packet of about 1 KB, the intermediate communication link comprises an HDBaseT link, and the data packet is segmented into at least six HDBaseT packets. 20. The system of claim 10 , wherein the data packet is received from a USB3 port, the received data packet is a USB data packet of about 1 KB, the intermediate communication link comprises an HDBaseT link, and the data packet is segmented into about seven HDBaseT packets having payload sizes of about ±20% of the following byte sizes: 28, 252, 252, 204, 144, 96, and 64. 21. The system of claim 10 , wherein the data packet is received from a USB3 port, the received data packet is a USB data packet of about 1 KB, the intermediate communication link comprises an Ethernet link, and the data packet is segmented
HDMI · CPC title
Universal serial bus [USB] · CPC title
using universal interface adapter · CPC title
Assembling or disassembling of packets, e.g. segmentation and reassembly [SAR] · CPC title
Arrangements at the transmitter end · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.