Departure Processes from GI/GI/∞ and GI/GI/c/c with Bursty Arrivals

2017 ◽  
Vol E100.B (7) ◽  
pp. 1115-1123
Author(s):  
Fumiaki MACHIHARA ◽  
Taro TOKUDA
Keyword(s):  
Departure Processes

Stationary Poisson departure processes from non-stationary queues

1986 ◽  
Vol 23 (1) ◽  
pp. 256-260 ◽  
Author(s):  
Robert D. Foley
Keyword(s):  
Poisson Process ◽  
Service Time ◽  
Queueing Systems ◽  
Arrival Rate ◽  
Distribution Functions ◽  
Arrival Process ◽  
Service Time Distribution ◽  
Departure Process ◽  
Infinite Server ◽  
Departure Processes

We present some non-stationary infinite-server queueing systems with stationary Poisson departure processes. In Foley (1982), it was shown that the departure process from the Mt/Gt/∞ queue was a Poisson process, possibly non-stationary. The Mt/Gt/∞ queue is an infinite-server queue with a stationary or non-stationary Poisson arrival process and a general server in which the service time of a customer may depend upon the customer's arrival time. Mirasol (1963) pointed out that the departure process from the M/G/∞ queue is a stationary Poisson process. The question arose whether there are any other Mt/Gt/∞ queueing systems with stationary Poisson departure processes. For example, if the arrival rate is periodic, is it possible to select the service-time distribution functions to fluctuate in order to compensate for the fluctuations of the arrival rate? In this situation and in more general situations, it is possible to select the server such that the system yields a stationary Poisson departure process.

Departure processes and busy periods of a tandem network

2010 ◽  
Vol 11 (3) ◽  
pp. 245-257 ◽  
Author(s):  
Zhaotong Lian ◽  
Ning Zhao
Keyword(s):  
Departure Processes

Observations of Departure Processes at Logan Airport to Support the Development of Departure Planning Tools

1999 ◽  
Vol 7 (4) ◽  
pp. 229-257 ◽  
Author(s):  
Husni R. Idris ◽  
Ioannis Anagnostakis ◽  
Bertrand Delcaire ◽  
R. John Hansman ◽  
John-Paul Clarke ◽  
...  
Keyword(s):  
Planning Tools ◽  
Departure Processes

scholarly journals Correlations in Output and Overflow Traffic Processes in Simple Queues

2007 ◽  
Vol 2007 ◽  
pp. 1-13
Author(s):  
Don McNickle
Keyword(s):  
Cross Correlation ◽  
Counting Processes ◽  
Storage Space ◽  
Output Process ◽  
Overflow Traffic ◽  
The Cross ◽  
Departure Processes ◽  
Traffic Processes ◽  
Overflow Process

We consider some simple Markov and Erlang queues with limited storage space. Although the departure processes from some such systems are known to be Poisson, they actually consist of the superposition of two complex correlated processes, the overflow process and the output process. We measure the cross-correlation between the counting processes for these two processes. It turns out that this can be positive, negative, or even zero (without implying independence). The models suggest some general principles on how big these correlations are, and when they are important. This may suggest when renewal or moment approximations to similar processes will be successful, and when they will not.

Arrival and departure processes of nodes in P2P systems

2011 ◽  
Author(s):  
Susumu Shibusawa ◽  
Mamoru Kobayashi ◽  
Hiroshi Ohno ◽  
Tatsuhiro Yonekura
Keyword(s):  
P2p Systems ◽  
Departure Processes
Sign in / Sign up

Export Citation Format

Share Document