Patent US5974028A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5974028A Expired / Lapsed US ⏱️ 0.0 years remaining

System and method for improving transport protocol performance in communication networks having lossy links

Assignee: AT&T Intellectual Property II LP
•
Filing: 1997-02-24
•
Granted: 1999-10-26
•
Expires: 2017-02-24
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Providing transport protocol within a communication network having a lossy link. The receiver distinguishes between packets received with non-congestion bit errors and packets having been not at all received due to congestion. When packets are received with non-congestion bit errors, the receiver sends selective acknowledgments indicating that the packets were received with bit errors while suppressing duplicate acknowledgments to prevent the invocation of a congestion mechanism.

Inventors

  • 👤 Kadangode K. Ramakrishnan

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-31 19:50
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10; H04L1/00; H04L1/12; H04L1/16; H04L1/1607; H04L1/1614; H04L1/18; H04L1/1809; H04L47/27; H04L47/31; H04L47/32; H04L69/00; H04L69/16; H04L69/161; H04L69/163; H04W; H04W28/00; H04W28/02; H04W28/0231; H04W28/0242; H04W28/0273; H04W28/10; H04W8/00; H04W8/02; H04W8/04; H04W80/00; H04W80/06; H04L1/1829; H04L1/1832; H04L1/1848; H04L2001/125

Claims Analysis

Total Claims: 22
Claim 1
Independent Claim 87 words
A method for providing transport protocol within a communication network having a lossy link connecting a receiver receiving a plurality of packets, each packet having a header including an address and a sequence number, comprising: (a) distinguishing, for a first packet from the plurality of packets, an error from the group of a non-congestion bit error and congestion error; and (b) when the first packet has non-congestion bit error, sending a selective acknowledgment indicating the first packet was received with non-congestion bit error while suppressing duplicate acknowledgments.
Claim 2
Independent Claim 87 words
A method for providing transport protocol within a communication network having a lossy link connecting a receiver receiving a plurality of packets, each packet having a header including an address and a sequence number, comprising: (a) distinguishing, for a first packet from the plurality of packets, an error from the group of a non-congestion bit error and congestion error; and (b) when the first packet has non-congestion bit error, sending a selective acknowledgment indicating the first packet was received with non-congestion bit error while suppressing duplicate acknowledgments.
Claim 3
Dependent Claim 38 words
The method of claim 1, wherein step (a) further includes the substeps of: (i) marking the first packet as having been received with a non-congestion bit error; and (ii) passing the marked first packet to a software protocol.
Claim 4
Dependent Claim 35 words
The method of claim 1, further comprising: (c) when the first packet has congestion, sending a duplicate acknowledgment indicating the first packet was not received due to congestion; and (d) invoking a congestion control mechanism.
Claim 5
Dependent Claim 16 words
The method of claim 1, wherein step (b) is performed after a time out period expires.
Claim 6
Dependent Claim 20 words
The method of claim 1, wherein step (b) is performed after a subset of the plurality of packets is received.
Claim 7
Dependent Claim 15 words
The method of claim 5, wherein the subset is based on the congestion window size.
Claim 8
Dependent Claim 29 words
The method of claim 5, wherein the selective acknowledgment is a plurality of bits comprising a bit map indicating a status of each packet in the subset of packets.
Claim 9
Dependent Claim 57 words
The method of claim 7, wherein each bit of the selective acknowledgment corresponds to the sequence number of a packet, each bit has one value from the group of a first value indicating a packet was received with an error or a packet was not received, and a second value indicating a packet received without an error.
Claim 10
Dependent Claim 25 words
The method of claim 1, further comprising: (c) retransmitting a packet not received or a packet received in error from a source to the receiver.
Claim 11
Dependent Claim 22 words
The method of claim 1, further comprising: (c) providing forward error correction (FEC) to a header of each packet of the plurality.
Claim 12
Dependent Claim 25 words
The of method of claim 1, wherein the header for each packet includes a datalink header, an Internet protocol (IP) header, and a TCP header.
Claim 13
Dependent Claim 42 words
The method of claim 10, wherein the header for each packet includes a datalink header, an Internet protocol (IP) header, and a TCP header, and wherein forward error correction of step (c) is provided for the IP header and the TCP header.
Claim 14
Dependent Claim 27 words
The method of claim 12, wherein forward error correction of step (c) is provided by a base station being connected to the receiver over a lossy link.
Claim 15
Dependent Claim 14 words
The method of claim 1, wherein the transport protocol is transmission control protocol (TCP).
Claim 16
Dependent Claim 12 words
The method of claim 1, wherein the transport protocol is OSI TP4.
Claim 17
Dependent Claim 43 words
The method of claim 1, wherein the selective acknowledgment includes a flag bit having one value from the group of a first value indicating the first packet was received with an error, and a second value indicating the first packet was not received.
Claim 18
Dependent Claim 28 words
The method of claim 16, further comprising: (c) sending the acknowledgment including the flag bit having the first value indicating the first packet was received with an error.
Claim 19
Dependent Claim 33 words
The method of claim 16, further comprising: (c) sending the acknowledgment including the flag bit having the second value indicating the first packet was not received; and (d) invoking a congestion control mechanism.
Claim 20
Independent Claim 67 words
An apparatus for sending and receiving a plurality packets of information over a loss link, each packet having a header containing an address and a sequence number, within a communication network, comprising: a means for identifying a first packet from the plurality of packets having a non-congestion error; and a means sending a selective acknowledgment indicating the first packet was not completely received while suppressing duplicate acknowledgments.
Claim 21
Independent Claim 67 words
An apparatus for sending and receiving a plurality packets of information over a loss link, each packet having a header containing an address and a sequence number, within a communication network, comprising: a means for identifying a first packet from the plurality of packets having a non-congestion error; and a means sending a selective acknowledgment indicating the first packet was not completely received while suppressing duplicate acknowledgments.
Claim 22
Dependent Claim 52 words
The apparatus of claim 19, further comprising: a means for identifying a second packet from the plurality of packets having not been received due to congestion; a means for sending a duplicate acknowledgment indicating the second packet was not received due to congestion; and a mean for invoking a congestion control mechanism.

References Cited (Backward Citations)

US5090011A Cited
US5245616A Cited
US5710798A Cited
US5493569A Cited
US5793762A Cited
US5570367A Cited
US5553083A Cited
US5553083B1 Cited
US5530693A Cited

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag