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 performa...

Full description

Saved in:
Bibliographic Details
Published in[Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition pp. 12 - 20 vol.1
Main Authors Kalmanek, C.R., Kanakia, H., Keshav, S.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1990
Subjects
Asynchronous transfer mode
Bandwidth
Communication system traffic control
Delay
High-speed networks
Jitter
Network servers
Round robin
Telecommunication traffic
Traffic control
Online AccessGet full text

Cover

More Information
Summary: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.< >
ISBN:9780879426323
0879426322
DOI:10.1109/GLOCOM.1990.116472