Patent Publication Number: US-5426635-A

Title: Method for adaptive control of windows and rates in networks

Description:
TECHNICAL FIELD 
     This invention relates to methods for controlling congestion on data networks. In particular, the invention relates to methods for adaptively controlling window sizes and rates of admission of data on the network. 
     BACKGROUND OF THE INVENTION 
     The use of data networks for the reliable high speed transport of information, such as text, voice, video, etc., over wide areas in digital format via a variety of media including optical fibers is bringing major changes to network services and network architecture/infrastructure design. Many new services having diverse characteristics and bandwidth requirements are now feasible. One emerging example of such data networks is Broadband ISDN (BISDN), which is designed to support a variety of applications such as interactive and distributed audio, video and data communications. The principal transfer mode for BISDN is called Asynchronous Transfer Mode (ATM). ATM is a high-bandwidth, low delay, packet-like switching and multiplexing technique. See, S. E. Minzer, &#34;Broadband ISDN and Asynchronous Transfer Mode,&#34; IEEE Comm. Mag., pp. 17-24, September 1989. 
     FIG. 1A illustrates a typical high speed network 100 comprising switching nodes 106-i connected by high-bandwidth data links 108-j. Inputs to the network 100 are from user locations 101-k, k=1, 2, . . . , NS. These inputs may be of any form, but are conveniently formatted at the user locations into fixed-length packets or cells (the terms will be used interchangeably in the sequel) for transmission to other user locations or to gateway or inter-network nodes 110, which nodes are from a user location 101-k is not in the proper form, switching nodes 106-i are arranged to appropriately format the input data. Communication between user location 101-k (or between a user location and an off-network location, e.g., via link 112) is advantageously via virtual circuits, as is well known in the art. 
     It proves convenient to associate a so-called &#34;window&#34; with each virtual circuit, which window represents the total number of cells in transit through the virtual circuit at any time. In some networks many cells may be in transit between an originating node, e.g., 106-1 and a terminating node, e.g., 106-2 in FIG. 1A. The in-transit cells may be propagating through a link 106-i, or they may be temporarily queued at one of the nodes along the path of the virtual circuit. Thus the windo size, conveniently identified by the value K (in units of packets or cells), may be fairly large. 
     Some networks use explicit acknowledgement signals from the terminating node of a virtual circuit back to the originating node of a virtual circuit to indicate the error-free reception of packet or cell. Such acknowledgement signals can then be used to advance the window, thereby admitting a new cell into the virtual circuit. Conversely, when congestion is indicated, e.g., by a feedback signal from a downstream node, or when an error is detected requiring a retransmission between links in the network, the window can shrink or remain stationary. Variants of such &#34;flow control&#34; in the face of errors or congestion are known in the art. 
     The afore-mentioned queues, when needed, are typically implemented using buffer memory at each node along a virtual circuit. These buffers may be shared, as is typical for the so-called first-come-first-served (FCFS) service discipline, or they may be provided on a per-virtual-circuit basis when using a service discipline such as a round-robin (including weighted round-robin, WRR) discipline. The service discipline, in any event, allocates available node output capacity (e.g., trunk bandwidth) to meet the competing service requirements for each virtual circuit. It sometimes proves advantageous to allocate available bandwidth in light of the nature of the data sources, e.g., giving one class of service for relatively short, bursty inputs and another class of service to virtual circuits carrying large file transfers. In high speed networks, the very great amount of data flowing requires that buffering, allocating and other control functions be performed in a very rapid fashion. It is therefore very important that these functions be performed with minimum complexity. 
     Some data services are based on an agreed-upon grade of service. For example, a service provider and a user may agree that each virtual circuit (VC) is to have a &#34;Committed Information Rate (CIR).&#34; Thus a quiescent user seeking to start up or commence sending data over a VC expects to receive at least its CIR almost immediately. A number of techniques have been developed to help ensure that competing demands for service are handled in such manner as to minimize congestion and avoid loss of data transmitted within the agreed-upon CIR. See, e.g., U.S. Pat. Nos. 4,769,810 and 4,769,811 issued to Eckberg, et al on Sep. 6, 1988. Congestion control techniques are discussed generally in U.S. Pat. No. 5,014,265 issued May 7, 1991 to Hahne, et al, and in Tanenbaum, Computer Networks, 2nd Ed., Prentice Hall (1988), pp. 223-239, 287-288 and 309-322. 
     Advantageously, an Admission Controller is used to restrict the total number of VCs at each node, and to monitor the sum of CIRs, for the VCs that have been admitted, to the total bandwidth. See &#34;Performance Evaluation and Design of Multiservice Networks,&#34; J. W. Roberts, Ed. Final Report of the Cost 224 Project, Commission of the European Communities (1992); R. Guerin, H. Ahmadi and M. Naghshineh, &#34;Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks,&#34; IEEE J. Selected Areas Comm., vol. 9, pp. 968-981 (1991); A. Elwalid and D. Mitra, &#34;Effective Bandwidth of General Markovian Traffic Sources and Admission Control of High Speed Networks,&#34; IEEE INFOCOM&#39;93, pp. 256-264 (1993). It is generally desirable that the network control be responsive in providing &#34;bandwidth on demand&#34; to any VC, even if the amount required is in excess of its CIR, provided of course that this can be done while meeting contractual obligations to all VCs which are on at the time. 
     Fairness is a major goal of feedback-based congestion control. Such fairness typically encompasses several aspects. A first is that a VC should receive at least its CIR at any time it is required. This implies that when a VC turns on from a quiescent state, the network must respond speedily. Second, it is common for a VC to require bandwidth in excess of its CIR. Moreover, given the bursty nature of many sources, it is quite typical for the network to have bandwidth in excess of the sum of the CIRs of the active VCs. Such excess bandwidth is desirably made available to requesting VCs in a rational way, e.g., in proportion to their CIRs. A final desiderata is that fairness hold not only over long time periods, but also over relatively short time periods. &#34;Best Effort&#34; service, wherein the network makes no guarantees but attempts to make bandwidth available fairly, is the particular case of the above in which the CIRs are set to zero. 
     Feedback can be used to regulate both rates of admission of new data onto the network and window size, so as to respond to demands for bandwidth in an efficient and fair manner. Rates and windows are related in several major respects. In window-based control, a natural rate is the throughput, measured in packets per unit time. In wide area, high-speed networks, the throughput is close to the window size (in packets) per round-trip propagation delay over a broad range of practical operating conditions. This simple relation is the bridge between the two quantities, and thus methods for adapting rates based on feedback are in one-to-one correspondence with methods for adapting windows. 
     Traffic management and congestion control design of these high speed, wide area networks to ensure efficient bandwidth utilization, bandwidth availability and fairness among users has proved challenging. Some key issues or criteria in evaluating the effectiveness of network traffic management and congestion control methods include: 1) fairness in short and long term behavior among VCs in competing for bandwidth, 2) the effect of large amplitude oscillations in network behavior caused by delayed feedback, 3) transient behavior, i.e. the quality of the responsiveness in a dynamic environment, 4) the ability to arbitrarily allocate bandwidth to different VCs as is typically required, 5) dealing with various propagation delays in the network which sometimes tend to discriminate against VCs on longer paths, 6) fulfilling contractual guarantees from the network to the user and 7) robustness of the design process in terms of network performance sensitivity to parameter values. K. K. Ramakrishnan and R. Jain, &#34;A Binary Feedback Scheme for Congestion Avoidance in Computer Networks with a Connectionless Network Layer,&#34; Proc. ACM SIGCOMM, pp. 303-313 (1988); V. Jacobson, &#34; Congestion Avoidance and Control,&#34; Proc. ACM SIGCOMM, pp. 314-329 (1988). 
     Traffic on the network may be controlled by a variety of methods, e.g. by regulating the admission of new data onto the network, by regulating the window size, etc. See generally, I. W. Habib and T. N. Saadawi, &#34;Controlling Flow and Avoiding Congestion in Broadband Networks,&#34; IEEE Comm. Mag., pp. 46-53, October 1991; H. Gilbert, O. Aboul-Magd and V. Phung, &#34;Developing a Cohesive Traffic Management Strategy for ATM Networks,&#34; IEEE Comm. Mag., pp. 36-45, October 1991; A. E. Eckberg, B. T. Doshi and R. Zoccolillo, &#34;Controlling Congestion in B-ISDN/ATM: Issues and Strategies,&#34; IEEE Comm. Mag., pp. 64-70, September 1991; J. W. Roberts, &#34;Variable-Bit-Rate Traffic Control in B-ISDN,&#34; IEEE Comm. Mag., pp. 50-56, September 1991; D. Hong, and T. Suda, &#34;Congestion Control and Prevention in ATM Networks,&#34; IEEE Network Mag., pp. 10-16, July 1991. However, any management or congestion control scheme must contend with the physical limitations of the network. In particular, propagation delays (a consequence of the physical area served by the network and the finite speed of signals transmitted over the network) combined with high transmission rates (a consequence of a desire to transmit as much information in the shortest time possible) conspire to create large delay-bandwidth product. Large delay-bandwidth products make traffic regulation on or control of the network difficult because: 1) at any given time a large amount of data is on the network (a consequence of the large bandwidth aspect of the network); 2) feedback signals describing the state of congestion on the network do not instantaneously reach the mechanisms that control network traffic (i.e. the propagation delay aspects); and 3) by the time the feedback signals arrive, additional data is already in transit. Thus, regulation information describing the state of the network is dated, and the controls triggered by the information can result in improper regulation of the network. Improper regulation can lead to the loss of large amounts of data on the network requiring costly and time-consuming retransmission. Additionally, traffic controls can be triggered which can lead to undesirable oscillations in the traffic flow. 
     Existing algorithms for network traffic management are often based on packet-by-packet adaptation, precision arithmetic and implicit feedback. See generally, D. Mitra and J. B. Seery, &#34;Dynamic Adaptive Windows for High Speed Data Networks: Theory and Simulations,&#34; Proc. ACM SIGCOMM, 30-40 (1990); D. Mitra and J. B. Seery, &#34;Dynamic Adaptive Windows for High Speed Data Networks with Multiple Paths and Propagation Delays,&#34; Computer Networks and ISDN Systems, vol. 25, pp. 663-679 (1993); A. Mukherjee and J. C. Strikwerda, &#34;Analysis of Dynamic Congestion Control Protocols--A Fokker-Planck Approximation,&#34; Proc. ACM SIGCOMM, pp. 159-169 (1991); and K. W. Fendick, M. A. Rodrigues and A. Weiss, &#34;Analysis of Rate-Based Feedback Control Strategy for Long Haul Data Transport,&#34; Performance Evaluation, vol. 16, pp. 67-84 (1992). 
     However, new incentives to design other methods have arisen from the availability of a single bit for forward and backward explicit congestion notification, e.g., in the Asynchronous Transfer Mode (ATM) switching format for BISDN. The response-time based algorithms, modified by 1-bit explicit feedback, have been explored using the FCFS service discipline and have proved unsatisfactory in terms of &#34;fairness&#34; of bandwidth allocation between VCs. Excess bandwidth is not allocated fairly to the active VCs in either short-term or long-term. Also, typically, the start-up VC in the presence of established VCs with large bandwidth allocations finds it difficult to obtain its fair share. See, e.g., A. Mukherjee and J. C. Strikwerda, &#34;Analysis of Dynamic Congestion Control Protocols--A Fokker-Planck Approximation,&#34; Proc. ACM SIGCOMM, pp. 159-169 (1991). Such forms of unfairness are unacceptable, not remedied by tinkering with the design parameters, and fundamentally rooted in the combination of the three features: packet-by-packet adaptation, 1-bit explicit feedback, and FCFS service discipline. 
     The fairness aspect is improved when the service discipline is changed from FCFS to WRR. This combination is fair to all VCs and gives exemplary performance in all other respects, particularly in responsiveness to changing traffic conditions. A large part of this is derived from the packet-by-packet adaptation, which allows rapid adaptation when the throughput is high. Unfortunately, this same feature is a liability when used in conjunction with the FCFS service discipline. A. Demers, S. Keshav and S. Shenker, &#34;Analysis and Simulation of a Fair Queueing Algorithm,&#34; J. Internetworking Res. Experience, 3-26 (1990), and L. Zhang, &#34;Virtual Clock: A New Traffic Control Algorithm for Packet Switching Network,&#34; Proc. ACM SIGCOMM, 19-29 (1990) are illuminating on the role of service disciplines, albeit in the feedback-free framework. 
     The FCFS service discipline has important advantages: first, memory is more efficiently shared and thus smaller buffer memory usually suffices; second, it is cheaper and simpler to implement. Therefore, there is a need for methods for congestion control which use the FCFS discipline in which, furthermore, processing capability requirements are reduced by adapting rates and windows periodically and relatively infrequently. 
     The weighted round-robin (WRR) discipline is harder and more expensive to implement. Nonetheless, it has major advantages which make it the discipline of choice for VCs in certain applications. These applications are typically those which require a guaranteed, high grade of service in terms of bandwidth and delay. Isolation from the rest of the network, which the WRR discipline provides, makes such guaranteed performance possible. Desirably, future high speed networks will exploit both the FCFS and WRR disciplines, with VCs requiring guaranteed high grade of service using WRR and other VCs sharing buffers and bandwidth using the FCFS discipline. See D. D. Clark, S. Shanker and L. Zhang, &#34;Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism&#34;, Proc. SIGCOMM &#39;92, pp. 14-26, (1992). 
     SUMMARY OF THE INVENTION 
     New methods are presented for the adaptive control of windows and rates, especially in networks in which the end-to-end propagation delay is relatively large. These methods may be used, e.g., in the virtual circuit (VC) environment in which the network ideally provides at least the CIR whenever a VC is active and, to the extent possible, makes available additional bandwidth on demand on an equitable basis. One illustrative method advantageously uses (i) periodicity, i.e., time is slotted and a distant switch provides feedback at most once in every time slot, an interval which advantageously may vary from a fraction to a multiple of the round-trip propagation delay; (ii) feedback in the form of a single bit (as used in existing and emerging ATM and Frame Relay standards, for example), which indicates if the instantaneous queue length is above or below a threshold; (iii) a First-Come-First Served service discipline; and (iv) systematic damping and control of a gain signal. 
     The methods given for the feedback-based adaptive control of windows and rates for the FCFS discipline are used in other illustrative networks where either the WRR discipline is used exclusively or a combination of the FCFS and WRR disciplines are used. 
     An analytic fluid model of the methods is disclosed which can advantageously be used to select parameters of the method and permit evaluation of the effectiveness of the congestion control methods. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     Other features and advantages of the invention will become apparent from the following detailed description taken together with the drawings in which: 
     FIG. 1A is a diagram of a generalized data network having a plurality of nodes and connecting links useful in providing virtual circuit communications. 
     FIG. 1B is an illustrative packet (cell) format for a data communication system like that shown in FIG. 1A. 
     FIG. 1C is representation of a part of the network of FIG. 1A illustrating a virtual circuit with feedback and certain of its features. 
     FIG. 2 is a block diagram of a high speed network with feedback and FCFS source. 
     FIG. 3 illustrates sequences of ideal and actual window updates. 
     FIG. 4 illustrates a method for adaptively controlling window size using one-bit, explicit, periodic feedback and damping. 
     FIG. 5 is a graph of the performance of windows for two virtual circuits using the disclosed method. 
     FIG. 6 is a graph of the periodic solution in the Saturated Regime. 
     FIG. 7 is a graph of the mean flow rate and mean buffer content in different regimes. 
     FIG. 8 is a graph of solution to the fluid models for the different regimes. 
     FIG. 9 is a block diagram of network with feedback control and Weighted Round Robin Service. 
     FIG. 10 is a block diagram of network with feedback control and combination of FCFS and WRR Service. 
    
    
     DETAILED DESCRIPTION 
     I. Overview 
     FIG. 1B shows a typical cell (packet) format useful in systems of the type shown in FIG. 1A. In particular, the format shown in FIG. 1B shows a data portion 141 and a header portion 142. The header or control portion typically contains various address and control information, including a congestion control field 143. Often, the congestion control field may contain only a single bit that is set to a predetermined condition, e.g., to a 1, by a node experiencing congestion through which the cell is passing. If a cell arrives at the end of a VC without having its congestion control field altered to indicate congestion, the receiving user will, upon examining that field, usually conclude that no congestion has been encountered by the cell in its passage through the VC. An appropriate feedback signal can then be sent to the originating user location. Alternatively, intermediate nodes in a VC can likewise conclude that a cell received without its congestion field set to the predetermined condition has not encountered congestion thus far in its travel along the VC. Consequently, the first node in the path of the VC which is experiencing congestion can send an appropriate signal to the originating user location. 
     FIG. 1C shows in greater detail a particular virtual circuit in the network of FIG. 1A. The elements 158-i and 156-i, i=1,2, . . . , M represent the buffers and server function at each node 106-i in the network of FIG. 1A. The i th  server is shown having a rate (e.g., transmission capacity) of μ i . Propagation delay D f .sbsb.i for the forward direction through the VC between the i th  and (i+1) th  node, i=1, . . . M-1, is represented by the block 160 and the propagation delay for the transmission from the Mth node back to the first node, D b , is represented by the block 170. Feedback, and corresponding feedback delay may be used between nodes other than the last and first in a VC. The window is shown as having a value of K. 
     The dashed lines 171 and 172, respectively, in FIG. 1C represent virtual circuit traffic leaving and seeking to be added to nodes, such as node 2, through which the subject VC passes. Such other traffic entering at a node competes for resources available at the node with traffic in other VCs at the node. Traffic leaving prior to being presented at a node, e.g., node 2 in FIG. 1C, of course ceases to compete for resources at that node, but may compete at another node along its VC before being finally delivered to its destination. 
     FIG. 2 is a block diagram of a portion of high speed data network using FCFS service discipline. A plurality of VCs, VC j , j=1, . . . , C, originating at respective sources, S j  and having respective round trip delays τ j , equally divided between forward and backward paths are shown, for simplicity, connected to only a single switch or node 204. It will be understood that in general a network will include a plurality of nodes 204. The switching node 204 is shown having a shared buffer 206 for queueing cells arriving from VCs; the serving (bandwidth allocation) function is represented by server 208. The various propagation delays for the VCs reflect the general case where sources 202 S 1 , S 2 , . . . S c  may be located at various geographical sites. In FIG. 2, λ and Q T  represent, respectively, the service rate and a queue threshold at node 204. The packet size is assumed constant. 
     The following sections describe in greater detail methods of congestion control for high speed data networks described above. Initially, the methods described advantageously use the FCFS discipline and explicit, periodic feedback. The feedback signals are advantageously not provided on a cell by cell basis, but rather are periodically sent from the node, such as 204 in FIG. 2, back to the sources S i . The use of periodic feedback considerably reduces the computational complexity and reduces the data flow. These feedback-based adaptation algorithms can also be used in networks which employ the WRR service discipline, as described below in connection with FIG. 9, and in networks which integrate both the FCFS and WRR service disciplines, as shown in FIG. 10. 
     The feedback is &#34;explicit&#34; in that the switch, e.g., 204 in FIG. 2 accurately generates information to be contained in the congestion field and the network protocol arranges for the sources S j  to receive the information after the unavoidable propagation delay. The periodicity and FCFS features allow for low cost implementations, with the former leading to lower processor costs. Nonetheless, exemplary performance, including fairness in both the short and long terms, is obtained by the novel use of damping associated with a damping value, γ. As will be seen more fully below, the use of an appropriately selected gain parameter, α, effectively suppresses tendencies toward reduced dynamic range and sluggish transient behavior. 
     Section II describes basic periodic, illustratively 1-bit feedback, adaptive methods as well as various refinements used in conjunction with the FCFS service discipline. Section III gives periodic, 1-bit adaptive methods for use in conjunction with the WRR discipline and combinations of the FCFS and WRR disciplines. Section IV gives analytic results relating to these methods. More particularly, an analytic fluid model is disclosed using two first-order coupled delay-differential equations which reflects the propagation delay across the network. The results of analysis using this model guide the selection of parameters for methods useful in each of two operating regimes, Unsaturated and Saturated. The operating regimes are, in turn, determined by a ratio α/γ. In steady state the unsaturated regime gives unutilized capacity and oscillation-free flow and empty buffers. In the saturated regime all the bandwidth is utilized and both the flow and queue exhibit oscillations around λ and the threshold, respectively. Acceptable adaptability and transient behavior is typically achieved by operating somewhat in the Saturated Regime. However, regardless of the regime in which the network is operated, each of the VCs get fair treatment, e.g., the ability to transmit at its CIR at all times and have access to an equitable share of any currently available excess bandwidth. Moreover, equalization from arbitrary initial conditions is typically exponentially fast with rate proportional to γ, the damping constant. 
     II. Methods for Adaptive Control of Windows and Rates in Data Networks 
     This section describes the methods which are used in conjunction with a FCFS service discipline to control window size and data rates for sources S j  in FIG. 2. The following section describes methods using a WRR discipline and for combinations of WRR disciplines with FCFS disciplines. 
     In the high speed network of FIG. 2, time is slotted, i.e., time is divided into intervals of length Δ. Values for Δ generally range from 0.1 to 10 times the typical round trip cell propagation VC delay, depending on the system processing capabilities. The choice of Δ is flexible, and network performance is typically robust over a wide range of values of Δ. Moreover, the time slot Δ may be different for different VCs. The general method of operation is that the distant switch 204 broadcasts a 1-bit message indicating the state of congestion once every slot to all sources of VCs passing through the switch. In preferred embodiments the operations can be made somewhat different and more economical: the switch broadcasts at the time of the first departure of a packet in every time slot. Thus, during idle periods, the switch may not broadcast for several (or many) slots. The source compensates for lack of explicit notification during the idle periods by inferring that the switch&#39;s buffer content was below the threshold. 
     Let K j ,I denote the &#34;ideal window&#34; for VC j  (j=1,2, . . . , C) in the Ith slot, i.e., in the time interval ((I-1)Δ, IΔ). In this context &#34;ideal&#34; need not imply optimum or best window size in any absolute sense, but rather may refer to calculated or target window size. The following adaptation is advantageously implemented by the source at most once in every time slot, on first receipt of a 1-bit feedback message in that time slot. 
     
         K.sub.j,I =(I-d(I)γ.sub.j)K.sub.j,I-d(I) -α.sub.j d(I)B.sub.I (I=1,2,, . . . )                                          (2.1) 
    
     where B I  ε{-1,1} is the 1-bit message from the switch received by the source in the Ith slot. B I  =1 if the buffer content at the switch exceeded the threshold Q T  at the time the transmission of the message was initiated, and B I  =-1 otherwise. Note that the feedback bit B I  is received, possibly at different times, by all sources. In (2.1), d(I) is the number of time slots since the switch last transmitted a feedback signal. Typically d(I)=1. Finally, α j  is the gain and γ j  is the damping constant for VC j . More generally, it is possible to compute an ideal window (and, as demonstrated below, a rate) utilizing the previous l ideal windows and the previous l&#39; one-bit messages. Although this may lead to more responsive behavior, the processing costs and design costs for setting parameters become much greater and therefore may not be appropriate in some applications. Thus, in a preferred embodiment only the prior ideal window size and most recently received one bit message are used. 
     The value of the ideal window in (2.1) when a VC turns on is influential in determining how much bandwidth the VC receives in the short-term. Various embodiments described later aim to make an appropriate selection for this initial value, using information on the VC&#39;s CIR and other network parameters. 
     For fixed gain α, two rather different forms of (2.1) are obtained when the damping constant γ j  =0 and when 1&gt;γ j  &gt;0. When γ j  &gt;0 the ideal window is computed with less weight placed on the past history of the window behavior and more relative weight given to the most recent feedback signal. This shift in relative weights allows the system to forget the distant past more easily, and actually aids the newly turned on VCs to obtain their share of the bandwidth. More generally when the gain is varied, the ratio α/γ determines the relative weightings given to the past history and the most recent feedback. Typical values (see FIG. 5) for these variable for a two-VC case are γ 1  =γ 2  =0.0025, Q T  =12, λ=264, and τ=1.0. When more than two VCs are involved and when particular user requirements or network contraints dictate, other particular values for these quantities will prove useful to those skilled in the art. It often proves convenient to have α/γ approximately equal to λ. 
     The actual implementation of (2.1) in a preferred embodiment is usually somewhat different, since it must take into account the integrality of the window length and the limited opportunities for reducing the window. Updating of the actual window is done at the source typically with every acknowledgement. Typically there are several acknowledgements in any time slot. Let n index the acknowledgements received by the source and let K j ,n denote the &#34;actual window&#34; of the j th  VC. The actual window attempts to track the ideal window and the difference between the two windows is small, except for occasional, typically quite short, periods. Typically, the change in the actual window in any update is restricted to one of the following:-1,0,1. That is, ##EQU1## where I is the interval in which the n th  acknowledgement is received. FIG. 3 illustrates illustrative sequences of ideal and actual window updates. Note that when the actual window decreases, the size of the decrement is necessarily unity. In a preferred embodiment increments are also unity. However, in the more general case, increments may be larger. 
     FIG. 4 is a flow chart illustrating an implementation of the updating of the window size in accordance with the above-described techniques. As shown in FIG. 4, values for the variables in Eqs. 2.1 and 2.2 are conveniently initialized in block 400. Receipt of a feedback signal is determined by the decision block 405, and n is incremented in block 407. If a new time slot has begun, I is incremented in block 415. Then a new ideal window is determined in block 425 in accordance with Eq. 2.1. If the current time slot has not expired, the same K j ,I value is used unchanged. The ideal window value is then used in accordance with Eqs. 2.2 to update the value for the actual window in block 450. In particular, if the condition for Eq. 2.2,i is satisfied, then the actual window size is decremented via block 435 in accordance with Eq. 2.2,i. Likewise, if the condition for Eq. 2.2, iii is satisfied, then the window is incremented via block 445 in accordance with that equation; otherwise, Eq. 2.2,ii is used, and the window size is unchanged. 
     Various modifications to (2.1), the updating algorithm for the ideal window, are described below. However, (2.2) advantageously remains fixed since its objective is simply to make the actual window closely track the ideal window. FIG. 5 is a graph showing windows for two VCs using the method described above. The upper plots depict the performance of two virtual circuits, VC1 and VC2, in terms of the window size as a function of time. Both virtual circuits are initially off, but when they are activated, the upper plots demonstrate that the virtual circuits each quickly receive approximately half the bandwidth allocation while the queue depth remains consistently relatively low as indicated in the lower plots. The selected parameters were: α 1  =α 2  =10/16, Δ=1/10, γ 1  =γ 2  =0.0025, Q T  =12, λ=264, τ=1.0. This figure indicates that the shortcomings of previous methods for window control, i.e. inequities between VCs, unfairness of bandwidth allocation, etc., are avoided. Both VCs are allocated an equal amount of bandwidth and the queue length remains at a manageable level. 
     In another embodiment of the method, (2.1) is modified to incorporate a mechanism called &#34;Floor&#34;, which is motivated by the network&#39;s guarantee of the CIR. Say CIR j  is the Committed Information Rate for the j th  VC, and let K j ,floor Δτ j  (CIR j ). The modified version of (2.1) is 
     
         K.sub.j,I =max[K.sub.j,floor,{(1-d(I)γ.sub.j)K.sub.j,I -d(I)-α.sub.j d(I)B.sub.I }](I=1,2, . . . )         (2.3) 
    
     To illustrate the power of the Floor, consider the situation during start-up of a VC j  from an actual window which is, say, zero. Since the initial ideal window is at least K j ,floor, initially, while the actual window is less than the ideal window, the actual window grows exponentially. One of the effects of the Floor is to ensure that the ideal window never falls below the value corresponding to the CIR. Hence the effect of this mechanism is to ensure that the actual window grows quickly from arbitrary initial values to its CIR and thereafter, while the VC is active, never falls below it. 
     In a further embodiment, a mechanism called &#34;Ramp-up&#34; ensures that VCs realize their CIR soon after start-up. The procedure is as follows: first, the window corresponding to the CIR is calculated; next, all the packets in one window are transmitted during the interval τ, corresponding to the round-trip delay of the VC, immediately after start-up without waiting for feedback. The recommended procedure is to transmit these packets uniformly spaced in time. This mechanism ceases to be operative after the initial period τ following start-up. 
     The mechanism of Ramp-up is an enhancement of Floor in that it gets the VC its CIR even faster after start-up. Ramp-up directly influences the actual window, while Floor affects the ideal window directly and the actual window indirectly. In Floor the actual window, while growing exponentially fast, will still take longer to attain its CIR from quiescence; in Ramp-up it is guaranteed to do so in one round-trip delay. The higher speed of response comes at the cost of higher packet queues at the distant switches. 
     In a further embodiment called &#34;Ceiling&#34;, the method updates the ideal window to prevent it from exceeding a prespecified value, K j ,ceil : 
     
         K.sub.j,I =sat.sub.j [(1-d(I)γ)K.sub.j,I-d(I) -α.sub.j d(I)B.sub.I ](I=1,2, . . . )                              (2.4) 
    
     where sat j  (·) is typically selected as: ##EQU2## In (2.5) K j ,floor is the parameter associated with aforementioned Floor mechanism, which may be disabled at the operator&#39;s discretion by setting it to 0. Similarly, the Ceiling may be disabled by setting K j ,ceil to a suitably large number (any number in excess of the window corresponding to the total bandwidth will suffice). 
     Ceiling prevents any one VC from obtaining more bandwidth than is implied by K j ,ceil, even when it is the sole active VC. Ceiling lessens the impact on the packet queue at the distant switch when a small number of VCs are active and several more turn on at about the same time. Without Ceiling the surge in the queue is much larger, which in turn calls for larger buffers if packet losses are to be avoided. 
     Lastly, a &#34;Broadcasting&#34; feature may advantageously be implemented by requiring the source of VCs to receive the periodic, 1-bit feedback signal from the distant node, and to update its ideal window even while quiescent. This feature allows quiescent VCs to know about currently available bandwidth, so that, at the time of transition to activity, the actual window (which is possibly zero) can grow rapidly to the ideal size. Of course if Floor and/or Ramp-up are already incorporated in the method, then the incremental benefit accrues when the ideal window is above the Floor. This situation arises when only a small number of VCs are active, and consequently excess bandwidth is available. A possible drawback of Broadcasting is that there is a surge in the queue at the distant node immediately after a VC turns on, which lasts for a very short interval before rapidly dissipating. The Floor, Ramp-up, Ceiling and Broadcasting features are typically well-suited to bursty traffic in VCs in which the source alternates between periods of activity and quiescence. 
     As has been mentioned earlier, rate adaptation closely parallels window adaptation. Let R j ,I (the counterpart of K j ,I) denote the &#34;ideal rate&#34; for VC j  (j=1,2, . . . , C) in the I th  slot. Its adaptation is implemented by the source at most once in every time slot, on receipt of a 1-bit feedback message, thus 
     
         R.sub.j,I =(1-d(I)γ.sub.j)R.sub.j,I-d(I) -α.sub.j d(I)B.sub.I (I=1,2, . . . )                                           (2.6) 
    
     where B I  is the 1-bit message from the switch received by the source in the I th  slot. Here d(I) is as defined earlier in (2.1), while γ j  and α j  are again the damping and gain parameters. As with (2.1), (2.6) may be modified to incorporate information from many prior slots. In contrast to the window-based algorithms, there are no restrictions on the realization of the &#34;actual rate&#34; R j ,I, and hence the actual rate coincides with the ideal rate, i.e., R j ,I =R j ,I. 
     The source associated with the VC j  uses the rate R j ,I to determine the times for packet transmission during slot I in one of two ways: (i) the time between consecutive packet transmission is set to 1/R j ,I ; (ii) the time between consecutive packet transmission is random with a distribution, such as the exponential or the uniform, with mean set to 1/R j ,I. 
     All the embodiments mentioned for the window-based adaptation have a rate-based equivalent as will be recognized by those skilled in the art. The CIR of a VC translates naturally to a floor for the rate, R j ,floor. For such a selection, the objective of Ramp-up is automatically satisfied in the rate-based framework. A maximum rate for the VC j  translates to the ceiling parameter R j ,ceil. Broadcasting carries over without change. 
     III. Methods for Adaptive Control of Windows and Rates with the WRR Discipline 
     FIG. 9 shows an alternative buffering arrangement to that shown above in FIG. 3. In particular, FIG. 9 illustrates the so-called Round Robin buffering and resource allocation discipline. As in the FCFS discipline discussed in connection with FIG. 3, time is again slotted, with Δ denoting the time slot length, as before. Typical values for Δ will fall within the ranges cited above for the FCFS discipline. 
     It will be observed that each VC i  has its own buffer 910-i, i=1,2, . . . , C. Service is again provided by a server 920 with capacity (e.g., bandwidth) λ operating on each of the VC queues in turn. The sequential nature of the servicing is represented by the scanner or commutator 915 in FIG. 9. Advantageously, service is provided only to buffers that contain packets to be transmitted. The Round-Robin discipline generally permits service to be provided in an unequal manner to the queues in buffers 910-1, i.e., the &#34;weighting&#34; may be unequal between the respective queues. Such weighting is characterized as the so-called Weighted Round-Robin discipline for allocating bandwidth (or other resource). In some cases, however, it may prove advantageous to employ equal weighting for all VC subject to Round-Robin queueing and allocation. 
     The individual buffers 910-i for the VCs may be separated only logically, i.e. in software through the use of pointers, while being physically co-located in a common memory. The aforementioned weights determine templates, which stipulate the order and frequency with which the switch processor services the individual buffers of the VCs. See M. Katevenis, S. Sidiropoulos and C. Courcoubetis, &#34;Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip&#34;, IEEE J. on Selected Areas in Commun., Vol. 9, No. 8, October, 1991, pp. 1265-1279. 
     In contrast to the embodiments described above for the FCFS discipline, each VC buffer has its own threshold, Q Tj , j=1,2, . . . , C. The general idea is that a distant switch in a VC sends a feedback message exclusively to the source of the VC, at most once in every time slot, based on the status of its buffer content with respect to the threshold. As for FCFS, it proves advantageous to use a simple 1-bit feedback message. Again, as with the FCFS discipline, each VC maintains an &#34;ideal window&#34;, which is adapted according to Eq. (2.1), as before. Also it proves advantageous to change the &#34;actual window&#34; in accordance with Eq. (2.2) with the objective of tracking the ideal window. 
     The WRR service discipline ensures isolation of individual VCs from the rest of the network and generally makes fairness easier to achieve as compared to method based on the FCFS discipline. Hence, damping is of less consequence and the damping parameter γ j  for VC j  may be set very small or zero. As in the FCFS case, the algorithm allocates spare bandwidth among active VCs, typically in proportion to their CIRs. 
     The primary role of the gains α j  is in determining the trade-off between speed of response just after a change in the number of active VCs, and the amplitude of fluctuations in the windows/rates after the network has settled. This trade-off is similar to the role of gains studied by D. Mitra and J. B. Seery in &#34;Dynamic Adaptive Windows for High Speed Data Networks with Multiple Paths and Propagation Delays&#34;, Computer Networks and ISDN Systems, Vol. 25, pp. 663-679 (1993). It is also noteworthy that with the WRR the gain for any VC does not usually have to be carefully tuned to the round-trip propagation delay. 
     The embodiments Floor, Ramp-up and Ceiling described in the preceding section for the FCFS discipline are all applicable without change to the WRR discipline. The Broadcasting feature by its very nature does not apply to the WRR discipline. The adaptations for windows are modified for adaptations for rates, just as has been described in the preceding section for the FCFS discipline. 
     FIG. 10 shows the use of feedback-based adaptation in a network having one or more nodes which integrate the FCFS with the WRR service discipline. The overall network is of the type shown in FIGS. 1A, B, C and 2, with feedback based on congestion at a node. In such networks several VCs of Class 1, e.g., VC 1 , VC 2  . . . , VC c , receive WRR service, i.e., each has its own buffer and a guaranteed proportion of the bandwidth. These proportions are illustratively indicated as 0.05, 0.07 and 0.05 for VC 1 , VC 2  and VC c , respectively. There are also several VCs of Class 2 which share a common buffer with other VCs. A proportion of the bandwidth is guaranteed for the common use of VCs of this class. In general, the FCFS VCs may advantageously be grouped as shown in FIG. 10. There, VC F1 , VC F2 , and VC F3  are conveniently grouped for service in a single buffer 960-1, while VC F4 , . . . , VC FC  are grouped for service in the single buffer 960-P. Other similar groupings of FCFS VCs may, of course, be similarly grouped. Each of the FCFS buffers 960-i is conveniently assigned a proportion of the bandwidth λ made available by serve 970. In the illustrative case shown in FIG. 10, buffer 960-1 is assigned 20 percent of the bandwidth and buffer 960-P is assigned 15 percent of the bandwidth. In some cases, all traffic from FCFS VCs can be combined in a single buffer having a single overall share of the bandwidth. In any event, packets within each FCFS buffer are assigned on an FCFS discipline. The packets in this shared buffer are serviced according to the FCFS discipline. There are similar shared buffers, serviced according to the FCFS discipline, for other classes of VCs. 
     The VCs of Class 1 adapt their windows/rates on the basis of periodically received feedback on the status of their private buffers. The adaptation methods are those used in conjunction with WRR service which have been described earlier in this section. The VCs of the other classes adapt their windows/rates on the basis of periodically received, feedback on the status of the respective shared buffer. The adaptation methods are those used in conjunction with FCFS service, and these have been described in Section II. 
     IV. Analytic Models 
     A. Introduction 
     This section discloses simple models of the adaptive method for the FCFS service discipline described in Section II above in which the packet streams are approximated by fluid flow. These fluid models do not have any stochastic elements and are described by systems of nonlinear delay-differential equations. The models are approximate; an important approximation is that the adaptation, as described in Section II, is periodic while in the model it is continuous. This approximation is acceptable as long as the periodic interval Δ is not large. This section demonstrates how to bridge results and parameters of the fluid models and those of the periodic, adaptive algorithms of the preceding sections. The results of the analytic models of this section give clear guidelines for the design of parameters in the adaptive algorithm. 
     B. Model 
     The model for a single virtual circuit (VC) is ##EQU3## Here φ (x) is the flow rate at time t and represents the fluid approximation to the local (in time) throughput of packets. Here τ is the round-trip propagation delay for the VC and λ is the effective service rate at the distant switch, as shown in FIG. 2. The constant A and Γ are the counterparts of the gain α and damping constant γ in the adaptation algorithm for windows and rates given in (2.1) and (2.6), respectively. The classical queuing-theoretic steady state throughput, T, is approximated by the long-term average: ##EQU4## In (4.2)x(t) approximates the queue in packets at the distant switch and x T  denotes the threshold. The nonlinear dynamics in (4.2) reflect the fact that the buffer content is nonnegative, i.e., x(t)≧0. Notice that a similar restriction which applies to φ(t) is not modeled. The reason is that the flow rate φ(t) is typically large in high speed data networks and the &#34;floor&#34; of φ(t) typically plays an insignificant role. This is in contrast to the design objective of small buffer contents. 
     The amount of fluid in the network at time t is approximated by K (t), where 
     
         K(t)≈τφ(t).                                (4.4) 
    
     Hence, denoting the mean of K(t) by  K , 
     
          K τT.                                                 (4.5) 
    
     To establish the correspondence between the fluid model and the periodic method in Section II, observe that K(t) here is analogous to K I  (see (2.1). Moreover, approximating ##EQU5## and making use of (4.1) and (4.4), yields 
     
         K(t+Δ)=(1-ΓΔ)K(t)-τAΔsgn[x(t-Γ/2)-x.sub.T ]. 
    
     On comparing with the recursion in (2.1), the following important correspondence between parameters of the fluid model and the adaptive algorithm is obtained: 
     
         ΓΔ≈γAτΔ≈α(4.7) 
    
     In particular, the important ratio, A/Γ≈α/(τγ). 
     C. Results for Different Regimes 
     The model of (4.1)-(4.2) shows that there are three regimes to consider: 
     
         Unsaturated Regime: A/Γ&lt;λ                     (4.8,i) 
    
     
         Critical Case: A/Γ=λ                          (4.8,ii) 
    
     
         Saturated Regime: A/Γ&gt;λ                       (4.8,iii) 
    
     The critical case will not receive much attention since it is handled by the analysis for one or the other regime. 
     Consider the Unsaturated Regime. For any nonnegative initial conditions (φ(0),x(0)) a first proposition holds that: ##EQU6## (ii) There exists T such that 
     
         x(t)=0(t≧T)                                         (4.10) 
    
     (iii) For all initial conditions and t&gt;T+τ/2, φ(t) approaches the steady state, equilibrium value of A/Γ at the exponential rate of Γ. 
     This can be demonstrated by noting: 
     (i) From (4.1), ##EQU7##  Hence, by considering dφ/dt when φ=A/Γ, (4.5) follows. (ii) Suppose that φ(t 0 )&gt;A/Γ. Then for t&gt;t 0 , ##EQU8##  Hence, there exists finite positive constants T, ε such that (A/Γ)≦λ-ε, and 
     
         φ(t)≦λ-ε(t≧T)             (4.11) 
    
      From (4.2), for t≧T+τ/2 ##EQU9##  Hence, (4.10) follows. (iii) For t≧T+τ/2, ##EQU10##  Hence, ##EQU11## 
     It follows that in the Unsaturated Regime, the total fluid in the network is (see (4.4)), 
     
         K(t)→τA/Γ.                                (4.13) 
    
     From (4.7), τA/Γ≈α/γ, where α, γ are parameters of the adaptive algorithms. Hence, it can be inferred that the mean window,  K , and the realized throughput, T, are ##EQU12## Observe that the queue threshold x T  in (4.1) does not have a role in determining the steady state values of x(t) and φ(t), and in the Critical Case, see (4.8,ii), it may be shown that 
     
         φ(t)→A/Γ(t→∞) 
    
     However, in contrast to the result for the Unsaturated Regime, there exist initial conditions for which the equilibrium buffer content is positive, but never in excess of x T . 
     Proceeding to the Saturated Regime, in contrast to the other cases, there does not exist an equilibrium point. That is, a solution satisfying ##EQU13## 
     By construction it can be shown that a unique periodic solution (limit cycle) exists in the Saturated Regime. This construction is related to a construction described in K. W. Fendick, M. A. Rodrigues and A. Weiss, &#34;Analysis of Rate-Based Feedback Control Strategy for Long Haul Data Transport,&#34; Performance Evaluation, vol. 16, pp. 67-84, 1992. The main differences being the absence of damping and the presence of additional nonlinearities there. FIG. 6 is a graph of the periodic solution in the Saturated Regime. Start by postulating a point t 0  such that for tε[t 0  -τ/2, t 0  ], ##EQU14## 
     
         x(t)=0 
    
     Note that the postulated φ(t) is a solution of the equations ##EQU15## It will be shown that at a later point, t 3 , 
     
         φ(t.sub.3 -s)=φ(t.sub.0 -s), and x(t.sub.3 -s)=x(t.sub.0 -s)(0≦s≦τ/2)                            (4.17) 
    
     This will establish the existence of a periodic solution to (4.1)-(4.2). There are three phases present in the limit cycle. In Phase 1, tε(t 0 , t 1 ); in Phase 2, tε(t 1 , t 2 ); in Phase 3, tε(t 2 , t 3 ), where t 1 , t 2  and t 3  are explicitly identified in the construction given below. 
     In Phase 1, 
     
         0&lt;x(t-τ/2)&lt;x.sub.T and λ&lt;φ(t-τ/2).      (4.18) 
    
     The governing equations are, ##EQU16## Hence, it is easily verified that in Phase 1, ##EQU17## The definition of the terminal time for this phase, t 1 , is 
     
         x(t.sub.1 -τ/2)=x.sub.T                                (4.21) 
    
     By solving (4.19), an explicit expression for t 1  is obtained. As shown in FIG. 6, x(t 1 ) overshoots x T . 
     Phase 2 terminates at t 2  where 
     
         x(t.sub.2 -τ/2)=x.sub.T                                (4.22) 
    
     and during Phase 2, 
     
         x.sub.T &lt;x(t-τ/2).                                     (4.23) 
    
     Hence, the governing equations for Phase 2 are ##EQU18## Note that dφ/dt&lt;0. Hence x(t) is concave and reaches a maximum value x at time denoted by t 2  *. Also, φ(t 2 )&lt;λ. 
     In Phase 3, 
     
         φ(t-τ/2)&lt;λ and x(t-τ/2)&lt;x.sub.T         (4.25) 
    
     The governing equations are ##EQU19## where t 3  * is the time when the buffer first empties. Note that dφ/dt&gt;0 and dx(t)/dt≦0. It is not hard to show that φ(t 3  *-τ/2)&lt;λ. Hence, there exists t 3  &gt;t 3  * such that φ(t 3  -τ/2)=λ, which is the defining relation for t 3 , the terminal time point of Phase 3 and the start of Phase 1. To see that the solution is periodic, i.e. (4.17) holds, it suffices to observe that the differential equations governing φ(t) in (4.16) and (4.26) are identical. 
     Note that the maximum value of φ(t), φ, is reached at t=t 1 , and the minimum value, φ, is reached at t=t 2 . 
     A limiting case of the Saturated Regime is where the damping, Γ=0 and A/Γ=∞. Note that even in this case the limit cycle exists and is bounded. As it happens, the construction is simpler with Γ=0 and the following explicit expressions are obtained for the extremal quantities, x, φ and φ: ##EQU20## 
     D. Fairness Among Virtual Circuits on a Common Path 
     This is a topic of obvious importance. The results here apply to all regimes. The extension of the model in (4.1)-(4.2) is, ##EQU21## In this section the restriction that all C VCs share a common path, i.e., τ j  ≡τ (j=1,2, . . . , C), is imposed. 
     Now suppose that the desired fractional throughput to the j th  VC is σ j  (j=1,2, . . . , C), where {σ j  } is any set of positive numbers which sum to unity. That is, it is desired that ##EQU22## Consider a second proposition: let the design rule be (j=1,2, . . . , C) 
     
         Γ.sub.j =ΓA.sub.j =σ.sub.j A             (4.33) 
    
     where (A, Γ) are system parameters. Then: 
     (i) For any two VCs, say the i th  and j th , the following measure of divergence, ##EQU23##  goes to 0 exponentially fast with rate Γ, regardless of initial condition and regime; i.e., ##EQU24## (ii) Define ##EQU25##  (It is already known from (i) that φ j  (t)→σ j  φ(t).) φ(t) is obtained as the solution of the model in (4.1)-(4.2) for a single VC. In particular, depending upon whether A/Γ is less than or greater than λ, the behavior of φ(t) is described by the results for the Unsaturated and Saturated Regimes above. 
     This may be proven by noting: (i) From (4.30) and (4.33), for any i and j, ##EQU26## Define ##EQU27## Then, ##EQU28## from which (4.34) follows. (ii) From (4.30), (4.31) and (4.33), ##EQU29##  These equations are identical to (4.1)-(4.2), the governing equations for a single VC. 
     E. Multiple Virtual Circuits, Multiple Paths 
     Here the restriction in the preceding section which required that all VCs have a common value of the delay is removed. The model here is (4.30)-(4.31) with {τ j  } arbitrary. Then consider a third proposition: let the desired fractional allocation of throughput to the j th  VC be σ j , as in the second proposition. Let the design rule be given by (4.33). (Note that this design rule is oblivious of the delays in the multiple paths.) Also suppose that the Unsaturated Regime holds, i.e., A/Γ&lt;λ. Then, using techniques similar to those above, it can be shown that: 
     (i) If 
     
         φ.sub.j (0)≦σ.sub.j (A/Γ) then φ.sub.j (t)≦σ.sub.j (A/Γ) (t≧0)         (4.40) 
    
     (ii) There exists T&lt;∞ such that x(t)=0 for t≧T. 
     (iii) For any initial condition and t&gt;T+τ j  /2, φ j  (t) approaches the equilibrium value of σ j  (A/Γ) exponentially fast with rate Γ. 
     The important feature of the result is that neither the design rule nor the equilibrium values of the flow rates and the buffer content depends on the delays {τ j  }. However, the translation of the above design rule (from the fluid model) to the adaptive algorithms introduces dependence on the delays. With large t the sum of all the flow rates, Σφ j  (t), approaches A/Γ which, in the Unsaturated Regime, is less than the switch capacity, λ. Hence, (λ-A/Γ) is unutilized capacity, and fairness among all VCs as above holds here. 
     There is not a precise mathematical result which parallels the remarks on fairness above when the system is in the Saturated Regime. The relation (4.36) does not hold since the feedback bit streams are different for VCs with different propagation delays. Nonetheless, their time-averages are virtually identical since the signal emanates from a common point, the buffer at the distinct switch. It has been observed that the fairness results of the second proposition hold consistently for the model with various propagation delays and with the network in the Saturated Regime. 
     F. Implications for Design of the Periodic Adaptation Algorithm 
     This section summarizes the design implications of the analysis, which has been based on fluid models. The focus is on two topics: first, the relative merits of operating in the Unsaturated and Saturated Regimes; second, the translation of the design rules to the periodic adaptation algorithm, where the objects are fairness and specific fractional bandwidth allocations, possibly in the presence of various delays. 
     FIGS. 7A and B illustrate some of the characteristics of the fluid model behavior. In the Unsaturated Regime the main features are oscillation-free approach to equilibrium, linear growth of throughput with increasing (α/γ), empty buffers in equilibrium, unutilized switch capacity of λ-α/γ. In the Saturated Regime the unutilized capacity is zero, there is no equilibrium point, instead limit cycles exist and the throughput and queue fluctuate around λ and the threshold, respectively. These fluctuations are bounded and, moreover, the algorithm is surprisingly robust, i.e., the penalty for saturation is surprisingly small. More precisely, the growth of (φ-λ) and (x-x T ), where φ and x denote maximum values of the flow rate and queue, with ##EQU30## is surprisingly slow. This gives rise to the following conclusion: it is not necessary to operate the network in an overly cautious mode. 
     All this is demonstrated in FIG. 8 where λ=264. In FIG. 8A A/Γ=125 and the network is unsaturated. In contrast, the network is saturated in FIG. 8B and FIG. 8C. Even when A/Γ is almost twice as large as λ, the oscillation and queue are not excessive. 
     To obtain the design rules for the adaptation algorithm start with (4.33). Following (4.7) let γ j  =Γ j  Δ and α j  =A j  τ j  Δ. On denoting (ΓΔ) by γ and (AΔ) by α, obtain ##EQU31## In this design rule the parameters {α j ,γ j  }, of which there are 2 C, are obtained from just (α,γ). The manner in which the two parameters affect system behavior may be inferred from their effects on a network with a single VC. In particular, in the simulations of a single VC the regime is Unsaturated or Saturated depending upon whether α/γ is less than or greater than τλ. 
     The above detailed description has illustrated several methods for adaptive control of windows and rates in data networks. buffer. The methods have not been limited to specific hardware or software. Instead, the methods have been described in such a manner that those skilled in the art can readily adapt such hardware or software as may be available or preferable. The methods described have other network applications. For example, the feedback-based methods for fairly allocating bandwidth in a timely manner can be advantageously integrated with an access regulator, which interfaces with the user at the network edge. A simple, effective access regulator is the &#34;Leaky Bucket&#34; device, which polices and smooths traffic. An illustrative techniques for such integration makes the token rate in the Leaky Bucket regulator grow and subside like the rate for the VC, which is determined by feedback methods, possibly in conjunction with similar adjustments for the token buffer.