Trunk reservation in multi-service networks with BPP traffic

TY - CHAP

T1 - Trunk reservation in multi-service networks with BPP traffic

AU - He, Z.

AU - Zhang, Qi

AU - Iversen, V.B.

PY - 2007/1/1

Y1 - 2007/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38149013020&partnerID=8YFLogxK

M3 - Book chapter

AN - SCOPUS:38149013020

SN - 9783540709688

VL - 4396 LNCS

SP - 200

EP - 212

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -