Forest Baskett, K. Mani Chandy, Richard R. Muntz, and Fernando G. Palacios. Open, closed and mixed networks of queues with different classes of customers. Journal of the ACM, 22( April 1975. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Sojourn Time Distribution of the Asymmetric M/M/1//N-System.. - Mittler, Müller (1994) (1 citation) (Correct)
....number of priorities having either LCFS PR or LCFS nonpreemptive priority queueing discipline. A comparison of the first twomoments of the waiting time for any class of priorities in an M=G=1 queue where customers are served in LCFS PR manner among the same priority classes can be found in Takagi [2 ]. He also presented a vacation system approach to this configuration. In contrast to the aforementioned open system with an infinite number of sources, there are many publications on the same system where messages leaving the system are immediately fed back to the input, thus yielding a closed ....
....review the literature considering the MIP. There is a considerable amount of publications on the MIP regarding the queueing discipline FCFS. See for example the review by Stecke and Aronson [17] chapters5.2e and5.2 of Allen [1] chapter2 of Buzacott and Shantikumar [5] and chapter 4ofTakagi [2 ]. Tak acz [18] presented the probability distribution function (pdf) of waiting times of the M=G=1= N system considering identical machines which are repaired in the order of their failures (FCFS) Further, he derived the mean waiting time. Kobayashi stated the waiting time pdf of the M=M=m= N ....
[Article contains additional citation context not shown here]
Forest Baskett, K. Mani Chandy, Richard R. Muntz, and Fernando G. Palacios. Open, closed and mixed networks of queues with different classes of customers. Journal of the ACM, 22( April 1975.
Network Traffic Behaviour in Switched Ethernet Systems - Field, Harder, Harrison (Correct)
....many internet sub networks could be modelled by conventional queueing networks with Poisson external arrivals and general (here Cauchy) service times. Moreover, servers rarely operate first come first served (FCFS) and processor sharing (PS) is a better representation. Thus, by the BCMP Theorem [5], product form solutions exist for these sub networks, from which performance measures like mean queue length, throughput and mean response time follow via recursive algorithms that can be implemented efficiently. Moreover, such models can easily accommodate multiple classes of traffic (with ....
Forest Baskerr, K. Mani Chandy, Richard R. Muntz and Fernando G. Palacios, Open, Closed and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM 22 (2), pp.248-260, April 1975.
Scheduling Queueing Networks: Stability, Performance Analysis, and .. - Kumar (1994) (Correct)
No context found.
F. Baskerr, K. M. Chandy, R. R. Muntz, and F. G. Palacios. Open, closed and mixed networks of queues with different classes of customers. J. Assoc. Cornput. Mach., 22(2):248 260, April 1975.
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