dc.contributor.author | Sağır, Murat | |
dc.date.accessioned | 2024-01-05T13:09:39Z | |
dc.date.available | 2024-01-05T13:09:39Z | |
dc.date.issued | 2023 | en_US |
dc.identifier.citation | Sagir, 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.2204888 | en_US |
dc.identifier.issn | 0747-4946 | |
dc.identifier.issn | 1532-4176 | |
dc.identifier.uri | https://doi.org/10.1080/07474946.2023.2204888 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12508/2923 | |
dc.description.abstract | This 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.iso | eng | en_US |
dc.publisher | Taylor and Francis | en_US |
dc.relation.isversionof | 10.1080/07474946.2023.2204888 | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | 60K25 | en_US |
dc.subject | 60K30 | en_US |
dc.subject | 90B22 | en_US |
dc.subject | Finite markov chains | en_US |
dc.subject | Multiple sampling plans | en_US |
dc.subject | Queueing theory | en_US |
dc.subject | Sequential probability ratio test | en_US |
dc.subject | Traffic intensity | en_US |
dc.subject.classification | Maximum Likelihood Method | |
dc.subject.classification | Single Server Queue | |
dc.subject.classification | M/M/1 Queue | |
dc.subject.classification | Electrical Engineering, Electronics & Computer Science
- Distributed & Real Time Computing
- Queueing | |
dc.subject.other | Markov processes | |
dc.subject.other | Numerical methods | |
dc.subject.other | Probability distributions | |
dc.subject.other | Queueing networks | |
dc.subject.other | 60k25 | |
dc.subject.other | 60k30 | |
dc.subject.other | 60k30 | |
dc.subject.other | 90b22 | |
dc.subject.other | Finite markov chain | |
dc.subject.other | Multiple sampling | |
dc.subject.other | Multiple sampling plan | |
dc.subject.other | Queueing theory | |
dc.subject.other | Sampling plans | |
dc.subject.other | Sequential probability ratio test | |
dc.subject.other | Traffic intensity | |
dc.subject.other | Queueing theory | |
dc.title | A Sequential Test of Traffic Intensity for the M/M/1 Queueing System | en_US |
dc.type | article | en_US |
dc.relation.journal | Sequential Analysis | en_US |
dc.contributor.department | İşletme ve Yönetim Bilimleri Fakültesi -- Ekonomi Bölümü | en_US |
dc.identifier.volume | 42 | en_US |
dc.identifier.issue | 3 | en_US |
dc.identifier.startpage | 228 | en_US |
dc.identifier.endpage | 247 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.contributor.isteauthor | Sağır, Murat | |
dc.relation.index | Web of Science - Scopus | en_US |
dc.relation.index | Web of Science Core Collection - Science Citation Index Expanded | |