Regenerative Analysis of Two-Way Communication Orbit-Queue with General Service Time

2018 ◽  
pp. 22-32 ◽  
Author(s):  
Evsey Morozov ◽  
Tuan Phung-Duc
Keyword(s):  
Service Time ◽  
General Service

Some perturbation results for the single-server queue with Poisson input

1965 ◽  
Vol 2 (2) ◽  
pp. 462-466 ◽  
Author(s):  
A. M. Hasofer
Keyword(s):  
Service Time ◽  
Single Server ◽  
Single Server Queue ◽  
Poisson Input ◽  
Server Queue ◽  
Image Position ◽  
General Service

In a previous paper [2] the author has studied the single-server queue with non-homogeneous Poisson input and general service time, with particular emphasis on the case when the parameter of the Poisson input is of the form

On the GA/G/∞ queue

1983 ◽  
Vol 15 (2) ◽  
pp. 444-459 ◽  
Author(s):  
Thomas Kuczek
Keyword(s):  
Service Time ◽  
Limit Theorems ◽  
Regularity Condition ◽  
Heavy Traffic ◽  
Arrival Process ◽  
Life Situation ◽  
Random Measures ◽  
Server Queue ◽  
Traffic Theory ◽  
General Service

A particular queue, the general arrival, general service-time, infinite-server queue (GA/G/∞), is introduced and certain of its properties studied. Motivated by a life situation in which the interarrival times for service converge to 0, a different sort of regularity condition (involving a tail property of random measures) is imposed on the arrival process to prove various limit theorems. There are similarities to heavy-traffic theory.

The discrete-time single-server queue with time-inhomogeneous compound Poisson input and general service time distribution

1978 ◽  
Vol 15 (3) ◽  
pp. 590-601 ◽  
Author(s):  
Do Le Minh
Keyword(s):  
Discrete Time ◽  
Service Time ◽  
Time Distribution ◽  
Single Server ◽  
Service Time Distribution ◽  
Queueing Model ◽  
Compound Poisson ◽  
Poisson Input ◽  
Server Queue ◽  
General Service

This paper studies a discrete-time, single-server queueing model having a compound Poisson input with time-dependent parameters and a general service time distribution.All major transient characteristics of the system can be calculated very easily. For the queueing model with periodic arrival function, some explicit results are obtained.

A sample path analysis of the delay in the M/G/C system

1996 ◽  
Vol 33 (1) ◽  
pp. 256-266 ◽  
Author(s):  
Sridhar Seshadri
Keyword(s):  
Path Analysis ◽  
Service Time ◽  
Sample Path ◽  
Service Discipline ◽  
Service Time Distribution ◽  
Sample Path Analysis ◽  
New Device ◽  
Mean Delay ◽  
The Mean ◽  
General Service

Using sample path analysis we show that under the same load the mean delay in queue in the M/G/2 system is smaller than that in the corresponding M/G/1 system, when the service time has either the DMRL or NBU property and the service discipline is FCFS. The proof technique uses a new device that equalizes the work in a two server system with that in a single sterver system. Other interesting quantities such as the average difference in work between the two servers in the GI/G/2 system and an exact alternate derivation of the mean delay in the M/M/2 system from sample path analysis are presented. For the same load, we also show that the mean delay in the M/G/C system with general service time distribution is smaller than that in the M/G/1 system when the traffic intensity is less than 1/c.

Sign in / Sign up

Export Citation Format

Share Document