There are abundant research results related to cognitive radio systems (CR systems), but using queueing models to portray CR systems is a new research trend. In this paper, a single-server retrial cognitive radio syst...There are abundant research results related to cognitive radio systems (CR systems), but using queueing models to portray CR systems is a new research trend. In this paper, a single-server retrial cognitive radio system with a linear retrial rate has been considered. The system has two types of users: primary users and secondary users. Secondary users have no effect on primary users because primary users have preemptive precedence. As a result, our purpose is to examine some performance indicators such as the expected queue length for primary users, the probability of the system being idle or occupied by a secondary user, and the probability of the system being busy. This paper begins by deriving the expressions for the generating functions based on the balance equations, so that we can calculate our goal conveniently.展开更多
This article examines the effects of reneging, server breakdown and server vacation on the various states of the batch arrivals queueing system with single server providing service to customers in three fluctuating mo...This article examines the effects of reneging, server breakdown and server vacation on the various states of the batch arrivals queueing system with single server providing service to customers in three fluctuating modes. In this queueing system, any batch arrival joins the queue if the server is busy or on vacation or under repair. However, if the server is free, one customer from the arriving batch joins the service immediately while others join the queue. In case of server breakdown, the customer whose service is interrupted returns back to the head of the queue. As soon as the server has is repaired, the server attends to the customer in mode 1. For this queueing system, customers that are impatient due to breakdown and server vacation may renege (leave the queue without getting service). Due to fluctuating modes of service delivery, the system may provide service with complete or reduced efficiency. Consequently, we construct the mathematical model and derive the probability generating functions of the steady state probabilities of several states of the system including the steady state queue size distribution. Further, we discuss some particular cases of the proposed queueing model. We present numerical examples in order to demonstrate the effects of server vacation and reneging on the various states of the system. The study revealed that an increase in reneging and a decrease in server vacation results in a decrease in server utilization and an increase in server’s idle time provided rates of server breakdown and repair completion are constant. In addition, the probability of server vacation, the probability of system is under repair and the probabilities that the server provides service in three fluctuating modes decreases due to an increase in reneging and a decrease in vacation completion rates.展开更多
We study a two stage queuing model where the server provides two stages of service one by one in succession. We consider reneging to occur when the server is unavailable during the system breakdown or vacation periods...We study a two stage queuing model where the server provides two stages of service one by one in succession. We consider reneging to occur when the server is unavailable during the system breakdown or vacation periods. We concentrate on deriving the steady state solutions by using supplementary variable technique and calculate the mean queue length and mean waiting time. Further some special cases are also discussed and numerical examples are presented.展开更多
This paper deals with the study of multi-server queueing model in a fuzzy environment with imposition of reneging of customers. Entry of the customers in the system is assumed to be Poisson process and exponential ser...This paper deals with the study of multi-server queueing model in a fuzzy environment with imposition of reneging of customers. Entry of the customers in the system is assumed to be Poisson process and exponential service time distribution under first</span></span><span><span><span>-</span></span></span><span><span><span>come-first-served basis. Specific of this investigation is to derive the various fuzzy performance measures such as fuzzy queue length, fuzzy waiting time in queue, fuzzy response time and fuzzy optimal number of servers in explicit form for the finite capacity multi-server queueing system by using recursive method. For the validity of the model we have obtained the numerical illustrations in tabular form which shows that fuzzy-queue can be more realistic than crisp queue.展开更多
A Prioritized Medium Access Control (P-MAC) protocol is proposed for wireless routers of mesh networks with quality-of-service provisioning. The simple yet effective design of P-MAC offers strict service differentia...A Prioritized Medium Access Control (P-MAC) protocol is proposed for wireless routers of mesh networks with quality-of-service provisioning. The simple yet effective design of P-MAC offers strict service differentiation for prioritized packets. A Markov model is developed to yield important performance matrices including the packet blocking probability due to queue overflow and the packet reneging probability due to delay bound. It is further proved that the service time of P-MAC approximates exponential distribution, and can be effectively estimated. The analytic models with preemptive and non-preemptive schemes, validated via simulations, show that P-MAC can effectively support traffic differentiation and achieve very low packet dropping (both reneging and blocking) probabilities when the traffic load is below the channel capacity. When the network is overloaded, P-MAC can still maintain extremely stable and high channel throughput. Moreover, it is demonstrated that P-MAC performs superior in multihop networks, further proving the advantages of the proposed protocol.展开更多
Bulk arrival retrial G-queue with impatient customers and multi-servicessubject to server breakdowns has been analyzed. The system allows the arrival oftwo types of customers: positive customers and negative customers...Bulk arrival retrial G-queue with impatient customers and multi-servicessubject to server breakdowns has been analyzed. The system allows the arrival oftwo types of customers: positive customers and negative customers in the system.The negative customers make the server fail if they find the server in busy state,whereas positive customers are served if the server is idle otherwise they join thevirtual pool of customers called orbit. The customers from the retrial orbit try theirchance again for the service. The customers have the option of obtaining more than oneservice. Moreover, the customers are impatient and may renege from the system withprobability (1−r ). The server is sent for repair as soon as it breakdowns;after repair,the service process starts again. Also, the server has the provision to initiate the servicewhen there areN customers accumulated in the system. Using supplementary variablestechnique and generating functions, various performance measures like reliabilityindices and long run probabilities have been obtained.展开更多
文摘There are abundant research results related to cognitive radio systems (CR systems), but using queueing models to portray CR systems is a new research trend. In this paper, a single-server retrial cognitive radio system with a linear retrial rate has been considered. The system has two types of users: primary users and secondary users. Secondary users have no effect on primary users because primary users have preemptive precedence. As a result, our purpose is to examine some performance indicators such as the expected queue length for primary users, the probability of the system being idle or occupied by a secondary user, and the probability of the system being busy. This paper begins by deriving the expressions for the generating functions based on the balance equations, so that we can calculate our goal conveniently.
文摘This article examines the effects of reneging, server breakdown and server vacation on the various states of the batch arrivals queueing system with single server providing service to customers in three fluctuating modes. In this queueing system, any batch arrival joins the queue if the server is busy or on vacation or under repair. However, if the server is free, one customer from the arriving batch joins the service immediately while others join the queue. In case of server breakdown, the customer whose service is interrupted returns back to the head of the queue. As soon as the server has is repaired, the server attends to the customer in mode 1. For this queueing system, customers that are impatient due to breakdown and server vacation may renege (leave the queue without getting service). Due to fluctuating modes of service delivery, the system may provide service with complete or reduced efficiency. Consequently, we construct the mathematical model and derive the probability generating functions of the steady state probabilities of several states of the system including the steady state queue size distribution. Further, we discuss some particular cases of the proposed queueing model. We present numerical examples in order to demonstrate the effects of server vacation and reneging on the various states of the system. The study revealed that an increase in reneging and a decrease in server vacation results in a decrease in server utilization and an increase in server’s idle time provided rates of server breakdown and repair completion are constant. In addition, the probability of server vacation, the probability of system is under repair and the probabilities that the server provides service in three fluctuating modes decreases due to an increase in reneging and a decrease in vacation completion rates.
文摘We study a two stage queuing model where the server provides two stages of service one by one in succession. We consider reneging to occur when the server is unavailable during the system breakdown or vacation periods. We concentrate on deriving the steady state solutions by using supplementary variable technique and calculate the mean queue length and mean waiting time. Further some special cases are also discussed and numerical examples are presented.
文摘This paper deals with the study of multi-server queueing model in a fuzzy environment with imposition of reneging of customers. Entry of the customers in the system is assumed to be Poisson process and exponential service time distribution under first</span></span><span><span><span>-</span></span></span><span><span><span>come-first-served basis. Specific of this investigation is to derive the various fuzzy performance measures such as fuzzy queue length, fuzzy waiting time in queue, fuzzy response time and fuzzy optimal number of servers in explicit form for the finite capacity multi-server queueing system by using recursive method. For the validity of the model we have obtained the numerical illustrations in tabular form which shows that fuzzy-queue can be more realistic than crisp queue.
基金Supported in part by the National Science Foundation CAREER Award (No. CNS-0347686)US Department of Energy (DoE) (No. DE-FG02-04ER46136)
文摘A Prioritized Medium Access Control (P-MAC) protocol is proposed for wireless routers of mesh networks with quality-of-service provisioning. The simple yet effective design of P-MAC offers strict service differentiation for prioritized packets. A Markov model is developed to yield important performance matrices including the packet blocking probability due to queue overflow and the packet reneging probability due to delay bound. It is further proved that the service time of P-MAC approximates exponential distribution, and can be effectively estimated. The analytic models with preemptive and non-preemptive schemes, validated via simulations, show that P-MAC can effectively support traffic differentiation and achieve very low packet dropping (both reneging and blocking) probabilities when the traffic load is below the channel capacity. When the network is overloaded, P-MAC can still maintain extremely stable and high channel throughput. Moreover, it is demonstrated that P-MAC performs superior in multihop networks, further proving the advantages of the proposed protocol.
文摘Bulk arrival retrial G-queue with impatient customers and multi-servicessubject to server breakdowns has been analyzed. The system allows the arrival oftwo types of customers: positive customers and negative customers in the system.The negative customers make the server fail if they find the server in busy state,whereas positive customers are served if the server is idle otherwise they join thevirtual pool of customers called orbit. The customers from the retrial orbit try theirchance again for the service. The customers have the option of obtaining more than oneservice. Moreover, the customers are impatient and may renege from the system withprobability (1−r ). The server is sent for repair as soon as it breakdowns;after repair,the service process starts again. Also, the server has the provision to initiate the servicewhen there areN customers accumulated in the system. Using supplementary variablestechnique and generating functions, various performance measures like reliabilityindices and long run probabilities have been obtained.