Skip to content

Commit

Permalink
Remove smart quotes
Browse files Browse the repository at this point in the history
  • Loading branch information
martinthomson committed May 23, 2018
1 parent 1a30fc6 commit 66350c8
Showing 1 changed file with 3 additions and 3 deletions.
6 changes: 3 additions & 3 deletions draft-ietf-quic-recovery.md
Expand Up @@ -421,7 +421,7 @@ flight, since this packet adds network load without establishing packet loss.

There are cases where one may be able to gain recovery information from
acknowledgements of packets in another packet number space, but they rely
on complex assumptions about the peers processing and acknowledgement
on complex assumptions about the peer's processing and acknowledgement
algorithms. Even those are unable to quickly recover from cases such as
losing the client's Initial, but receiving the 0-RTT packets. Below are
three different optimizations in increasing complexity that minimize
Expand Down Expand Up @@ -452,7 +452,7 @@ that triggered the empty ack, then the empty ack should be ignored.
An EMPTY_ACK frame does not acknowledge a new packet, and in cases
when multiple packets are outstanding, the RTT signal is ambiguous,
so it should not be used like an RTT signal from a newly acknowledged
packet. It MAY change the connections default RTT if no RTT measurements
packet. It MAY change the connection's default RTT if no RTT measurements
have been taken.

### Coalesced Packets
Expand All @@ -465,7 +465,7 @@ packets in that space were lost without waiting for timeouts.

This optimization is particularly useful when:

* Sending the clients Initial, which must be padded to a full
* Sending the client's Initial, which must be padded to a full
sized packet, so the datagram typically has extra space to retransmit
some outstanding 0-RTT data.
* The clients sends 1-RTT data soon after the final TLS flight
Expand Down

0 comments on commit 66350c8

Please sign in to comment.