scholarly journals A transient solution to an M/M/1 queue: a simple approach

1987 ◽  
Vol 19 (4) ◽  
pp. 997-998 ◽  
Author(s):  
P. R. Parthasarathy
Keyword(s):  
Queueing System ◽  
Simple Approach ◽  
Time Dependent ◽  
Single Server ◽  
Transient Solution ◽  
Poisson Arrivals ◽  
Service Times ◽  
Time Dependent Solution

A time-dependent solution for the number in a single-server queueing system with Poisson arrivals and exponential service times is derived in a direct way.

scholarly journals A transient solution to an M/M/1 queue: a simple approach

1987 ◽  
Vol 19 (04) ◽  
pp. 997-998 ◽  
Author(s):  
P. R. Parthasarathy
Keyword(s):  
Queueing System ◽  
Simple Approach ◽  
Time Dependent ◽  
Single Server ◽  
Transient Solution ◽  
Poisson Arrivals ◽  
Service Times ◽  
Time Dependent Solution

A time-dependent solution for the number in a single-server queueing system with Poisson arrivals and exponential service times is derived in a direct way.

Transient solution to the many-server Poisson queue: a simple approach

1989 ◽  
Vol 26 (3) ◽  
pp. 584-594 ◽  
Author(s):  
P. R. Parthasarathy ◽  
M. Sharafali
Keyword(s):  
Queueing System ◽  
Simple Approach ◽  
Time Dependent ◽  
Transient Solution ◽  
The Many ◽  
Time Dependent Solution

An elegant time-dependent solution for the number in the M/M/c queueing system is derived in a direct way.

Transient solution to the many-server Poisson queue: a simple approach

1989 ◽  
Vol 26 (03) ◽  
pp. 584-594 ◽  
Author(s):  
P. R. Parthasarathy ◽  
M. Sharafali
Keyword(s):  
Queueing System ◽  
Simple Approach ◽  
Time Dependent ◽  
Transient Solution ◽  
The Many ◽  
Time Dependent Solution

An elegant time-dependent solution for the number in the M/M/c queueing system is derived in a direct way.

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.

An Uncertain Single-Server Queueing Model

2021 ◽  
pp. 2150001
Author(s):  
Kai Yao
Keyword(s):  
Queueing Theory ◽  
Busy Period ◽  
Queueing System ◽  
Single Server ◽  
Queueing Model ◽  
Uncertainty Distribution ◽  
Uncertain Variables ◽  
Service Efficiency ◽  
Service Times ◽  
Interarrival Times

In the queueing theory, the interarrival times between customers and the service times for customers are usually regarded as random variables. This paper considers human uncertainty in a queueing system, and proposes an uncertain queueing model in which the interarrival times and the service times are regarded as uncertain variables. The busyness index is derived analytically which indicates the service efficiency of a queueing system. Besides, the uncertainty distribution of the busy period is obtained.

scholarly journals Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing

2010 ◽  
Vol 42 (01) ◽  
pp. 246-267 ◽  
Author(s):  
Andreas Brandt ◽  
Manfred Brandt
Keyword(s):  
Waiting Times ◽  
The State ◽  
Single Server ◽  
Processor Sharing ◽  
Actual Number ◽  
Service Capacity ◽  
State Dependent ◽  
Poisson Arrivals ◽  
Service Times ◽  
The Given

We consider a system with Poisson arrivals and independent and identically distributed service times, where requests in the system are served according to the state-dependent (Cohen's generalized) processor-sharing discipline, where each request receives a service capacity that depends on the actual number of requests in the system. For this system, we derive expressions as well as tight insensitive upper bounds for the moments of the conditional sojourn time of a request with given required service time. The bounds generalize and extend corresponding results, recently given for the single-server processor-sharing system in Cheung et al. (2006) and for the state-dependent processor-sharing system with exponential service times by the authors (2008). Analogous results hold for the waiting times. Numerical examples for the M/M/m-PS and M/D/m-PS systems illustrate the given bounds.

Queueing output processes

1976 ◽  
Vol 8 (2) ◽  
pp. 395-415 ◽  
Author(s):  
D. J. Daley
Keyword(s):  
Queueing Systems ◽  
Second Order ◽  
Arrival Process ◽  
Single Server ◽  
Stationary Condition ◽  
Waiting Room ◽  
Stationary Point Process ◽  
Poisson Arrivals ◽  
Service Times ◽  
Markovian Systems

The paper reviews various aspects, mostly mathematical, concerning the output or departure process of a general queueing system G/G/s/N with general arrival process, mutually independent service times, s servers (1 ≦ s ≦ ∞), and waiting room of size N (0 ≦ N ≦ ∞), subject to the assumption of being in a stable stationary condition. Known explicit results for the distribution of the stationary inter-departure intervals {Dn} for both infinite and finite-server systems are given, with some discussion on the use of reversibility in Markovian systems. Some detailed results for certain modified single-server M/G/1 systems are also available. Most of the known second-order properties of {Dn} depend on knowing that the system has either Poisson arrivals or exponential service times. The related stationary point process for which {Dn} is the stationary sequence of the corresponding Palm–Khinchin distribution is introduced and some of its second-order properties described. The final topic discussed concerns identifiability, and questions of characterizations of queueing systems in terms of the output process being a renewal process, or uncorrelated, or infinitely divisible.

scholarly journals Transient performance analysis of a single server queuing model with retention of reneging customers

2018 ◽  
Vol 28 (3) ◽  
pp. 315-331 ◽  
Author(s):  
Rakesh Kumar ◽  
Sapana Sharma
Keyword(s):  
Performance Analysis ◽  
Probability Generating Function ◽  
Time Dependent ◽  
Function Technique ◽  
Single Server ◽  
Transient Solution ◽  
Transient Performance ◽  
Queuing Model ◽  
Special Cases ◽  
Mean And Variance

In this paper, we study a single server queuing model with retention of reneging customers. The transient solution of the model is derived using probability generating function technique. The time-dependent mean and variance of the model are also obtained. Some important special cases of the model are derived and discussed. Finally, based on the numerical example, the transient performance analysis of the model is performed.

Sign in / Sign up

Export Citation Format

Share Document