Rate Envelope Multiplexing and Rate Sharing in B-ISDN
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E78-B No.4 pp.431-438
- Publication Date
- 1995/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section INVITED PAPER (Special Issue on Traffic and Quality Control for Communication Networks)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
James W. ROBERTS, "Rate Envelope Multiplexing and Rate Sharing in B-ISDN" in IEICE TRANSACTIONS on Communications,
vol. E78-B, no. 4, pp. 431-438, April 1995, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e78-b_4_431/_p
Copy
@ARTICLE{e78-b_4_431,
author={James W. ROBERTS, },
journal={IEICE TRANSACTIONS on Communications},
title={Rate Envelope Multiplexing and Rate Sharing in B-ISDN},
year={1995},
volume={E78-B},
number={4},
pages={431-438},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Rate Envelope Multiplexing and Rate Sharing in B-ISDN
T2 - IEICE TRANSACTIONS on Communications
SP - 431
EP - 438
AU - James W. ROBERTS
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E78-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 1995
AB - 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.
ER -
English
