Home // AICT 2012, The Eighth Advanced International Conference on Telecommunications // View article

Call Blocking Probabilities of Elastic and Adaptive Traffic with Retrials

Authors:
Ioannis Moscholios
Vassilios Vassilakis
John Vardakas
Michael Logothetis

Keywords: Poisson process; elastic/adaptive traffic; call blocking; Markov chains; recurrent formula

Abstract:
We study a single-link multirate loss system, which accommodates both elastic and adaptive traffic of Poisson arriving calls, with exponentially distributed service time and flexible bandwidth requirements. If the available link bandwidth is not enough to accept a new call with its peak-bandwidth requirement, then the call can retry one or more times (single/multi-retry loss models) to be connected in the system with reduced bandwidth. If its last bandwidth requirement remains higher than the available link bandwidth, the call can still be accepted in the system, by compressing the bandwidth of all in-service calls together with its last bandwidth requirement. The proposed models do not have a product form solution, and therefore we propose approximate recursive formulas for the efficient calculation of call blocking probabilities. The consistency and the accuracy of our models are verified by simulation, and found to be very satisfactory.

Pages: 92 to 97

Copyright: Copyright (c) IARIA, 2012

Publication date: May 27, 2012

Published in: conference

ISSN: 2308-4030

ISBN: 978-1-61208-199-1

Location: Stuttgart, Germany

Dates: from May 27, 2012 to June 1, 2012