ON EPISODIC QUEUES.

Saved in:

Bibliographic Details
Title:	ON EPISODIC QUEUES.
Authors:	Qi-Ming He¹, Neuts, Marcel F.²
Source:	SIAM Journal on Matrix Analysis & Applications. 1997, Vol. 18 Issue 1, p223-248. 26p.
Subjects:	Queuing theory, Stochastic processes, Management science, Markov processes, Algorithms, Algebra
Abstract:	For a queueing system with a low traffic intensity, the expected number of customers in the queue is small. However, with a bursty input process, long queues may build up in a short time. In this paper, we study light traffic queueing systems with bursty input processes. We study the distributions of queue lengths, waiting times, busy and active periods, and their corresponding expansions when the traffic intensity is small. Special attention goes to some conditional distributions of queue lengths, waiting times, and system-active periods. The expansions given in this paper provide a potential asymptotic approach to the computation of various descriptors of queueing sys- tems. The coefficients of those expansions reflect some important features of episodic queues. We also report numerical results which give a graphic view of our approximations and of the effect of the burstiness of the input and service processes on the queues. [ABSTRACT FROM AUTHOR]
	Copyright of SIAM Journal on Matrix Analysis & Applications is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

FullText	Links: – Type: pdflink Text: Availability: 0
Header	DbId: egs DbLabel: Engineering Source An: 13213291 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0
IllustrationInfo
Items	– Name: Title Label: Title Group: Ti Data: ON EPISODIC QUEUES. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Qi-Ming+He%22">Qi-Ming He</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Neuts%2C+Marcel+F%2E%22">Neuts, Marcel F.</searchLink><relatesTo>2</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22SIAM+Journal+on+Matrix+Analysis+%26+Applications%22">SIAM Journal on Matrix Analysis & Applications</searchLink>. 1997, Vol. 18 Issue 1, p223-248. 26p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Queuing+theory%22">Queuing theory</searchLink><br /><searchLink fieldCode="DE" term="%22Stochastic+processes%22">Stochastic processes</searchLink><br /><searchLink fieldCode="DE" term="%22Management+science%22">Management science</searchLink><br /><searchLink fieldCode="DE" term="%22Markov+processes%22">Markov processes</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Algebra%22">Algebra</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: For a queueing system with a low traffic intensity, the expected number of customers in the queue is small. However, with a bursty input process, long queues may build up in a short time. In this paper, we study light traffic queueing systems with bursty input processes. We study the distributions of queue lengths, waiting times, busy and active periods, and their corresponding expansions when the traffic intensity is small. Special attention goes to some conditional distributions of queue lengths, waiting times, and system-active periods. The expansions given in this paper provide a potential asymptotic approach to the computation of various descriptors of queueing sys- tems. The coefficients of those expansions reflect some important features of episodic queues. We also report numerical results which give a graphic view of our approximations and of the effect of the burstiness of the input and service processes on the queues. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of SIAM Journal on Matrix Analysis & Applications is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink	https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=13213291
RecordInfo	BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1137/S0895479895281472 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 26 StartPage: 223 Subjects: – SubjectFull: Queuing theory Type: general – SubjectFull: Stochastic processes Type: general – SubjectFull: Management science Type: general – SubjectFull: Markov processes Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Algebra Type: general Titles: – TitleFull: ON EPISODIC QUEUES. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Qi-Ming He – PersonEntity: Name: NameFull: Neuts, Marcel F. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: 1997 Type: published Y: 1997 Identifiers: – Type: issn-print Value: 08954798 Numbering: – Type: volume Value: 18 – Type: issue Value: 1 Titles: – TitleFull: SIAM Journal on Matrix Analysis & Applications Type: main
ResultId	1