Browse Prior Art Database

Optimization of Interpacket Delay According to Locale or Connection

IP.com Disclosure Number: IPCOM000131890D
Publication Date: 2005-Nov-21
Document File: 1 page(s) / 25K

Publishing Venue

The IP.com Prior Art Database

Abstract

Data packet networks, wired or wireless, generally do not offer reliable service. That is, there is always a possibility of packet loss. Through the use of timers and retries, it is possible to carry data reliably even over an inherently unreliable network, however gaining reliability through such methods lowers the overall efficiency. The problem is how to ensure reliability while maximizing overall efficiency. Current methods measure round-trip latency (the time from the transmission of packet from the sender until the receipt of acknowledgement from the receiver) to control the rate at which a packet is sent. Instead of using latency, the sender can simply look at the success rate over the last fixed-size group of transmissions. After a message is sent, two outcomes are possible: the acknowledgement is received before the retransmission timer expires (success), or the retransmission timer expires (failure). Each outcome is inserted into a circular queue of a fixed size. The current percentage of successful transmissions, out of all the transmission attempts, guides the rate of transmissions for future packets. When a minumum success rate level is breached, the transmission rate would slow down until the success rate raises above the minimum. When a maximum success rate is reached (a little less than 100%), the transmission rate would speed up until the success rate is above the maximum. Consider that a 100% success rate means that it's probably possible to transmit faster. When the sender moves from one network to another, the circular queue should be cleared since the performance of one network may be vastly different from another.

This text was extracted from a Microsoft Word document.
This is the abbreviated version, containing approximately 84% of the total text.

OPTIMIZATION OF INTERPACKET DELAY

Optimization of Interpacket Delay According to Locale or Connection

Disclosed Anonymously

Data packet networks, wired or wireless, generally do not offer reliable service. That is, there is always a possibility of packet loss.

Through the use of timers and retries, it is possible to carry data reliably even over an inherently unreliable network, however gaining reliability through such methods lowers the overall efficiency.

The problem is how to ensure reliability while maximizing overall efficiency.

Current methods measure round-trip latency (the time from the transmission of packet from the sender until the receipt of acknowledgement from the receiver) to control the rate at which a packet is sent.

Instead of using latency, the sender can simply look at the success rate over the last fixed-size group of transmissions.

After a message is sent, two outcomes are possible: the acknowledgement is received before the retransmission timer expires (success), or the retransmission timer expires (failure).

Each outcome is inserted into a circular queue of a fixed size. The current percentage of successful transmissions, out of all the transmission attempts, guides the rate of transmissions for future packets.

When a minumum success rate level is breached, the transmission rate would slow down until the success rate raises above the minimum. When a maximum success rate is reached (a little less than 100%), the transmission rate would speed up until t...