Rate controlled servers for very high-speed networks

Future high-speed networks are expected to carry traffic with a wide range of performance requirements. Two queue service disciplines, rate-based scheduling and hierarchical round robin scheduling, are described. These disciplines allow some connections to receive guaranteed rate and jitter performance, while others receive best-effort service. Rate based scheduling is designed for fast packet networks, while hierarchical round robin is an extension of round robin scheduling suitable for use in networks based on the asynchronous transfer mode (ATM) being defined in CCITT. Both schemes are feasible at rates of 1 Gb/s. The schemes allow strict bounds on the buffer space required for rate controlled connections and can provide efficient utilization of transmission bandwidth