Sentence examples for missing packets from inspiring English sources

The first metric, denoted as BurstR, is defined as the ratio between the undergone average number of successive missing packets and the expected average number of successive missing packets under independent packet lossesc.

The receiving system can shuffle them into the right order, and ask for any missing packets to be re-sent.

Error-correction algorithms can restore missing packets.

Hence, we need retransmissions for those missing packets.

A degraded speech sequence is created according to the dictated pattern of missing packets.

A loss instance that comprises more than two consecutive missing packets.

But it improves the odds that a missing packet may be reconstructed from neighbouring ones that were received.

Upon receiving these duplicate ACKs, TCP retransmits the missing packet.

CPDV finds and retrieves the nearest copy of the missing packet while providing other useful NACK aggregation features.

This is the probability that each missing packet is received in the first attempt.

We focus on strict IDNC (S-IDNC), where each coded packet includes at most one missing packet of every receiver.