Design and Analysis of a Flow Control Algorithm
            for a Network of Rate Allocating Servers


                        Srinivasan Keshav
          Computer Science Division, Department of EECS
               University of California, Berkeley
                       Berkeley, CA 94720

                        Ashok K. Agrawala
                 Department of Computer Science
         University of Maryland, College Park, MD 20742

                               and

                           Samar Singh
         Department of Computer Science and Engineering
                 Indian Institude of Technology
                    New Delhi - 110016, INDIA
                            ABSTRACT

Packet-switched networks where the router  queue-service  discip-
line  is  based on round-robin can be modeled as networks of rate
allocating servers [2,3,13]. We model a virtual circuit  in  such
networks  as  a  sequence of D/D/1 queues, prove some interesting
properties, and use this simple model to derive a new  flow  con-
trol  scheme we call 2P. 2P uses a novel technique based on short
packet bursts to estimate the service rate of the circuit and  to
adapt  the sending rate as the network state changes. We describe
an implementation of 2P and analyze its response to network tran-
sients.   Simulations  of  the  scheme  compare it with some well
known flow control schemes and show  that  it  performs  well  in
deterministic scenarios.