← Back to Patent Explorer
US6611535B2 Expired / Lapsed US ⏱️ 0.0 years remaining

Method for flow control

Assignee: Teracom AB
•
Filing: 2001-12-21
•
Granted: 2003-08-26
•
Expires: 2021-12-21
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method of efficiently using Transmission Control Protocol (TCP) with Acknowledgments (ACKs) comprising Selective Acknowledgement (SACK) options in asymmetrical networks by reducing the number of ACKs with SACK options to be transferred back to a sender. New ACKs with SACK options are compared to previous ACKs with SACK options as to their content, and in dependence of the comparison, i.e. if the previous ACK with a SACK option comprises redundant or invalid information and no additional information in relation to the new ACK with a SACK option, then the previous ACK with the SACK option is removed and not sent back to a sender.

Inventors

  • 👤 Jonas Haggard Ljungqvist

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-06 14:45
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/64; H04Q3/66; H04Q3/665; H04L; H04L1/00; H04L1/12; H04L1/16; H04L1/18; H04L1/1809; H04L1/1829; H04L1/1835; H04L69/00; H04L69/16; H04L69/163; H04L69/30; H04L69/32; H04L69/322; H04L69/326; H04L9/00; H04L9/40; H04Q2213/00; H04Q2213/1305; H04Q2213/13093; H04Q2213/13196; H04Q2213/13204; H04Q2213/13387; H04Q2213/13389

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 120 words
A method of, when receiving information in a network that transports information according to the general principles of the Transmission Control Protocol (TCP), reducing the number of selective acknowledgements (SACK) to be transferred to a sender, characterized in that the method comprises the following steps when a new selective acknowledgement has been generated: determining if there is a previous selective acknowledgement in a queue to be transferred to the sender, and if there is a previous selective acknowledgment in the queue then further performing the following additional steps; comparing the content of the new selective acknowledgement with the content of the previous selective acknowledgement; removing the previous selective acknowledgement from the queue in dependence on the result of the comparison.
Claim 2
Independent Claim 120 words
A method of, when receiving information in a network that transports information according to the general principles of the Transmission Control Protocol (TCP), reducing the number of selective acknowledgements (SACK) to be transferred to a sender, characterized in that the method comprises the following steps when a new selective acknowledgement has been generated: determining if there is a previous selective acknowledgement in a queue to be transferred to the sender, and if there is a previous selective acknowledgment in the queue then further performing the following additional steps; comparing the content of the new selective acknowledgement with the content of the previous selective acknowledgement; removing the previous selective acknowledgement from the queue in dependence on the result of the comparison.
Claim 3
Dependent Claim 48 words
The method according to claim 1 , characterized in that in the additional step of removing the previous selective acknowledgement from the queue, the previous selective acknowledgement is removed from the queue if the previous selective acknowledgement has a different number of blocks than the new selective acknowledgement.
Claim 4
Dependent Claim 72 words
The method according to claim 1 or 2 , characterized in that in the additional step of removing the previous selective acknowledgement from the queue, the previous selective acknowledgement is removed from the queue if the previous selective acknowledgement has the same number of blocks as the new selective acknowledgement and if only the right edge of the first block is different between the previous selective acknowledgement and the new selective acknowledgement.
Claim 5
Dependent Claim 31 words
The method according to claim 1 , characterized in that the method further comprises the additional step of: sorting the selective acknowledgements in the queue as to which blocks are redundant.
Claim 6
Dependent Claim 55 words
The method according to claim 4 , characterized in that the step of sorting comprises the following block sorting steps: disassembling into blocks the selective acknowledgements that have not been transferred to a sender; removing redundant blocks; assembling the remaining blocks into block sorted selective acknowledgements; placing the block sorted selective acknowledgements into the queue.
Claim 7
Dependent Claim 37 words
The method according to claim 4 , characterized in that the step of sorting comprises the following selective acknowledgement steps: comparing the selective acknowledgements that have not been transferred to a sender; removing the redundant selective acknowledgements.
Claim 8
Independent Claim 34 words
The method according to any one of claims 4 to 6 , characterized in that the step of sorting is performed only if the previous selective acknowledgement has not been removed from the queue.
Claim 9
Dependent Claim 30 words
The method according to claim 1 , characterized in that the method is performed on a queue in any suitable layer from the TCP layer to after the link layer.
Claim 10
Dependent Claim 21 words
The method according to claim 8 , characterized in that the method is performed on the internet protocol layer output queue.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2006-08-25 2007-02-24 2007-08-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2010-08-25 2011-02-24 2011-08-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2014-08-25 2015-02-24 2015-08-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag