Call-Level Performance Modelling of Elastic and Adaptive Service-Classes with Finite Population


IEICE TRANSACTIONS on Communications   Vol.E91-B   No.1   pp.151-163
Publication Date: 2008/01/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e91-b.1.151
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Fundamental Theories for Communications
markov processes,  finite model,  elastic traffic,  blocking probability,  recurrent formula,  

Full Text: PDF>>
Buy this Article

The call-level performance modelling is a challenge in the highly heterogeneous environment of modern telecom networks, due to the presence of elastic traffic. In this paper, we review existing teletraffic loss models and propose a model for elastic traffic of service-classes with finite population (quasi-random call arrival process). Upon arrival, calls have contingency alternative bandwidth requirements that depend on thresholds which indicate the available/occupied link bandwidth (state dependent model). Calls are admitted under the complete sharing policy, and can tolerate bandwidth compression, while in-service. We prove a recurrent formula for the efficient calculation of the link occupancy distribution and consequently the call blocking probabilities and link utilization. The accuracy of the proposed model is verified by simulation and is found to be quite satisfactory. Comparative results with other existing models show the necessity and the effectiveness of the proposed model. Its potential applications are mainly in the environment of wireless networks.