Markov-modulated rate processes for modeling, analysis and control of communication networks
Markov-modulated rate processes for modeling, analysis and control of communication networks
Statistical multiplexing of VBR sources: a matrix-analytic approach
Performance Evaluation - Special issue on performance modeling of high speed telecommunication systems
Effective bandwidth and fast simulation of ATM intree networks
Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
Improved loss calculations at an ATM multiplexer
IEEE/ACM Transactions on Networking (TON)
On the Convergence of Global Rational Approximants forStochastic Discrete Event Systems
Discrete Event Dynamic Systems
Fast simulation of a voice-data multiplexer
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
Global rational approximation for computer systems and communication networks
Global rational approximation for computer systems and communication networks
Trends in highly scalable crossbar-based packet switch architecture
Computer Communications
Efficient solution of multiple server queues with application to the modeling of ATM concentrators
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Computing packet loss probabilities in multiplexer models using rational approximation
IEEE Transactions on Computers
Modeling computer virus with the BSDE approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Statistical multiplexers have been integral components of packet switches and routers on data networks. They are modeled as queueing systems with a finite buffer space, served by one or more transmission links of fixed or varying capacity. The service structure typically admits packets of multiple sources on a first-come first-serve (FCFS) basis. In this paper, we adhere to D-BMAP/PH/1/N queues with discrete phase-type group service channel which allows the packets to get service in the service channel for a random number of time slots by staying in different phases of the service channel before they leave the switch. The aim is to determine the packet loss probability (PLP) as a function of the capacity of the buffer. Due to the curse of dimensionality of the mathematical model, the numerical computation of the performance measures using the analytical formulas is time and memory consuming. Due to rare events, getting the performance measures by simulation is again time consuming. To overcome this problem, we use the Newton-Pade-type rational approximation technique to compute the PLP more efficiently. Since this technique needs the asymptotic behavior of the PLP, we show a way to regroup the elements of the TPM to obtain the asymptotic behavior of the PLP.