Trunk reservation in multi-service networks with BPP traffic

Z. He, Qi Zhang, V.B. Iversen

Research output: Contribution to book/anthology/report/proceedingBook chapterResearchpeer-review

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.
Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number of pages13
Volume4396 LNCS
Publication date1 Jan 2007
Pages200-212
ISBN (Print)9783540709688
Publication statusPublished - 1 Jan 2007
Externally publishedYes

Fingerprint

Dive into the research topics of 'Trunk reservation in multi-service networks with BPP traffic'. Together they form a unique fingerprint.

Cite this