A tandem queueing system with priorities

descriptionPublicationkeyboard_double_arrow_right Article 01 Sep 1978 English Publisher:Springer Science and Business Media LLCJournal:Computing, volume 19, pages 203-208 (issn: 0010-485X, eissn: 1436-5057,

Copyright policy )

Authors: Bernd Meister;

doi: 10.1007/bf02252199

A tandem queueing system with priorities

- Summary
- Subjects
- Metrics

Abstract

A system ofN unlimited queues andN time-discrete servers in series, is investigated. The input consists ofN stochastic processes where requests which have been generated according to thei-th process leave the system after they have received serivice by servers 1, 2, ...,i. The holding-time distributions can be calculated by means of an equivalence theorem which holds under certain conditions for the service times.

Related Organizations

IBM (United States)
United States
IBM Research - Zurich
Switzerland

Keywords

Queueing theory (aspects of probability theory)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average