Trunk reservation in multi-service networks with BPP traffic

Authors:
Zheng He;Qi Zhang;Villy Bæk Iversen
Affiliations:
COM, DTU, Technical University of Denmark, Lyngby, Denmark;COM, DTU, Technical University of Denmark, Lyngby, Denmark;COM, DTU, Technical University of Denmark, Lyngby, Denmark
Venue:
Proceedings of the Third international EURO-NGI network of excellence conference on Wireless systems and mobility in next generation internet
Year:
2006

Citing 4
Cited 2

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
Admission control policies in multiservice cellular networks: optimum configuration and sensitivity

NGI'04 Proceedings of the First international 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
Performance analysis of fractional guard channel policies in mobile cellular networks

IEEE Transactions on Wireless Communications

Reversible fair scheduling: the teletraffic theory revisited

ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
A new convolution algorithm for loss probability analysis in multiservice networks

Performance Evaluation

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we develop approximate models for trunk reservation in multi-service systems with BPP (Binomial-Poisson-Pascal) multi-rate traffic streams. The approximation is a generalization of previous work by Tran-Gia & Hübner who assumed Poisson arrival processes. It is based on a generalized algorithm which allows for calculation of individual performance measures for each service, in particular the traffic congestion. The algorithm is numerically robust and requires a minimum of computer memory and computing time. The approximation is good when the services have equal mean service times.