Unimodality and Bounds of Modes for Distributions of Generalized Sojourn Times

1987 ◽  
pp. 210-221
Author(s):  
Ken-iti Sato
Keyword(s):  
Sojourn Times

Sojourn times and the overtaking condition in Jacksonian networks

1980 ◽  
Vol 12 (04) ◽  
pp. 1000-1018 ◽  
Author(s):  
J. Walrand ◽  
P. Varaiya
Keyword(s):  
Sojourn Time ◽  
Sojourn Times ◽  
Mutually Independent

Consider an open multiclass Jacksonian network in equilibrium and a path such that a customer travelling along it cannot be overtaken directly by a subsequent arrival or by the effects of subsequent arrivals. Then the sojourn times of this customer in the nodes constituting the path are all mutually independent and so the total sojourn time is easily calculated. Two examples are given to suggest that the non-overtaking condition may be necessary to ensure independence when there is a single customer class.

A. B. Clarke's Tandem Queue Revisited—Sojourn Times

2008 ◽  
Vol 26 (6) ◽  
pp. 1111-1135 ◽  
Author(s):  
A. Gómez-Corral ◽  
M.E. Martos
Keyword(s):  
Tandem Queue ◽  
Sojourn Times

Dependence structure of sojourn times via partition separated ordering

2003 ◽  
Vol 31 (6) ◽  
pp. 462-472
Author(s):  
Hans Daduna ◽  
Ryszard Szekli
Keyword(s):  
Dependence Structure ◽  
Sojourn Times

The dependence of sojourn times on service times in tandem queues

1984 ◽  
Vol 21 (3) ◽  
pp. 661-667 ◽  
Author(s):  
Xi-Ren Cao
Keyword(s):  
Sojourn Time ◽  
Past History ◽  
Interarrival Time ◽  
Conditional Probabilities ◽  
Tandem Queues ◽  
Sojourn Times ◽  
Distributed Service ◽  
Service Times

In this paper we study a series of servers with exponentially distributed service times. We find that the sojourn time of a customer at any server depends on the customer's past history only through the customer's interarrival time to that server. A method of calculating the conditional probabilities of sojourn times is developed.

A discrete formulation of the theory of sojourn times in a two-state system

2001 ◽  
Vol 289 (3-4) ◽  
pp. 307-320 ◽  
Author(s):  
Marian Boguñá ◽  
Jaume Masoliver ◽  
George H. Weiss
Keyword(s):  
State System ◽  
Sojourn Times ◽  
Discrete Formulation

scholarly journals Sojourn times and the fragility index

2012 ◽  
Vol 122 (3) ◽  
pp. 1110-1128 ◽  
Author(s):  
Michael Falk ◽  
Martin Hofmann
Keyword(s):  
Fragility Index ◽  
Sojourn Times

Cumulative constrained sojourn times in semi-Markov processes with an application to pensionable service

1978 ◽  
Vol 15 (3) ◽  
pp. 531-542 ◽  
Author(s):  
Izzet Sahin
Keyword(s):  
Markov Processes ◽  
Sojourn Time ◽  
Working Life ◽  
Partial Coverage ◽  
Sojourn Times ◽  
Semi Markov Processes

This paper is concerned with the characterization of the cumulative pensionable service over an individual's working life that is made up of random lengths of service in different employments in a given industry, under partial coverage, transferability, and a uniform vesting rule. This characterization uses some results that are developed in the paper involving a functional and cumulative constrained sojourn times (constrained in the sense that if a sojourn time is less than a given constant it is not counted) in semi-Markov processes.

scholarly journals Sojourn times in the m/g/1 queue with deterministic feedback

1989 ◽  
Vol 5 (1) ◽  
pp. 115-129 ◽  
Author(s):  
J.L. van den Berg ◽  
O. J. Boxma ◽  
W. P. Groenendijk
Keyword(s):  
Sojourn Times
Sign in / Sign up

Export Citation Format

Share Document