On the asymptotic behavior of heterogeneous statistical multiplexer with applications
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Evaluating derivatives: principles and techniques of algorithmic differentiation
Evaluating derivatives: principles and techniques of algorithmic differentiation
Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
PMCCN '97 Proceedings of the IFIP TC6 / WG6.3 & WG7.3 International Conference on the Performance and Management of Complex Communication Networks
A source independent traffic model for ATM networks
PMCCN '97 Proceedings of the IFIP TC6 / WG6.3 & WG7.3 International Conference on the Performance and Management of Complex Communication Networks
On the Effective Bandwidth of Arbitrary on/off Sources
Proceedings of the Sixth IFIP WG6.3 Conference on Performance of Computer Networks: Data Communications and their Performance
Performance modelling of computer networks
LANC '03 Proceedings of the 2003 IFIP/ACM Latin America conference on Towards a Latin American agenda for network research
| Hi-index | 0.00 |
In this paper, a flexible discrete-time arrival process is introduced and its correlation properties are analyzed. The arrival process is the so-called batch-on/off model, an extension of the original on/off source used in the context of ATM networks. In the batch-on/off model, a group of arrivals may be generated at any given active slot. General distributions are assumed for the three input random variables characterizing the process: busy and idle periods, and batch size. The analysis focuses on two related processes: the process of counts and the sequence of interarrival times. For each process, an exact closed-form expression of its complete autocorrelation function is obtained. Explicit algorithms are provided to compute both autocorrelation functions, which are numerically evaluated for different distributions of the busy and idle periods and the batch size. The results provided in this paper reveal the analytical tractability of these models which, in addition to their flexibility, makes them very suitable for the performance evaluation of discrete-time communication systems and for general research in the area of queuing theory.