Multiplex communications – Diagnostic testing – Loopback
Reexamination Certificate
1999-03-11
2002-08-20
Hsu, Alpus H. (Department: 2662)
Multiplex communications
Diagnostic testing
Loopback
C370S412000, C370S521000, C714S746000, C714S748000
Reexamination Certificate
active
06438108
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Technical Field of the Invention
The present invention relates to packet data acknowledgment transmissions, and more particularly, to improved transmission of acknowledgments of received data packets in a packet data network having asymmetric access links.
2. Description of Related Art
Many applications used today over integrated networks, such as the Internet, are asymmetric in the sense that the applications receive more data then they transmit. Thus, it makes sense to utilize asymmetric links for these applications to more efficiently utilize system resources. In an asymmetric access link, the link from the sending system to the receiving system includes different properties than the link from the receiving system to the sending system. Most commonly, the link between the sending and receiving system will have a higher bandwidth than the link between the receiving and the sending system. The concept of asymmetric access links may be extended to asymmetric networks wherein a forward path from a sending host to a receiving host includes different properties than the return path from the receiving host to the sending host.
Applications require reliable delivery of data between the sending and receiving systems. In order to accomplish this, some type of reliable transport protocol must be used to move data over an integrated network like the Internet. The most commonly used transport protocol for packet data transfer on the Internet today is TCP (transfer control protocol). When a data packet is transferred from a sending system to a receiving system using the TCP protocol, an acknowledgment is provided back from the receiving system to the sending system to confirm receipt of the transmitted data packet and insure reliable data transfer. The transmitted data packet is sent over a forward path having a first bandwidth from the sending system to the receiving system, and the acknowledgments are transmitted on a reverse path having a lower bandwidth. A problem arises when the forward path having the larger bandwidth is transmitting a large amount of data to the receiving system. The smaller bandwidth reverse path may become involved in an overflow condition which limits overall system throughput.
TCP uses acknowledgments from the receiving system to inform the sending system that the data packets have arrived at their destination. According to the TCP protocol, the receiving system may only have a certain amount of outstanding, unacknowledged packets at any time. This amount is referred to as the “sender window (size)” or as the “congestion window”. Once the maximum sender window size is reached, no more packets may be transmitted.
In an asymmetric system where the bandwidth of the forward path is greater than the bandwidth of the reverse path, a risk exists that the receiver may generate acknowledgments faster than it is possible to transmit them on the reverse path. The factors affecting whether acknowledgments will become delayed on the reverse path include the ratio between the bandwidth of the forward path and the reverse path, the size of the acknowledgments being transmitted and the frequency with which the acknowledgments are being transmitted.
The frequency of the acknowledgments is dependent upon the frequency and size of data packets transmitted from the receiving system. Smaller packets from the receiving system mean that more data packets are received per unit time, and thus, more acknowledgments must be transmitted in response to their receipt. Other factors affecting whether or not a backlog of acknowledgments arise include how often and under what circumstances acknowledgments must be transmitted. According to some acknowledgment systems, packets are only generated for every received segment or every other received segment. The number of required acknowledgments affects the potential backlog.
When acknowledgments are generated faster than they may be transmitted, the generated acknowledgments must be queued at the output device until they can be transmitted. Depending upon the maximum size of the queue at the output device, one of two things may happen. If the maximum queue size is small compared to the sender window size of the connection, acknowledgments may have to be dropped when the queue becomes full. If the maximum queue size is large compared to the sender window size of the forward link, the queue will grow until the rate of data flow of received data decreases such that the acknowledgment queue may be emptied to a level ensuring the receipt of sufficient acknowledgments at the sending system to continue data transfer from sending system.
If the maximum queue size of the reverse path is too small and acknowledgments are dropped, the sending system congestion window size does not evolve as quickly as it would have if every acknowledgment were delivered to the sending system. This is because the congestion window of the sending system increases by a certain amount each time an acknowledgment arrives, no matter how many segments of acknowledgments are actually received. The loss of acknowledgments also causes bursty sender behavior because the acknowledgments actually received by the receiving system indicate a larger range of segments than if segments were received sequentially. This enables the sending system to transmit a larger number of segments in the same burst which may lead to congestion on the forward path and to retransmit the lost packets.
If the maximum size of the reverse path is to large, the acknowledgment must wait for a long period of time within the queue before it is transmitted. This increases the RTT (What is RTT?) for an associated data segment. A long RTT leads to slow growth of the sender congestion window since the size of the congestion window increases for each acknowledgment received. This causes a corresponding slow down in throughput on the forward path.
Several solutions have been suggested for improving the throughput of acknowledgments within an asymmetric access network. One technique utilizes header compression of each TCP segment carrying an acknowledgment. This technique reduces the size of a single acknowledgment from 40 bits to about 5 bits. Link layer compression or PPT data compression are other techniques used to compress data on a single physical link. These compression schemes operate at the link layer after the performance of any header compression. Each of these solutions will not solve the problem on the reverse link if the degree of asymmetry is high.
If acknowledgments are cumulative (i.e., acknowledge all segments up to a latest segment received), the problem may be solved by dropping the entire queue when an acknowledgment cannot be inserted into the queue and placing the acknowledgment at the head of the now empty queue. Unfortunately, this method causes bursty behavior at the sending system since multiple packets will then be transmitted upon the receipt of a single acknowledgment. This causes transient congestion at intermediate routers on the forward path. The reason for the bursty behavior arises from the fact that the acknowledgment will acknowledge a great number of segments which in turn will open the receiving system window to enable transmission of a burst including a large number of packets rather than just a single packet for each arriving acknowledgment. This causes a slowdown in the increase of the congestion window due to the fact that the congestion window increase is based on the number of returned acknowledgments and not the number of segments that the acknowledgment acknowledges.
A solution to the problem of bursty sending system behavior involves breaking down large bursts into smaller bursts that are scheduled to be transmitted over selected time intervals. The problem of slow congestion window growth has been controlled by modifying a sending system to take into account the number of segments acknowledged by an acknowledgment when adjusting the congestion window. However, both of these solutions must be deployed in every host that acts as a sending
Kanljung Christofer
Kullander Jan
Svensson Anders
Hsu Alpus H.
Jenkens & Gilchrist P.C.
Qureshi Afsar M.
Telefonaktiebolaget L M Ericsson (publ)
LandOfFree
System for improved transmission of acknowledgements within... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System for improved transmission of acknowledgements within..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System for improved transmission of acknowledgements within... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2935052