Exponential bounds for queues with Markovian arrivals

descriptionPublicationkeyboard_double_arrow_right Article 01 Sep 1994 Ireland English Publisher:Springer Science and Business Media LLCJournal:Queueing Systems, volume 17, pages 413-430 (issn: 0257-0130, eissn: 1572-9443,

Copyright policy )Publicly funded

Authors: Nick G. Duffield;

doi: 10.1007/bf01158702

Exponential bounds for queues with Markovian arrivals

- Summary
- Subjects
- Metrics

Abstract

The main results of the paper deal with the bounds of the queue length distribution. Particularly, for the case of Markovian arrivals the exponential upper bounds are derived. These results are commented in the framework of several examples.

Country

Ireland

Related Organizations

Dublin Institute For Advanced Studies
Ireland
Dublin City University
Ireland

Keywords

queues, Markov additive processes, exponential bounds, Queues and service in operations research, 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).	55
	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.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%