18 August 1999 Refined normal approximations for a simple multiclass closed queueing network and its applications to admission control
Author Affiliations +
Abstract
A particular closed queuing network consisting of two processor sharing servers and two types of customers with fixed routes, which are generated by two finite sources, is studied. A complete bottleneck classification is provided as the number of customers and service rates at processor sharing servers increase. Asymptotic approximations for the marginal distributions at the two processor-sharing nodes are derived, when both nodes are bottlenecks. These approximations imply the normal approximation whose mean and variance are explicitly expressed through network parameters. The results are applied to the problem of admission control in packet-switching communication networks.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yaakov Kogan, Yaakov Kogan, } "Refined normal approximations for a simple multiclass closed queueing network and its applications to admission control", Proc. SPIE 3841, Performance and Control of Network Systems III, (18 August 1999); doi: 10.1117/12.360383; https://doi.org/10.1117/12.360383
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT

Virtual networks on demand
Proceedings of SPIE (September 15 1998)
Tag-switching architecture: overview
Proceedings of SPIE (October 05 1997)
Introduction to multiprotocol over ATM (MPOA)
Proceedings of SPIE (October 05 1997)
Performance evaluation of TCP over ABT protocols
Proceedings of SPIE (October 06 1998)

Back to Top