Research: Buffer dimensioning for delay- and loss-sensitive traffic

Authors:
Kimon P Kontovassilis;John T Tsiligaridis;George I Stassinopoulos
Affiliations:
Department of Electrical and Computer Engineering, Division of Computer Science, National Technical University of Athens, 9 Iroon Polytechneiou str, 15773 Zographou, Athens, Greece;Department of Electrical and Computer Engineering, Division of Computer Science, National Technical University of Athens, 9 Iroon Polytechneiou str, 15773 Zographou, Athens, Greece;Department of Electrical and Computer Engineering, Division of Computer Science, National Technical University of Athens, 9 Iroon Polytechneiou str, 15773 Zographou, Athens, Greece
Venue:
Computer Communications
Year:
1995

Citing 2
Cited 1

Fluid models for the analysis and design of statistical multiplexing with loss priorities on multiple classes of bursty traffic

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
Effective Bandwidths with Different Quality of Service Requirements

Proceedings of the IFIP TC6/ICCC International Conference on Integrated Broadband Communication Networks and Services

Weighted fair blocking mechanisms for discrete-time multiplexing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3

Quantified Score

Hi-index	0.24

Visualization

Abstract

Multiplexing of delay- and loss-sensitive traffic requires a common analytical framework for buffer dimensioning, buffer sharing schemes, as well as buffer entry and exit priorities. This paper performs a relevant study by employing discrete-time queueing techniques, appropriate for the small buffer sizes envisaged in ATM technology. The model, solution method and relevant metrics are presented. The numerical results are critically reviewed. These give rise to a buffer dimensioning algorithm. Loss requirements are primarily satisfied. However, an acceptable upper bound for the delay of the delay-sensitive traffic can also be accommodated.