A measurement-based loss scheduling scheme

Authors:
Tao Yang;Jie Pan
Affiliations:
Department of Industrial Engineering, Technical University of Nova Scotia, Halifax, NS, Canada;Department of Industrial Engineering, Technical University of Nova Scotia, Halifax, NS, Canada
Venue:
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
Year:
1996

Citing 6
Cited 1

Effective bandwidths for the multi-type UAS channel

Queueing Systems: Theory and Applications
Effective bandwidth of general Markovian traffic sources and admission control of high speed networks

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Effective bandwidths for multiclass Markov fluids and other ATM sources

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Statistical analysis of generalized processor sharing scheduling discipline

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications

Admission control for VoIP calls with heterogeneous codecs

WOCC'09 Proceedings of the 18th international conference on Wireless and Optical Communications Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a measurement-based loss scheduling scheme, termed the QoS-scheme, for highspeed packet networks. We show that the QoS-scheme is optimal in terms of bandwidth utilization among all stationary, space conserving loss scheduling schemes, and that it is also optimal among all stationary loss schemes when all traffic streams are equally demanding. We examine the properties of the QoS-scheme and how these properties may be used to compute the minimum bandwidth required for a given traffic scenario. We also discuss implications of these properties and compare the QoS-scheme with other loss scheduling schemes such as the last-in-first-out, partial buffer sharing, and pushout scheme through simulation studies.