US 7,236,459 B1Grant
Method and apparatus for controlling data transmission volume using explicit rate control and queuing without data rate supervision
Issue Date:2007-06-26
•6 Claims
•4 Drawing Sheets
Abstract
Packet flow rate control techniques are enhanced by the interactive and early invocation of packet queuing to control short flows of packets and to eliminate undershoot and overshoot of a targeted flow rate. Packet queuing involves the scheduled release of packets in accordance with flow policies (priorities) to achieve a preselected outgoing target flow rate. The combination of controlled packet queuing and packet flow rate control with appropriate mechanisms for favoring one over the other improves the efficiency of data transmission.
Metadata
Assignee
- Packeteer, Inc.
Inventors
- Jon Eric Okholm
- Saurabh Aggarwal
- Michael J. Quinn
Application Information
Application Number:US 10/140,351
Filing Date:2002-05-06
Priority Date:2002-05-06
Art Unit:2616
Classifications
IPC:
H04L12/26
Patent Drawings (4 sheets)
Description
Statement as to Rights to Inventions Made Under Federally Sponsored Research or Development
[0001] Not applicable
Cross-References to Related Applications
[0002] Not applicable
Reference to a “Sequence Listing,” a Table, or a Computer Program Listing Appendix Submitted on a Compact Disk.
[0003] Not applicable
Background of the Invention
[0004] This invention relates to digital packet telecommunications, and particularly to management of flow of data, that is, the volume of data per unit time across heterogeneous network boundaries. It is particularly useful in a digitally-switched packet telecommunications environment normally not subject to data flow rate control. The present invention is intended to work in an environment having a metered-release of acknowledgements and a window control mechanism.
[0005] This invention represents an augmentation of the capabilities disclosed in the work of Robert Packer, as for example described in U.S. Pat. Nos. 6,018,516; 5,802,106; 6,038,216; 6,046,980; 6,205,120; 6,285,658; 6,298,041; and 6,115,357). The Packer packet flow rate control mechanisms taught therein controlled size of the sliding window, amount of acknowledged data and timing of acknowledgement delivery.
[0006] The ubiquitous TCP/IP protocol suite intentionally omits explicity supervision of the rate of data transport over the various media which comprise a network. While there are certain perceived advantages, this characteristic of TCP/IP has the consequence of juxtaposing very high-speed packet flows and very low-speed packet flows in potential conflict for network resources, which results in inefficiencies. Certain pathological loading conditions can result in instability, overload and data transfer stoppage. Therefore, it is desirable to provide some mechanism to optimize efficiency of data transfer while minimizing the risk of data loss. Data flow rate capacity information is a key factor for use in resource allocation decisions.
[0007] The technology of interest is based largely on the TCP/IP protocol suite, where IP, or Internet Protocol, is the network layer protocol and TCP, or Transmission Control Protocol, is the transport layer protocol. At the network level, IP provides a “datagram” delivery service. By contrast, TCP builds a transport level service over the datagram service to provide guaranteed, sequential delivery of a byte stream between two IP hosts.
[0008] Conventional TCP flow control mechanisms operate exclusively at the end stations to limit the rate at which TCP endpoints emit data. However, TCP lacks explicit data rate control. In fact, until the work of Packer, there was no concept of coordination of data rates among multiple flows.
[0009] The basic TCP flow control mechanism is a sliding window superimposed on a range of bytes beyond the last explicitly-acknowledge byte. Its sliding operation limits the amount of unacknowledge transmissible data that a TCP endpoint can emit.
[0010] The sliding window flow control mechanism works in conjunction with the Retransmit Timeout Mechanism (RTO), which is a timeout to prompt a retransmission of unacknowledged data. The timeout length is based on a running average of the Round Trip Time (RTT) for acknowledgment receipt, i.e., if an acknowledgment is not received within (typically) the smoothed RTT+4* means deviation, then packet loss is inferred and the data pending acknowledgment is retransmitted.
[0011] Data rate flow control mechanisms which are operative end-to-end without explicit data rate control draw a strong inference of congestion from packet loss (inferred, typically, by RTO). TCP end systems, for example, will ‘back-off’, i.e., inhibit transmission in increasing multiples of the base RTT average as a reaction to consecutive packet loss.
[0012] While TCP rate control has significant advantages, there are certain conditions where the response time needed to adjust rate control mechanisms is less than can be provided by Packer flow rate control techniques.
Summary of the Invention
[0013] According to the invention, in a packet-based communication system where acknowledgment packets are employed in the control of the flow rate of packets, packet flow rate control techniques are enhanced by the interactive and early invocation of packet queuing to control short flows of packets and to eliminate overshoot of a targeted flow rate. Packet queuing according to the invention may involve the scheduled release of packets in accordance with flow policies (priorities) to achieve a preselected outgoing target flow rate. In a specific embodiment of the invention, packets that arrive from a data source at the beginning of a flow before rate control is effective, the packets are forwarded by metering them out at the allocated bandwidth below the bandwidth capacity of the channel based on an expected capacity of the channel. The queuing of packets terminates and the queue is emptied as the feedback-based rate control mechanism using acknowledgments begins to moderate the rate of packet release from the data source. Packet rate control uses window size (TCP window size), acknowledgment rate, and number of bytes acknowledged. The combination of controlled packet queuing and network flow rate control with appropriate mechanisms for favoring one over the other improves the efficiency of data transmission.
[0014] The invention will be better understood by reference to the following detailed description in connection with the accompanying drawings.
Brief Description of the Drawings
[0015] FIG. 1 is first flow chart of operation of an integrated packet rate control mechanism according to the invention.
[0016] FIG. 2 is a second flow chart of operation of an augmented packet rate control mechanism in FIG. 1 according to the invention.
[0017] FIG. 3 is a third flow chart of operation of a normal rate control and sizing mechanism in FIG. 1 according to the invention.
Detailed Description of the Invention
[0018] Referring to FIG. 1 , a flow chart is shown of overall or integrated system operation of a controller at a portal in the flow path between an arbitrary data source and an arbitrary data destination according to the invention. The invention is explained in the context of Transmission Control Protocol (TCP), which is a well-known transmission protocol used on the Internet. However, in general any network protocol or network application which employs a feedback mechanism to moderate bandwidth allocated to a source can be rate controlled through an implementation of this mechanism. Network transport protocols that fall into this category include AppleTalk ADSP, AppleTalk ATP, some sub-protocols of SNA, SNA/IP, and RTP/IP. Some applications with explicit timing feedback, such as Real Audio over UDP, can also be controlled with a specific implementation of the described mechanism.
[0019] In the protocol, a network packet arrives at the controller (Step A) and is immediately tested to determine if it is a new flow (Step B). If not, the packet is passed through, where it is subsequently check to determine if this flow is controlled or not (Step C). (A control block for this flow may be retrieved at this point to facilitate control.) It not, the packet is transmitted on in the network (Step D). The controller is thus transparent to the packet.
[0020] If the flow (Step B) is a new flow, then the controller sets up a local control block with flow information for this new flow, such as source and destination IP addresses and TCP ports of the flow, as well as the state of the flow (e.g., time of receipt of packet, time of last packet received, ACK number, Sequence number, last ACKs, and window size) (Step E), and then the controller checks to see if flow is to be controlled (Step C).
[0021] If flow is to be controlled, the controller determines whether it is a TCP flow (Step F). If not, then the flow control is passed on to other control mechanisms appropriate to the flow type (Step G), and which are not a part of this specific embodiment.
[0022] If it is a TCP flow, then the controller checks to determine if a TCP SYN (synchronization) flag or RST (reset) flag set (Step H), in which case, the packet is passed to the network. Otherwise, the packet is tested to determine whether it contains data with a new ACK number (an ACK which has not been received before) (Step I). If not, it tested for data (Step J) and if not, it is passed on for normal TCP ACK processing (Step K, FIG. 3 ).
[0023] If the packet contains both data and new ACK information, then the data and the ACK are separated (Step L). this is done as follows. A new packet is created with no data, and the new ACK information is copied into the new packet. This new packet is forwarded for normal TCP ACK processing (Step K). The data packet is stripped of the new ACK information (the acknowledgment number in the TCP is set back to the last acknowledgment number that was forwarded in this direction), and the packet, which now contains only data, is forwarded to TCP data processing (Step M, FIG. 2 ). By separating the data from the ACK, the data can be forwarded as soon as possible without regard to the timing of the forwarded ACK packets that are metering the sender's data transmission rate.
[0024] Referring to FIG. 2 , with the environment set up to take advantage of the invention, the local control block for the flow is augmented and updated (Step N) by recording the highest sequence number (SEQ) received, checking for missing data according to missing sequence numbers, and recording the time of arrival of the packet at the controller. Then in Step O, a new estimate of the flow's data rate is made. This is done by updating an Exponentially Weighted Moving Average (EWMA) with the latest flow rate measurement. The latest flow rate measurement is the number of bytes in the packet received divided by the interval since the receipt of the last received packet. This value is the measured flow rate. Thereafter the controller determines the target data rate (Step P) by making a new estimate of the flow's potential rate (whether to increase or decrease), requesting bandwidth from the distribution mechanism (not shown), and receiving from the bandwidth distribution mechanism an assignment of bandwidth or target rate in bytes per second. The target rate is acquired on every incoming packet, since the target rate information is used in subsequent control steps.
[0025] The state of the initial packet in a flow is State 0 (zero) of possible states 0, 1 and 2. The states indicate whether a queue is on buildup, draindown or whether the queuing mechanism is finished. This queuing process is typically not used after an initial period related to the beginning of a new flow or a restart of a flow after a pause.
[0026] If the tested packet has achieved a state equal to 2 (Step Q), then there will be no queuing, and the packet is transmitted without undue delay (Step R). If the state is zero or 1, then the controller tests to see if there is already a packet queued for this flow (Step S). If not, then the controller tests to determined whether the packet's inbound arrival rate exceeds the assigned target rate (Step T) (as determined by Step P). If not, the packet is transmitted (Step R). If its rate exceeds the target rate, then it is scheduled for delayed release (Step U), and it is released as scheduled.
[0027] If there is a data packet already queued for flow (Step S), then the state flag is again tested for State 0 or 1, to determine the state of the queue (Step V). If the state is zero (queue buildup), then the controller tests to see if the number of packets in the queue is greater than a trigger level, as selected by the operator (Step W). (In TCP where the target rate is not more than an order of magnitude different than the incoming rate, a queue of 2–4 is expected to be sufficient). If the queue is not “full,” the packet is added to the queue (Step X), and the packet is dealt with as part of the scheduled release of the queue (the next transmission of a packet in the previous scheduling performed in of Step U). However, if the packet count exceeds the trigger, the state is set to State 1 (Step Y) before the packet is added to the queue (Step X).
[0028] If the state is State 1 (Not State=0, Step V), the queue is in draindown state, whether or not it is being emptied. The controller checks to see if the number of packets in the queue has fallen below a draindown trigger level (Step Z). The draindown trigger level may be different than the buildup trigger level. If not, then the packet is added to the queue (Step X). Otherwise, the state is set to 2 (Step AA) before adding the packet to the queue. State 2 indicates that the queuing is done. Packets are released from the queue in due course through the scheduling of transmission.
[0029] Referring now to FIG. 3 , the mechanism for rate control with Acknowledgment is illustrated. This process takes over from the queuing mechanism, which is the initial rate control mechanism, after the decisions of the controller outlined in FIG. 1 are completed. The ACK packet (Step K) prompts the updating of the ACK information of the flow's control block (Step AB) and tests to determine whether there is an ACK which has been queued (Step AC). If there is already an ACK for this flow that has been scheduled for future release, then the current ACK is simply deleted (Step AD), and the controllers wait for the next timed ACK transmission or release. If there is not an ACK in the system, this ACK packet is used to determine data rates and ACK rates (Step AE). This is done by dividing the number of bytes acknowledged between the time of receipt of the current ACK and time of receipt of a previous ACK. This rate may be averaged over several ACK times using the EWMA technique mentioned previously.
[0030] The ACK rate is then tested (Step AF). If the ACK rate does not exceed the assigned ACK rate as specified by the bandwidth manager (Step T, which is based on data flow rate), the window size is modified to be consistent with prior window sizes (Step AG) and the ACK is transmitted to the data source (Step AH). If the ACK rate does exceed the assigned ACK rate, then, since there is no scheduled ACK, the controller modifies the ACK to be consistent with the data rate assigned to the flow, the ACK may be modified by changing the number of bytes acknowledged by the packet (never sending an ACK that is less than previously sent ACKs), or it may reduce the advertised window size (which can be done by holding one edge of the window constant, since reducing the window from previous packets without advancing the acknowledgment number is a violation of the TCP protocol specification) (Step AI). The ACK may be and often is delayed in time. This time delay is useful in conjunction with ACK modifications to induce the data sender to send further data packets at the assigned data rate. Then the controller modifies the ACK packet according to the prior calculations (Step AJ), and schedules the ACK packet for later transmission (Step AK). After the scheduled delay, the ACK packet is transmitted (Step AL) and the controller checks to see if all bytes which have been acknowledged by the receiver have been forwarded to the sender (Step AM). If so, the process is done. Otherwise, the ACK is recycled (Step AN) and new determinations are made of delay, byte count and window size (Step AI) in according with the acknowledgment-based rate control mechanism.
[0031] The combination of initial queuing of packets and Acknowledgment-based rate control provides an effective mechanism for introduction of new flows in a bandwidth limited packet transmission environment, where speeds need to be controlled. It is most useful in an environment where fast and slow rates must be merged, and it inhibits undesired effects manifest in traffic speed oscillation.
[0032] The invention has been explained with reference to specific embodiments. Other embodiments will be evident to those of ordinary skill in the art. It is therefore not intended that the invention be limited, except as indicated by the appended claims.
Claims
What is claimed is:
1. A method for controlling data flow transmission between a first host and a second host, the method implemented by a network device disposed in a communications path between the first host and the second host, the method comprising
monitoring, at the network device, the state of a data flow between the first host and the second host, wherein the monitored state includes a last sequence number of data acknowledged by the first host and the inbound rate of data transmitted by the first host to the second host;
receiving, at the network device, a data packet of the data flow transmitted from the first host to the second host, wherein the data packet comprises an acknowledgment sequence number and data;
if the acknowledgment sequence number in the received packet is greater than the last sequence number of data acknowledged by the first host, then:
creating a first new packet including the acknowledgment sequence number;
creating a second new packet including the data in the received data packet and the last sequence number of data acknowledged by the first host;
passing the first new packet to an acknowledgment packet process operative to conditionally modify the first new packet, and schedule the first new packet for transmission;
passing the second new packet to a data packet process operative to schedule the second new packet for transmission.
2. The method according to claim 1 wherein the data packet process maintains, for each data flow, a data packet queue and a queuing state, wherein the queuing state ranges from one of a build-up state, a drain-down state and queuing-done state, and wherein the data packet process comprises
initially setting a queuing state for the data flow to a build-up state;
transmitting the data packet if the queuing state for the data flow is set to the queuing done state;
otherwise:
identifying, responsive to receipt of the data packet, a target rate for the data flow;
determining whether the data packet queue corresponding to the data flow contains a previous data packet of the data flow;
if the data packet queue corresponding to the data flow is empty, determining whether the inbound rate of the data flow exceeds the target rate,
adding, if the inbound rate exceeds the target rate, the data packet to the data packet queue corresponding to the data flow;
otherwise, if the data packet queue corresponding to the data flow contains one or more packets of the flow, then
if the queuing state for the data flow is set to the build-up state and the number of packets in the data packet queue exceeds a first threshold, then setting the queuing state to the drain-down state and adding the packet to the data packet queue;
if the queuing state for the data flow is set to the build-up state and the number of packets in the data packet queue does not exceed the first threshold, then adding the packet to the data packet queue;
if the queuing state for the data flow is not set to the build-up state and the number of packets in the data packet queue is less than a second threshold, then setting the queuing state to the queuing done state and adding the packet to the data packet queue; and
if the queuing state for the data flow is not set to the built-up state and the number of packets in the data packet queue is greater than the second threshold, then adding the packet to the data packet queue.
3. The method according to claim 2 wherein the first threshold and the second threshold are equal.
4. The method according to claim 1 wherein the acknowledgment packet process maintains acknowledgment state information for each data flow, and wherein the acknowledgment packet process comprises
updating, responsive to the acknowledgment packet, acknowledgment information for the data flow;
deleting the acknowledgment packet, if a prior acknowledgment packet for the data flow has been queued;
otherwise;
determining an acknowledgment rate and a data rate at which the second host transmits packets of the data flow;
if the acknowledgement rate does not exceed an assigned acknowledgment rate, then modifying the window size in the acknowledgment packet and transmitting the acknowledgment packet;
if the acknowledgment rate exceeds the assigned acknowledgment rate, then determining one or more acknowledgment parameters comprising one or more of an acknowledgment delay, a window size, and an amount of data to acknowledge; modifying the acknowledgment packet based on the determined acknowledgment parameters; and scheduling the acknowledgment packet for transmission.
5. The method according to claim 4 wherein the acknowledgment packet is scheduled for transmission according to the acknowledgment delay.
6. The method according to claim 4 further comprising
transmitting the acknowledgment packet according to the scheduled ACK delay;
determining whether acknowledgment of all data acknowledged by the first host has been forwarded to the second hose; and
generating, response to the determining step, a second acknowledgment packet for processing by the acknowledgment packet process.
Patent Citations (41)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5042029(A) | 1991-08-01 | Hayakawa | Applicant |
| US5164986(A) | 1992-11-01 | Bright | Examiner |
| US5193151(A) | 1993-03-01 | Jain | Applicant |
| US5251152(A) | 1993-10-01 | Notess | Applicant |
| US5359593(A) | 1994-10-01 | Derby | Applicant |
| US5426635(A) | 1995-06-01 | Mitra | Applicant |
| US5455826(A) | 1995-10-01 | Ozveren | Applicant |
| US5495426(A) | 1996-02-01 | Waclawsky et al. | Applicant |
| US5802106(A) | 1998-09-01 | Packer | Applicant |
| US5838919(A) | 1998-11-01 | Schwaller et al. | Applicant |
| US5870561(A) | 1999-02-01 | Jarvis et al. | Applicant |
| US5923849(A) | 1999-07-01 | Venkatraman | Applicant |
| US6018516(A) | 2000-01-01 | Packer | Applicant |
| US6038216(A) | 2000-03-01 | Packer | Applicant |
| US6046980(A) | 2000-04-01 | Packer | Applicant |
| US6047322(A) | 2000-04-01 | Vaid et al. | Applicant |
| US6075791(A) | 2000-06-01 | Chiussi et al. | Applicant |
| US6115357(A) | 2000-09-01 | Packer et al. | Applicant |
| US6119235(A) | 2000-09-01 | Vaid | Applicant |
| US6178448(B1) | 2001-01-01 | Gray et al. | Applicant |
| US6198722(B1) | 2001-03-01 | Bunch | Applicant |
| US6205120(B1) | 2001-03-01 | Packer et al. | Applicant |
| US6215769(B1) | 2001-04-01 | Ghani et al. | Examiner |
| US6252851(B1) | 2001-06-01 | Siu et al. | Examiner |
| US6256317(B1) | 2001-07-01 | Holloway et al. | Applicant |
| US6272131(B1) | 2001-08-01 | Ofek | Applicant |
| US6285658(B1) | 2001-09-01 | Packer | Applicant |
| US6298041(B1) | 2001-10-01 | Packer | Applicant |
| US6560243(B1) | 2003-05-01 | Mogul | Applicant |
| US6894974(B1) | 2005-05-01 | Aweva et al. | Examiner |
| US6928052(B2) | 2005-08-01 | Packer | Applicant |
| US6957267(B2) | 2005-10-01 | Awasthi | Examiner |
| US6957287(B2) | 2005-10-01 | Awasthi | Applicant |
| US7088678(B1) | 2006-08-01 | Freed et al. | Examiner |
| US2001/0017844(A1) | 2001-08-01 | Mangin | Examiner |
| US2002/0159396(A1) | 2002-10-01 | Carlson | Applicant |
| US2002/0172153(A1) | 2002-11-01 | Vernon | Applicant |
| US2003/0014624(A1) | 2003-01-01 | Maturana et al. | Examiner |
| US2003/0097461(A1) | 2003-05-01 | Barham et al. | Applicant |
| US2004/0090936(A1) | 2004-05-01 | Cuny et al. | Examiner |
| US2004/0202166(A1) | 2004-10-01 | Dillon | Examiner |
Non-Patent Literature (27)
- Huan-Yun Wei; TcpMasq—“Active Bandwidth Management System” Open Source; URL http://www.cis.nctu.edu.tw/˜gis87517; Pointer = Publication as of May 8, 2002.Applicant
- Gong et al. “Study of a two level flow control scheme and buffering Strategies”, INFOCOM '94 Networking for Global Communications, 13 sup.th Proceedings IEEE (94CH3401-7), vol. 3, pp. 1124-1233 (Jun. 1994).Applicant
- Balakrishnan, H., et al., “Improving TCP/IP Performance Over Wireless Networks”, Proc. of l.sup.st AMC Conf. on Mobile Computing and Networking, Berkeley, CA, pp. 1-10 (Nov. 1995).Applicant
- “10 Protocol Layering”, TCP/IP, vol. I, pp. 139-144 (1991).Applicant
- RFC 1122, “Requirments for Internet Hosts”, Branden, ed., pp. 1-116 (1989).Applicant
- RFC 793, “Transmission Control Protocol--DARPA Internet Program Protocol Specification”, Postel, ed., pp. 1-87 (1981).Applicant
- Roberts, L. G., “Explicit Rate Flow Control” [email protected];http://www.ziplink.net/lroberts/EX. . . ate/ Explicit-Rate-Flow-Control.htm, pp. 1-14 (Apr. 1997).Applicant
- Thomas, S.A., “IPng and the TCP/IP Protocols”, John Wiley & Sons, Inc., pp. 239-240, 1996.Applicant
- “20.3 Sliding Windows”, TCP/IP Illustrated, vol. 1, pp. 280-284 (1991).Applicant
- “TCP: Flow Control and Adaptive Retransmission”, TCP/IP, vol. II, pp. 261-283 (1991).Applicant
- “2.5 The Idea Behind Sliding Windows”, TCP/IP, vol. I, pp. 175-177 (1991).Applicant
- “12.10 Variable Window Size and Flow Control”, TCP/IP, vol. 1, pp. 182-194 (1991).Applicant
- Comer et al., “A Rate-Based Congestion Avoidance and Control Scheme for Packet Switched Networks,” 10th Int'l Conference on Distributed Computing Systems, IEEE Computer Society Press, Los Alomitos CA (1990).Applicant
- Dighe et al., “Congestion Avoidance Strategies in Broadband Packet Networks,” Proceedings vol. 1, IEEE Infocom '91 (1991).Applicant
- Finn Arve Aagesen, “A Flow Management Architecture for B-ISDN,” Integrated Broadband Communication Networks and Services (1993).Applicant
- Chakrabarti et al., “Adaptive Control for Packet Video,” Proceedings of the Int'l Conference on Multimedia Computing and Systems, IEEE Computer Society Press (1994).Applicant
- Bolot et al., “A Rate Control Mechanism for Packet Video in the Internet,” Proceedings vol. 3, IEEE Infocom '94, IEEE Computer Society Press (1994).Applicant
- Hong et al., “Performance Evaluation of Connectionless Packet Service for ATM Networks,” Proceedings IEEE Global Telecommunications Conference (Globecom '95) (1995).Applicant
- Kanakia et al., “An Adaptive Congestion Control Scheme for Real-Time Packet Video Transport,” SIGCOMM'93 Conference Proceedings, Computer Communication Review (1993).Applicant
- Song et al., “An Algorithm for Flow and Rate Control of XTP,” Technical Program Conference Record vol. 1/3, IEEE Int'l Conference on Communications '93 (1993).Applicant
- Gerla et al., “Comparing ATM Credit-Based and Rate-Based Controls for TCP Sources,” MILCOM 95, Universal Communications, Conference Record, IEEE, Part vol. 1, 1995, pp. 6-10 vol. 1 New York, NY.Applicant
- V. Jacobson. Congestion avoidance and control. In ACM SIGCOMM '88, vol. 18, 4, pp. 314-29 (1988).Applicant
- Huynh et al. Performance Comparison Between TCP Slow-Start and a New Adaptive rate-Based Congestion Avoidance Scheme. Proceedings of the 2nd Int'l Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, IEEE 1994.Applicant
- Zygmunt Haas. Adaptive Admission Congestion Avoidance Control. Computer Communications Review, vol. 21, No. 5, pp. 58-76. ACM SIGCOMM, 1991.Applicant
- Ramakrishnan et al. A Binary Feedback Scheme for Congestion Avoidance in Computer Networks. ACM Transactions on Computer Systems, vol. 8, No. 2, pp. 158-181. May 1990.Applicant
- Choi et al. On Acknowledgment Schemes of Sliding Window Flow Control. IEEE Transactions on Communication, vol. 37, No. 11 (1989).Applicant
- Huan-Yun Wei; TcpMasq - “Active Bandwidth Management System” Open Source; URL http://www.cis.nctu.edu.tw/˜gis87517; Pointer = Publication as of May 8, 2002.Applicant