C. Agnew. Dynamic modelling and control of congestion prone systems. Oper. Res., 24(3):400--419, 1976. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Survey of Transient Finite Server Queues - Phillips, Krzesinski (Correct)
....model is more accurate than Rothkopf Oren s model for s 1. 2.2. 5 Filipiak s model for the M t M 1 queue Filipiak s model for the M t =M=1 queue has the form [Fil88] d dt E[Q(t) Gamma E[Q(t) E[Q(t) 1 (t) If (t) is constant this equation is solved by separation of variables [Agn75] However if (t) is time dependent then numerical integration is used to solve the model. Filipiak s model approximates mean queue length and mean carried traffic. The model yields exact steady state results if the queue is homogeneous (that is if (t) is constant) however an estimate of the ....
Carson E. Agnew. Dynamic modelling and control of congestion-prone systems. Operations Research, 24(3):400--419, 1975.
Transient Models for Queueing Networks - Phillips (1995) (Correct)
....This model is more accurate than Rothkopf Oren s model for s 1. Filipiak s model for the M t M 1 queue Filipiak s model for the M t =M=1 queue has the form [Fil88] d dt E[Q(t) Gamma E[Q(t) E[Q(t) 1 (t) If (t) is constant this equation is solved by separation of variables [Agn75]. However if (t) is time dependent then numerical integration is used to solve the model. Filipiak s model approximates mean queue length and mean carried traffic. The model yields exact steady state results if the queue is homogeneous (that is if (t) is constant) however an estimate of the ....
....queue is developed by Filipiak in [Fil88] The model is called a fluid flow approximation because the kernel of the model consists of an equation describing the rate of flow of customers into and out of the queue. Filipiak s dynamic flow model is similar to the models of Rider [Rid76] and Agnew [Agn75] for the M=M=1 queue and Le Gall s model for the M=M=1=K queue [LGB83] 4.1.1 Derivation The mean queue length E[Q(t) for the M t =M=1=K queue is given by the solution for the equation d dt E[Q(t) Gamma i 1 Gamma P 0 (t) j (t) i 1 Gamma PK (t) j (7) where E[Q(t) K X n=1 n ....
[Article contains additional citation context not shown here]
Carson E. Agnew. Dynamic modelling and control of congestion-prone systems. Operations Research, 24(3):400--419, 1975.
Estimation of the Number of Virtual Connections in a.. - Pitsillides, Ioannou, .. (2003) (Correct)
No context found.
C. Agnew. Dynamic modelling and control of congestion prone systems. Oper. Res., 24(3):400--419, 1976.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC