Performance analysis of statistical multiplexing of VBR sources
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
A discrete time queueing model to study the cell delay variation in an ATM network
Performance Evaluation - Special issue: discrete-time models and analysis methods
Spectral decomposition approach for transient analysis of multi-server discrete-time queues
Performance Evaluation - Special issue: discrete-time models and analysis methods
An analytical paradigm to compare routing strategies in an ATM multimedia environment
IEEE/ACM Transactions on Networking (TON)
A discrete-time paradigm to evaluate skew performance in a multimedia ATM multiplexer
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno with RED-based routers
ACM SIGMETRICS Performance Evaluation Review
Performance evaluation of an adaptive-rate MPEG encoder matching intserv traffic constraints
IEEE/ACM Transactions on Networking (TON)
QoS-IP '01 Proceedings of the International Workshop on Quality of Service in Multiservice IP Networks
Queueing Systems: Theory and Applications
Robustness of Q-ary collision resolution algorithms in random access systems
Performance Evaluation
Performance Evaluation - Special issue: Distributed systems performance
Computing packet loss probabilities of D-BMAP/PH/1/N queues with group services
Performance Evaluation
| Hi-index | 0.00 |
This paper introduces a method for obtaining the steady state probabilities in G[X]/D/C/K type queues. The solution method is more efficient than other known techniques in terms of both time and space requirements. The method is an extension of the MBH technique used to solve single server queues. It is shown that this method allows one to perform a parametric study quickly and efficiently by building on already existing results. The solution technique is used to evaluate the performance of concentrators used in ATM networks where low speed lines are connected to higher speed ones, e. g., 150 Mb/s lines to a 620 Mb/s or 1.2 Gb/s line. The concentrator is equipped with a finite capacity buffer, and is modeled as a synchronous multiple server queue with finite buffer. The concentrator is fed by a discrete batch Markov arrival process (D-BMAP) which is capable of capturing the traffic characteristics of a broad range of applications. The paper derives the probability of cell loss introduced by the concentrator buffering, and considers the effect of the buffer size as well as the line speeds on this measure.