{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T00:38:09Z","timestamp":1759970289553,"version":"build-2065373602"},"reference-count":25,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T00:00:00Z","timestamp":1736553600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>It is known that a correlation in either the service or interarrival times causes a deterioration in the performance of a queuing system. This study aimed to determine which of the two correlations\u2014in the service times or in the interarrival times\u2014has a stronger influence on the expected queue length, assuming an identical autocorrelation function in both cases. To achieve this goal, a formula for the expected queue length in a system with correlated arrivals was derived first. This new formula, along with a known formula for the expected queue length in a system with correlated service, was used to compare the influence of the two correlations. Various scenarios were studied, such as cases where the common correlation was positive or negative, where the variance of the service or interarrival time was low or high, and where the system load was low or high. Furthermore, both the time-dependent and the steady-state behaviors of the systems were compared. The following two key observations were made. If the impact of other factors on the queue length is minor, then a positive correlation has a worse effect on the queue length when present in service times than in arrival times. On the contrary, a negative correlation has a worse effect on the queue length when present in arrival times than in service times.<\/jats:p>","DOI":"10.3390\/sym17010106","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T04:01:52Z","timestamp":1736740912000},"page":"106","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Asymmetry Between Queues with Correlated Service and Correlated Arrivals"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0168-6919","authenticated-orcid":false,"given":"Andrzej","family":"Chydzinski","sequence":"first","affiliation":[{"name":"Department of Computer Networks and Systems, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland"}]}],"member":"1968","published-online":{"date-parts":[[2025,1,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/90.282603","article-title":"On the self-similar nature of ethernet traffic (extended version)","volume":"2","author":"Leland","year":"1994","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1109\/90.650143","article-title":"Self-similarity in World Wide Web traffic: Evidence and possible causes","volume":"5","author":"Crovella","year":"1997","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Dudin, A.N., Klimenok, V.I., and Vishnevsky, V.M. (2020). The Theory of Queuing Systems with Correlated Flows, Springer.","DOI":"10.1007\/978-3-030-32072-0"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-540-73530-4_11","article-title":"Source traffic characterization for thin client based office applications","volume":"4606","author":"Emmert","year":"2007","journal-title":"Lect. Notes Comput. Sci."},{"key":"ref_5","first-page":"66","article-title":"Stationary distribution of a finite queue with recurrent flow and Markovian service","volume":"9","author":"Bocharov","year":"1996","journal-title":"Autom. Remote Control"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1011032718715","article-title":"Perturbation theory for the asymptotic decay rates in the queues with Markovian arrival process and\/or Markovian service process","volume":"36","author":"Alfa","year":"2000","journal-title":"Queueing Syst."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1023\/A:1022219232282","article-title":"The stationary characteristics of the G\/MSP\/1\/r queueing system","volume":"64","author":"Bocharov","year":"2003","journal-title":"Autom. Remote Control"},{"key":"ref_8","first-page":"97","article-title":"The mass-service G\/BMSP\/1\/r","volume":"3","author":"Chaplygin","year":"2003","journal-title":"Inf. Process."},{"key":"ref_9","first-page":"46","article-title":"Analysis of the GI\/MSP\/c\/r queueing system","volume":"4","year":"2004","journal-title":"Inf. Process."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s11134-007-9045-6","article-title":"Asymptotic analysis for loss probability of queues with finite GI\/M\/1 type structure","volume":"57","author":"Kim","year":"2007","journal-title":"Queueing Syst."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/s11750-007-0007-2","article-title":"Analyzing the finite buffer batch arrival queue under Markovian service process: GIX\/MSP\/1\/N","volume":"15","author":"Banik","year":"2007","journal-title":"Top"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1016\/j.mcm.2010.12.007","article-title":"Analyzing state-dependent arrival in GI\/BMSP\/1\/\u221e queues","volume":"53","author":"Banik","year":"2011","journal-title":"Math. Comput. Model."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1017\/S0269964811000349","article-title":"Analytically explicit results for the GI\/C-MSP\/1\/\u221e queueing system using roots","volume":"26","author":"Chaudhry","year":"2012","journal-title":"Probab. Eng. Informational Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1007\/s12597-015-0202-0","article-title":"Sojourn-time distribution of the GI\/MSP\/1 queueing system","volume":"52","author":"Samanta","year":"2015","journal-title":"Opsearch"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10479-015-2026-y","article-title":"A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: GIX\/C-MSP\/1\/\u221e","volume":"252","author":"Chaudhry","year":"2017","journal-title":"Ann. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"7462439","DOI":"10.1155\/2018\/7462439","article-title":"A Note on the Waiting-Time Distribution in an Infinite-Buffer GI[X]\/C-MSP\/1 Queueing System","volume":"2018","author":"Banik","year":"2018","journal-title":"J. Probab. Stat."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-981-13-1592-3_4","article-title":"On the consecutive customer loss probabilities in a finite-buffer renewal batch input queue with different batch acceptance\/rejection strategies under non-renewal service","volume":"Volume 1","author":"Banik","year":"2019","journal-title":"Soft Computing for Problem Solving: SocProS 2017"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/s12597-019-00409-9","article-title":"On the optimal control of loss probability and profit in a GI\/C-BMSP\/1\/N queueing system","volume":"57","author":"Banik","year":"2020","journal-title":"Opsearch"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3777","DOI":"10.1007\/s40840-021-01120-z","article-title":"Modelling and Analysis of GI\/BMSP\/1 Queueing System","volume":"44","author":"Samanta","year":"2021","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Chydzinski, A. (2024). Transient GI\/MSP\/1\/N Queue. Entropy, 26.","DOI":"10.3390\/e26090807"},{"key":"ref_21","first-page":"21","article-title":"The Batch Markovian Arrival Process: A Review and Future Work","volume":"1","author":"Chakravarthy","year":"2001","journal-title":"Adv. Probab. Stoch. Process."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1080\/15326340701300746","article-title":"Time to reach buffer capacity in a BMAP queue","volume":"23","author":"Chydzinski","year":"2007","journal-title":"Stoch. Model."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1049\/el:19690090","article-title":"Numerical inversion of Laplace transform","volume":"5","author":"Zakian","year":"1969","journal-title":"Electron. Lett."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Schiff, J.L. (1999). The Laplace Transform: Theory and Applications, Springer.","DOI":"10.1007\/978-0-387-22757-3"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"326830","DOI":"10.1155\/2012\/326830","article-title":"Transient and stationary losses in a finite-buffer queue with batch arrivals","volume":"2012","author":"Chydzinski","year":"2012","journal-title":"Math. Probl. Eng."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/1\/106\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T10:27:06Z","timestamp":1759919226000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/1\/106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,11]]},"references-count":25,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,1]]}},"alternative-id":["sym17010106"],"URL":"https:\/\/doi.org\/10.3390\/sym17010106","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2025,1,11]]}}}