Supplementary variable technique (SVT) for non-Markovian single server queue with service interruption (QSI)

2019 ◽  
Author(s):  
Madhu Jain ◽  
Sandeep Kaur ◽  
Parminder Singh
Keyword(s):  
Single Server ◽  
Supplementary Variable ◽  
Single Server Queue ◽  
Variable Technique ◽  
Supplementary Variable Technique ◽  
Service Interruption ◽  
Server Queue

Queuing Scheme with Feedback Service and Discretionary Administration

2019 ◽  
Vol 9 (1S4) ◽  
pp. 706-710 ◽  
Keyword(s):  
Generating Function ◽  
Average Length ◽  
Probability Generating Function ◽  
Function Approach ◽  
Single Server ◽  
Queue Size ◽  
Supplementary Variable ◽  
Variable Technique ◽  
Supplementary Variable Technique ◽  
Central Organization

This article take a gander at a bunch area single server channel Queuing system, where the server gives two sorts of organizations viz., beginning one a central organization and the optional organization is permitted as a second organization. In case in need, the customer settle on the optional organization .We other than anticipate that after the execution of the second time of affiliation, if the structure is unfilled, the server takes a required get-away of general dissemination. Organization thwarts in the midst of principal organization at random. Additionally if the customer isn't satisfied with the primary central organization, an info advantage for the proportionate is given to make a worthy space for the customers in the system. For the above delineated covering issue, the supplementary variable technique and generating function approach are used to derive the probability generating function of the queue size and the average length of the queue.

scholarly journals A Single Server Queue with Immediate Feedback, Working Vacation and Server Breakdown

2018 ◽  
Vol 7 (4.10) ◽  
pp. 476 ◽  
Author(s):  
Varalakshmi M ◽  
Chandrasekaran V M ◽  
Saravanarajan M C
Keyword(s):  
Queueing System ◽  
Short Interval ◽  
Single Server ◽  
Single Server Queue ◽  
Working Vacation ◽  
Immediate Feedback ◽  
Variable Technique ◽  
Server Breakdown ◽  
Server Queue ◽  
Busy Server

This paper deals with analyze of a single server queueing system with immediate feedbacks and working vacation. Upon arrival if the customer sees the server to be busy then it joins the tail end of queue. Otherwise if server is idle, the customer gets into service. After completion of service, the customer is allowed to make an immediate feedback in finite number. Busy server may fail for a short interval of time. Using supplementary variable technique the steady state results are deduced. Some system performance measures are discussed  

The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline

1987 ◽  
Vol 24 (03) ◽  
pp. 758-767
Author(s):  
D. Fakinos
Keyword(s):  
Queueing System ◽  
Limiting Distribution ◽  
Single Server ◽  
Queue Size ◽  
Single Server Queue ◽  
Preemptive Resume ◽  
Server Queue ◽  
Queue Discipline ◽  
Service Times

This paper studies theGI/G/1 queueing system assuming that customers have service times depending on the queue size and also that they are served in accordance with the preemptive-resume last-come–first-served queue discipline. Expressions are given for the limiting distribution of the queue size and the remaining durations of the corresponding services, when the system is considered at arrival epochs, at departure epochs and continuously in time. Also these results are applied to some particular cases of the above queueing system.

scholarly journals New Approach for Finding Basic Performance Measures of Single Server Queue

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Siew Khew Koh ◽  
Ah Hin Pooi ◽  
Yi Fei Tan
Keyword(s):  
Stationary State ◽  
Queue Length ◽  
Length Distribution ◽  
Cumulative Distribution ◽  
System Capacity ◽  
Interarrival Time ◽  
Single Server ◽  
Single Server Queue ◽  
Queue Length Distribution ◽  
Server Queue

Consider the single server queue in which the system capacity is infinite and the customers are served on a first come, first served basis. Suppose the probability density functionf(t)and the cumulative distribution functionF(t)of the interarrival time are such that the ratef(t)/1-F(t)tends to a constant ast→∞, and the rate computed from the distribution of the service time tends to another constant. When the queue is in a stationary state, we derive a set of equations for the probabilities of the queue length and the states of the arrival and service processes. Solving the equations, we obtain approximate results for the stationary probabilities which can be used to obtain the stationary queue length distribution and waiting time distribution of a customer who arrives when the queue is in the stationary state.

Loss Probability of a Burst Arrival Finite Queue with Synchronized Service

1992 ◽  
Vol 6 (2) ◽  
pp. 201-216 ◽  
Author(s):  
Masakiyo Miyazawa
Keyword(s):  
Markov Chain ◽  
Loss Probability ◽  
Buffer Size ◽  
Embedded Markov Chain ◽  
Main Concern ◽  
Single Server ◽  
Finite Buffer ◽  
Single Server Queue ◽  
Server Queue ◽  
Computation Algorithm

We are concerned with a burst arrival single-server queue, where arrivals of cells in a burst are synchronized with a constant service time. The main concern is with the loss probability of cells for the queue with a finite buffer. We analyze an embedded Markov chain at departure instants of cells and get a kind of lumpability for its state space. Based on these results, this paper proposes a computation algorithm for its stationary distribution and the loss probability. Closed formulas are obtained for the first two moments of the numbers of cells and active bursts when the buffer size is infinite.

Sign in / Sign up

Export Citation Format

Share Document