Traffic processes in queueing networks: a Markov renewal approach
Traffic processes in queueing networks: a Markov renewal approach
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
A cost-effective approximation for SRD traffic in arbitrary multi-buffered networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special Issue: performance modeling and evaluation of ATM networks
The BMAP/G/1 QUEUE: A Tutorial
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Approximate Analysis of Discrete-Time Networks with or without Blocking
Proceedings of the IFIP TC6 Task Force/WG6.4 Fifth International Conference on Data Communication Systems and their Performance: High Speed Networks and Their Performance
Closed Form Performance Distributions of a Discrete Time GIg/D/1/N Queue with Correlated Traffic
Proceedings of the Sixth IFIP WG6.3 Conference on Performance of Computer Networks: Data Communications and their Performance
Communication delay in hypercubic networks with LRD traffic
Proceedings of the 2004 ACM symposium on Applied computing
Local area networks and self-similar traffic
Network performance engineering
Hi-index | 0.00 |
The batch renewal process is the least-biased choice of process given only the measures of count correlation and interval correlation at all lags.This paper reviews the batch renewal process, both for LRD (long-range-dependent) traffic and for SRD (short-range-dependent) traffic in the discrete space-discrete time domain, and in the wider context of general traffic in that domain. It shows some applications of the batch renewal process in simple queues and in queueing network models. The paper concludes with open research problems and issues arising from the discussion.