Rate Controlled Servers for Very High-Speed Networks



                  C. R. Kalmanek and H. Kanakia
                     AT&T Bell Laboratories
                      Murray Hill, NJ 07974
                               and
                            S. Keshav
               University of California, Berkeley
                       Berkeley, CA 94720

                            ABSTRACT

Future high-speed networks are expected to carry traffic  with  a
wide  range  of  performance  requirements. We describe two queue
service disciplines, rate-based scheduling and hierarchical round
robin   scheduling,   that  allow  some  connections  to  receive
guaranteed rate and jitter performance, while others receive best
effort service.  Rate-based scheduling is designed for fast pack-
et newtorks, while hierarchical round robin is  an  extension  of
round robin scheduling for use in networks based on the Asynchro-
nous Transer Mode (ATM) being defined in CCITT.  Both schemes are
feasible  at  rates of one Gigabit/sec.  The schemes allow strict
bounds on the buffer space required for rate  controlled  connec-
tions  and  can  provide  efficient  utilization  of transmission
bandwidth.