An embedded level crossing technique for dams and queues

1979 ◽  
Vol 16 (01) ◽  
pp. 174-186 ◽  
Author(s):  
P. H. Brill
Keyword(s):  
Steady State ◽  
Waiting Time ◽  
Release Rate ◽  
Steady State Distribution ◽  
State Distribution ◽  
Level Crossing ◽  
Alternative Approach ◽  
Stationary Set ◽  
Special Case ◽  
Instantaneous Release

The new concept of embedded level crossings is combined with the old principle of stationary set balance to produce an alternative approach for obtaining the steady-state distribution of the level in a dam with general release rule. The method yields the steady state distribution of the customer waiting time in the GI/G/1 queue as a special case. Results for a dam in which the instantaneous release rate is proportional to the level, and for the M/G/1, GI/M/1, Ek/M/1 and D/M/1 queues are derived using the new technique.

An embedded level crossing technique for dams and queues

1979 ◽  
Vol 16 (1) ◽  
pp. 174-186 ◽  
Author(s):  
P. H. Brill
Keyword(s):  
Steady State ◽  
Waiting Time ◽  
Release Rate ◽  
Steady State Distribution ◽  
State Distribution ◽  
Level Crossing ◽  
Alternative Approach ◽  
Stationary Set ◽  
Special Case ◽  
Instantaneous Release

The new concept of embedded level crossings is combined with the old principle of stationary set balance to produce an alternative approach for obtaining the steady-state distribution of the level in a dam with general release rule. The method yields the steady state distribution of the customer waiting time in the GI/G/1 queue as a special case. Results for a dam in which the instantaneous release rate is proportional to the level, and for the M/G/1, GI/M/1, Ek/M/1 and D/M/1 queues are derived using the new technique.

A note on the waiting time in M[X]/G/1 queueing systems with a removable server

2004 ◽  
Vol 41 (1) ◽  
pp. 287-291
Author(s):  
Jacqueline Loris-Teghem
Keyword(s):  
Distribution Function ◽  
Steady State ◽  
Waiting Time ◽  
Queueing Systems ◽  
Stieltjes Transform ◽  
Steady State Distribution ◽  
State Distribution ◽  
Removable Server ◽  
Inactive Phase ◽  
Bulk Arrival

For the M[X]/G/1 queueing model with a general exhaustive-service vacation policy, it has been proved that the Laplace-Stieltjes transform (LST) of the steady-state distribution function of the waiting time of a customer arriving while the server is active is the product of the corresponding LST in the bulk arrival model with unremovable server and another LST. The expression given for the latter, however, is valid only under the assumption that the number of groups arriving in an inactive phase is independent of the sizes of the groups. We here give an expression which holds in the general case. For the N-policy case, we also give an expression for the LST of the steady-state distribution function of the waiting time of a customer arriving while the server is inactive.

A NEW LOOK AT ORGAN TRANSPLANTATION MODELS AND DOUBLE MATCHING QUEUES

2011 ◽  
Vol 25 (2) ◽  
pp. 135-155 ◽  
Author(s):  
Onno J. Boxma ◽  
Israel David ◽  
David Perry ◽  
Wolfgang Stadje
Keyword(s):  
Steady State ◽  
Organ Transplantation ◽  
Waiting Time ◽  
Queueing Theory ◽  
Waiting Lists ◽  
Performance Criteria ◽  
Prototype Model ◽  
Steady State Distribution ◽  
State Distribution ◽  
Long Run

In this paper we propose a prototype model for the problem of managing waiting lists for organ transplantations. Our model captures the double-queue nature of the problem: there is a queue of patients, but also a queue of organs. Both may suffer from “impatience”: the health of a patient may deteriorate, and organs cannot be preserved longer than a certain amount of time. Using advanced tools from queueing theory, we derive explicit results for key performance criteria: the rate of unsatisfied demands and of organ outdatings, the steady-state distribution of the number of organs on the shelf, the waiting time of a patient, and the long-run fraction of time during which the shelf is empty of organs.

A note on the waiting time in M[X]/G/1 queueing systems with a removable server

2004 ◽  
Vol 41 (01) ◽  
pp. 287-291
Author(s):  
Jacqueline Loris-Teghem
Keyword(s):  
Distribution Function ◽  
Steady State ◽  
Waiting Time ◽  
Queueing Systems ◽  
Stieltjes Transform ◽  
Steady State Distribution ◽  
State Distribution ◽  
Removable Server ◽  
Inactive Phase ◽  
Bulk Arrival

For the M[X]/G/1 queueing model with a general exhaustive-service vacation policy, it has been proved that the Laplace-Stieltjes transform (LST) of the steady-state distribution function of the waiting time of a customer arriving while the server is active is the product of the corresponding LST in the bulk arrival model with unremovable server and another LST. The expression given for the latter, however, is valid only under the assumption that the number of groups arriving in an inactive phase is independent of the sizes of the groups. We here give an expression which holds in the general case. For the N-policy case, we also give an expression for the LST of the steady-state distribution function of the waiting time of a customer arriving while the server is inactive.

Kinetic analysis of mechanism of intestinal Na+-dependent sugar transport

1985 ◽  
Vol 248 (5) ◽  
pp. C498-C509 ◽  
Author(s):  
D. Restrepo ◽  
G. A. Kimmich
Keyword(s):  
Experimental Data ◽  
Steady State ◽  
Sugar Transport ◽  
Enzyme Kinetic ◽  
Steady State Distribution ◽  
State Distribution ◽  
Least Squares Fit ◽  
Coupling Stoichiometry ◽  
Rate Limiting ◽  
Kinetics Of

Zero-trans kinetics of Na+-sugar cotransport were investigated. Sugar influx was measured at various sodium and sugar concentrations in K+-loaded cells treated with rotenone and valinomycin. Sugar influx follows Michaelis-Menten kinetics as a function of sugar concentration but not as a function of Na+ concentration. Nine models with 1:1 or 2:1 sodium:sugar stoichiometry were considered. The flux equations for these models were solved assuming steady-state distribution of carrier forms and that translocation across the membrane is rate limiting. Classical enzyme kinetic methods and a least-squares fit of flux equations to the experimental data were used to assess the fit of the different models. Four models can be discarded on this basis. Of the remaining models, we discard two on the basis of the trans sodium dependence and the coupling stoichiometry [G. A. Kimmich and J. Randles, Am. J. Physiol. 247 (Cell Physiol. 16): C74-C82, 1984]. The remaining models are terter ordered mechanisms with sodium debinding first at the trans side. If transfer across the membrane is rate limiting, the binding order can be determined to be sodium:sugar:sodium.

PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION

2017 ◽  
Vol 31 (4) ◽  
pp. 420-435 ◽  
Author(s):  
J.-M. Fourneau ◽  
Y. Ait El Majhoub
Keyword(s):  
Steady State ◽  
Product Form ◽  
Processor Sharing ◽  
Service Capacity ◽  
Steady State Distribution ◽  
State Distribution ◽  
Signal Arrival ◽  
Open Networks ◽  
Networks Of Queues

We consider open networks of queues with Processor-Sharing discipline and signals. The signals deletes all the customers present in the queues and vanish instantaneously. The customers may be usual customers or inert customers. Inert customers do not receive service but the servers still try to share the service capacity between all the customers (inert or usual). Thus a part of the service capacity is wasted. We prove that such a model has a product-form steady-state distribution when the signal arrival rates are positive.

Sign in / Sign up

Export Citation Format

Share Document