Analysis of multiserver queueing system with opportunistic occupation and reservation of servers
type: Item
instance of: scholarly article
title: Analysis of multiserver queueing system with opportunistic occupation and reservation of servers
zbMATH Open document ID: 1407.90120
DOI: 10.1155/2014/178108
author: Erdal Karapınar
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: We consider a multiserver queueing system with two input flows. Type-1 customers have preemptive priority and are lost during arrival only if all servers are occupied by type-1 customers. If all servers are occupied, but some provide service to type-2 customers, service of type-2 customer is terminated and type-1 customer occupies the server. If the number of busy servers is less than the threshold \(M\) during type-2 customer arrival epoch, this customer is accepted. Otherwise, it is lost or becomes a retrial customer. It will retry to obtain service. Type-2 customer whose service is terminated is lost or moves to the pool of retrial customers. The service time is exponentially distributed with the rate dependent on the customer's type. Such queueing system is suitable for modeling cognitive radio. Type-1 customers are interpreted as requests generated by primary users. Type-2 customers are generated by secondary or cognitive users. The problem of optimal choice of the threshold \(M\) is the subject of this paper. Behavior of the system is described by the multidimensional Markov chain. Its generator, ergodicity condition, and stationary distribution are given. The system performance measures are obtained. The numerical results show the effectiveness of considered admission control.
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 7015845
Wikidata QID: Q59063495
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/178108
OpenAlex ID: W2010725253
cites work: NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
cites work: New results on the single server queue with a batch markovian arrival process
cites work: A bibliographical guide to the analysis of retrial queues through matrix analytic techniques
cites work: Q3961697
cites work: Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory
cites work: Lack of invariant property of the Erlang loss model in case of MAP input
cites work: Queueing system \(MAP|PH|N|N+R\) with impatient heterogeneous customers as a model of call center
cites work: The \(MAP/M/N\) retrial queueing system with time-phased batch arrivals
description: scientific article; zbMATH DE number 7015845