Insensitive Bandwidth Sharing in Data Networks
Queueing Systems: Theory and Applications
Trunk reservation in multi-service networks with BPP traffic
Proceedings of the Third international EURO-NGI network of excellence conference on Wireless systems and mobility in next generation internet
Modelling restricted accessibility for wireless multi-service systems
EURO-NGI'05 Proceedings of the Second international conference on Wireless Systems and Network Architectures in Next Generation Internet
Optimal robust policies for bandwidth allocation and admission control in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Teletraffic Performance Analysis of Multi-class OFDM-TDMA Systems with AMC
Wireless Systems and Mobility in Next Generation Internet
Evaluation of multi-service CDMA networks with soft blocking
ruSMART/NEW2AN'10 Proceedings of the Third conference on Smart Spaces and next generation wired, and 10th international conference on Wireless networking
Hi-index | 0.00 |
This paper presents a unified model of classical teletraffic models covering both circuit-switched and packet-switched networks. The models of Erlang, Engset, Palm, and Delbrouck are generalized to loss and delay systems with multi-rate BPP (Binomial, Poisson, Pascal) traffic streams which all are insensitive to the holding time distributions. The Engset and Pascal traffic streams are also insensitive to the idle time distribution. Engset traffic corresponds to a finite number of users and Pascal traffic results in same state probabilities as Pareto-distributed inter-arrival times. The model is similar to balanced fair scheduling by Bonald and Proutière, but the approach is much simpler and allows for explicit results for finite source traffic and performance measures of each individual service. The model is evaluated by a simple stable algorithm with a minimal memory requirement and a time requirement which is linear in number of streams and number of servers plus queueing positions.