Rate Envelope Multiplexing and Rate Sharing in B-ISDN

James W. ROBERTS  

IEICE TRANSACTIONS on Communications   Vol.E78-B   No.4   pp.431-438
Publication Date: 1995/04/25
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: INVITED PAPER (Special Issue on Traffic and Quality Control for Communication Networks)
communications networks and services,  weighted fair queueing,  traffic control,  service,  integration,  

Full Text: PDF>>
Buy this Article

This paper discusses two approaches to statistical multiplexing: rate envelope multiplexing, allowing resource sharing with small delays for low peak rate connections, and rate sharing, based on the use of large multiplexer buffers to ensure high link utilization for high speed data traffic. We argue that the weighted fair queueing scheduling algorithm provides an efficient means for combining both kinds of multiplexing in the B-ISDN. A feasible implementation known as Virtual Spacing is outlined. We illustrate the flexibility of the proposed scheme by showing how different service categories could be provided.