Folding algorithm: a computational method for finite QBD processes with level-dependent transitions
- 1 February 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 42 (2/3/4) , 625-639
- https://doi.org/10.1109/tcomm.1994.577090
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Performance analysis of a statistical multiplexer with control on input and/or service processesPerformance Evaluation, 1992
- Analysis and design of rate-based congestion control of high speed networks, I: stochastic fluid models, access regulationQueueing Systems, 1991
- Equilibrium distribution of block-structured Markov chains with repeating rowsJournal of Applied Probability, 1990
- Traffic characterization for integrated services networksIEEE Transactions on Communications, 1990
- State space expansions and the limiting behavior of quasi-birth-and-death processesAdvances in Applied Probability, 1989
- Performance models of statistical multiplexing in packet video communicationsIEEE Transactions on Communications, 1988
- A Matrix Representation of CSMA/CD NetworksIEEE Transactions on Communications, 1985
- Birth-and-death processes on the integers with phases and general boundariesJournal of Applied Probability, 1982
- Delay Related Issues in Integrated Voice and Data NetworksIEEE Transactions on Communications, 1981
- Computation of the stationary distribution of a markov chainJournal of Statistical Computation and Simulation, 1975