Basit öğe kaydını göster

A Sequential Test of Traffic Intensity for the M/M/1 Queueing System

dc.contributor.authorSağır, Murat
dc.date.accessioned2024-01-05T13:09:39Z
dc.date.available2024-01-05T13:09:39Z
dc.date.issued2023en_US
dc.identifier.citationSagir, M. (2023). A Sequential Test of Traffic Intensity for the M/M/1 Queueing System. Sequential Analysis, 42 (3), pp. 228-247. https://doi.org/10.1080/07474946.2023.2204888en_US
dc.identifier.issn0747-4946
dc.identifier.issn1532-4176
dc.identifier.urihttps://doi.org/10.1080/07474946.2023.2204888
dc.identifier.urihttps://hdl.handle.net/20.500.12508/2923
dc.description.abstractThis paper deals with testing traffic intensity, which is the most important parameter of the (Formula presented.) queue system. The Wald-type sequential probability ratio test (SPRT) is performed to determine traffic intensity by taking advantage of the fact that the total number of customers arriving up to the kth service period, including the kth service period, has a negative binomial distribution. Acceptance and rejection limits obtained from the SPRT are arranged as a multiple sampling plan. This plan is applied with a finite Markov chain. Then, the Operating Characteristic (OC) function and the Average Sample Number (ASN) are obtained precisely. Obtaining the standard errors of the sample number compared to the studies on SPRT applications is the novelty brought by this paper. The sequential analysis method based on the finite Markov chain is also applied to a numerical sample.en_US
dc.language.isoengen_US
dc.publisherTaylor and Francisen_US
dc.relation.isversionof10.1080/07474946.2023.2204888en_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subject60K25en_US
dc.subject60K30en_US
dc.subject90B22en_US
dc.subjectFinite markov chainsen_US
dc.subjectMultiple sampling plansen_US
dc.subjectQueueing theoryen_US
dc.subjectSequential probability ratio testen_US
dc.subjectTraffic intensityen_US
dc.subject.classificationMaximum Likelihood Method
dc.subject.classificationSingle Server Queue
dc.subject.classificationM/M/1 Queue
dc.subject.classificationElectrical Engineering, Electronics & Computer Science - Distributed & Real Time Computing - Queueing
dc.subject.otherMarkov processes
dc.subject.otherNumerical methods
dc.subject.otherProbability distributions
dc.subject.otherQueueing networks
dc.subject.other60k25
dc.subject.other60k30
dc.subject.other60k30
dc.subject.other90b22
dc.subject.otherFinite markov chain
dc.subject.otherMultiple sampling
dc.subject.otherMultiple sampling plan
dc.subject.otherQueueing theory
dc.subject.otherSampling plans
dc.subject.otherSequential probability ratio test
dc.subject.otherTraffic intensity
dc.subject.otherQueueing theory
dc.titleA Sequential Test of Traffic Intensity for the M/M/1 Queueing Systemen_US
dc.typearticleen_US
dc.relation.journalSequential Analysisen_US
dc.contributor.departmentİşletme ve Yönetim Bilimleri Fakültesi -- Ekonomi Bölümüen_US
dc.identifier.volume42en_US
dc.identifier.issue3en_US
dc.identifier.startpage228en_US
dc.identifier.endpage247en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.contributor.isteauthorSağır, Murat
dc.relation.indexWeb of Science - Scopusen_US
dc.relation.indexWeb of Science Core Collection - Science Citation Index Expanded


Bu öğenin dosyaları:

Thumbnail
Ad:
murat_sagir.pdf
Boyut:
1.964Mb
Biçim:
PDF
Açıklama:
Tam Metin / Full Text
Göster/Aç

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster