Analysis of polling systems
Some properties of polling systems
Queueing Systems: Theory and Applications
Effective bandwidths for the multi-type UAS channel
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
Upper and lower bounds for the multiplexing of multiclass Markovian on/off sources
Performance Evaluation
Exponential bounds with applications to call admission
Journal of the ACM (JACM)
ATM Network Performance
Admission control of multi-class traffic with service priorities in high-speed networks
Queueing Systems: Theory and Applications
Computable exponential bounds for intree networks with routing
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
First Passage Times in Fluid Models with an Application to Two Priority Fluid Systems
IPDS '96 Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96)
BOUNDS FOR FLUID MODELS DRIVEN BY SEMI-MARKOV INPUTS
Probability in the Engineering and Informational Sciences
IEEE Journal on Selected Areas in Communications
Stochastic fluid flow models for determining optimal switching thresholds
Performance Evaluation
Hi-index | 0.00 |
In this paper, we consider the stochastic fluid-flow model of a single node in a high-speed telecommunication network handling multi-class traffic. The node has multiple buffers, one for each class of traffic. The contents of these buffers are multiplexed onto a single output channel using one of the service scheduling policies: the Timed Round Robin Policy or the Static Priority Service Policy. The Quality of Service requirements for each class are based on cell loss probabilities. Using effective bandwidth methodologies and the recently developed bounds for semi-Markov modulated traffic, we solve call admission control problems for the two service scheduling policies at this node. We compare the performance of the effective bandwidth methodologies and the SMP bounds technique. We also numerically compare the performance of the two service scheduling policies.