Rate Envelope Multiplexing and Rate Sharing in B-ISDN

概要

論文の詳細を見る
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.
社団法人電子情報通信学会の論文
1995-04-25