Call-burst blocking of ON-OFF traffic sources with retrials under the complete sharing policy

Authors:
Ioannis D. Moscholios;Michael D. Logothetis;George K. Kokkinakis
Affiliations:
Wire Communications Laboratory, Department of Electrical and Computer Engineering, University of Patras, 26500 Patras, Greece;Wire Communications Laboratory, Department of Electrical and Computer Engineering, University of Patras, 26500 Patras, Greece;Wire Communications Laboratory, Department of Electrical and Computer Engineering, University of Patras, 26500 Patras, Greece
Venue:
Performance Evaluation
Year:
2005

Citing 13
Cited 3

Congestion probabilities in a circuit-switched integrated services network

Performance Evaluation
Blocking in a completely shared resource environment with state dependent resource and residency requirements

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Blocking with retrials in a completely shared resource environment

Performance Evaluation
Blocking probabilities in a loss system with arrivals in geometrically distributed batches and heterogeneous service requirements

IEEE/ACM Transactions on Networking (TON)
Blocking in a shared resource environment with batched Poisson arrival processes

Performance Evaluation
Blocking probabilities for multiple class batched Poisson arrivals to a shared resource

Performance Evaluation
Call-burst blocking and call admission control in a broadband network with bursty sources

Performance Evaluation
Multiservice Loss Models for Broadband Telecommunication Networks

Multiservice Loss Models for Broadband Telecommunication Networks
Connection-dependent threshold model: a generalization of the Erlang multiple rate loss model

Performance Evaluation
Performance analysis for hierarchical multirate loss networks

IEEE/ACM Transactions on Networking (TON)
Traffic management techniques to face the effects of intrinsic delays in geostationary satellite networks

IEEE Transactions on Wireless Communications
Equivalent capacity and its application to bandwidth allocation in high-speed networks

IEEE Journal on Selected Areas in Communications
Resource allocation for broadband networks

IEEE Journal on Selected Areas in Communications

Modeling product-form state-dependent systems with BPP traffic

Performance Evaluation
The Erlang multirate loss model with Batched Poisson arrival processes under the bandwidth reservation policy

Computer Communications
FPGEN: A fast, scalable and programmable traffic generator for the performance evaluation of high-speed computer networks

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we calculate both call and burst blocking probabilities of ON-OFF traffic sources with retrials. Calls of service-classes arrive to a single link according to a Poisson process and compete for the available link bandwidth under the complete sharing policy. Blocked calls may immediately retry one or more times to enter the system, with reduced bandwidth and increased mean service time requirements. Call blocking occurs when a call cannot enter the system with its last bandwidth requirement, due to lack of bandwidth. Accepted calls enter the system via state ON and may alternate between states ON and OFF, or remain always in state ON. When a call is transferred to state OFF it releases the bandwidth held in state ON, so that this bandwidth becomes available to new arriving calls. When a call tries to return to state ON, it re-requests its bandwidth. If it is available a new ON-period (burst) begins. Otherwise burst blocking occurs and the call remains in state OFF. The proposed ON-OFF retry models do not have a product form solution and therefore the calculation of call and burst blocking probability is based on approximate formulas. The formulas we propose for the call blocking probabilities are recursive, whereas for the burst blocking probabilities are robust. Simulation results validate our analytical methodology. For further evaluation, the results of the ON-OFF retry models are compared with those of the ON-OFF model without retrials. We also discuss the extension of the proposed formulas in the case of a fixed-routing network.