A new convolution algorithm for loss probability analysis in multiservice networks

Authors:
Qian Huang;King-Tim Ko;Villy Bæk Iversen
Affiliations:
Department of Electrical & Electronic Engineering, The University of Melbourne, Victoria 3010, Australia;Department of Electronic Engineering, City University of Hong Kong, Hong Kong;Department of Photonics Engineering, Technical University of Denmark, DK 2800 Kongens, Lyngby, Denmark
Venue:
Performance Evaluation
Year:
2011

Citing 6
Cited 0

Traffic overflow in loss systems with selective trunk reservation

Performance Evaluation
Approximation for overflow moments of a multiservice link with trunk reservation

Performance Evaluation
An Analysis of Trunk Reservation and Grade of Service Balancing Mechanisms in Multiservice Broadband Networks

Proceedings of the IFIP TC6 Task Group/WG6.4 International Workshop on Performance of Communication Systems: Modelling and Performance Evaluation of ATM Technology
Performance modeling for heterogeneous wireless networks with multiservice overflow traffic

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
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
A dynamic multiple-threshold bandwidth reservation (DMTBR) scheme for QoS provisioning in multimedia wireless networks

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Performance analysis in multiservice loss systems generally focuses on accurate and efficient calculation methods for traffic loss probability. Convolution algorithm is one of the existing efficient numerical methods. Exact loss probabilities are obtainable from the convolution algorithm in systems where the bandwidth is fully shared by all traffic classes; but not available for systems with trunk reservation, i.e. part of the bandwidth is reserved for a special class of traffic. A proposal known as asymmetric convolution algorithm (ACA) has been made to overcome the deficiency of the convolution algorithm. It obtains an approximation of the channel occupancy distribution in multiservice systems with trunk reservation. However, the ACA approximation is only accurate with two traffic flows; increased approximation errors are observed for systems with three or more traffic flows. In this paper, we present a new Permutational Convolution Algorithm (PCA) for loss probability approximation in multiservice systems with trunk reservation. This method extends the application of the convolution algorithm and overcomes the problems of approximation accuracy in systems with a large number of traffic flows. It is verified that the loss probabilities obtained by PCA are very close to the exact solutions obtained by Markov chain models, and the accuracy outperforms the ACA approximation.