Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-10T16:18:13.795Z Has data issue: false hasContentIssue false
  • English
  • Français

Servers in tandem with communication and manufacturing blocking

Part of: Special processes Operations research and management science

Published online by Cambridge University Press:  14 July 2016

Benjamin Avi-Itzhak  and
Shlomo Halfin
Benjamin Avi-Itzhak*
Affiliation:
Rutgers University
Shlomo Halfin*
Affiliation:
Bellcore
*
∗ Postal address: School of Business and RUTCOR, Rutgers University, New Brunswick, NJ 08903, USA.
∗∗ Postal address: Bellcore, 445 South Street, Morristown, NJ 07960, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

Tandem queueing systems with blocking are frequently used in modelling of data communications and production transfer lines. We study such a system with no intermediate queues under the communication and the manufacturing blocking schemes and the assumption of just-in-time input. Explicit expressions for residence times, departure times, equilibrium throughput and some other measures of performance are obtained for the case of equal service requirements at all servers. This case is shown to be the ‘worst’ under the manufacturing blocking scheme, but not under the communication blocking scheme. An approximation formula is proposed for the equilibrium throughput in the case of exponential i.i.d. service times under the manufacturing blocking scheme.

Keywords

TANDEM QUEUESDATA COMMUNICATIONSPRODUCTION TRANSFERJUST-IN-TIMETHROUGHPUT

MSC classification

Primary: 60K25: Queueing theory
Secondary: 90B30: Production models
Type
Research Papers
Information
Journal of Applied Probability , Volume 30 , Issue 2 , June 1993 , pp. 429 - 437
Copyright
Copyright © Applied Probability Trust 1993 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Kelly, F. P. (1982) The throughput of a series of buffers. Adv. Appl. Prob. 14, 633–653.Google Scholar
Liggett, T. M. (1975) Ergodic theorems for the asymptotic simple exclusion process. Trans. Amer. Math. Soc. 213, 237–261.Google Scholar
Massey, W. A. (1991) Balanced queues in series with communication blocking. Math. Oper. Res. To appear.Google Scholar
Perros, H. G. and Altiok, T. (1984) Queueing networks with blocking: a bibliography. Performance Evolution Review, ACM, Sigmetrics, 12, 8–12.Google Scholar