{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T14:29:57Z","timestamp":1770042597645,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T00:00:00Z","timestamp":1697500800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T00:00:00Z","timestamp":1697500800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider a system of two parallel discrete-time single-server queues, queue 1 and queue 2. The service time of any customer in either queue is equal to 1 time slot. Arrivals during <jats:italic>consecutive<\/jats:italic> slots occur independently from slot to slot. However, the arrival streams into both queues are possibly mutually interdependent, i.e., during any slot, the numbers of arrivals in queue 1 and queue 2 need not be statistically independent. Their joint probability generating function (pgf) <jats:italic>A<\/jats:italic>(<jats:italic>x<\/jats:italic>,\u00a0<jats:italic>y<\/jats:italic>) fully characterizes the queueing model. As a consequence of the possible intra-slot correlation in the arrival process, the numbers of customers present (\u201csystem contents\u201d) in queues 1 and 2, at any given slot boundary, are not necessarily independent either. In a previous paper, we have already discussed the mathematical difficulty of computing their steady-state joint pgf <jats:inline-formula><jats:alternatives><jats:tex-math>$$U(z_1,z_2)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>U<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>z<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>z<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>; explicit closed-form results can only be obtained for specific choices of <jats:italic>A<\/jats:italic>(<jats:italic>x<\/jats:italic>,\u00a0<jats:italic>y<\/jats:italic>). In this paper, we therefore look at the problem from an other angle. Specifically, we study the (asymptotic) <jats:italic>conditional<\/jats:italic> steady-state behavior of the system under the condition that the content of queue 1 is (temporarily) very high (goes to infinity). For ease of terminology, we refer to the system as the \u201casymptotic system\u201d in these circumstances. We prove that the asymptotic system is nearly identical to the original (unconditional) system, but with a modified joint arrival pgf <jats:inline-formula><jats:alternatives><jats:tex-math>$$A^*(x,y)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msup>\n                      <mml:mi>A<\/mml:mi>\n                      <mml:mo>\u2217<\/mml:mo>\n                    <\/mml:msup>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mi>x<\/mml:mi>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:mi>y<\/mml:mi>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> that can be computed explicitly from <jats:italic>A<\/jats:italic>(<jats:italic>x<\/jats:italic>,\u00a0<jats:italic>y<\/jats:italic>). This fundamental result allows us to determine the stability condition of queue 2 in the asymptotic system, and explicitly compute the classical queueing performance metrics of queue 2, such as the pgf, the moments and the approximate tail distribution of its system content, when this condition is fulfilled. It also leads to accurate approximative closed-form expressions for the joint tail distribution of the system contents in both queues, in the original (unconditional) system. We extensively illustrate our methodology by means of various specific (popular) choices of <jats:italic>A<\/jats:italic>(<jats:italic>x<\/jats:italic>,\u00a0<jats:italic>y<\/jats:italic>). In some examples, where an explicit solution for <jats:inline-formula><jats:alternatives><jats:tex-math>$$U(z_1,z_2)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>U<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>z<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>z<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> or for the (approximative) joint tail distribution is known, we retrieve the known results easily. In other cases, new results are found for arrival pgfs <jats:italic>A<\/jats:italic>(<jats:italic>x<\/jats:italic>,\u00a0<jats:italic>y<\/jats:italic>) for which no explicit results were known until now.<\/jats:p>","DOI":"10.1007\/s11134-023-09894-8","type":"journal-article","created":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T16:01:44Z","timestamp":1697558504000},"page":"189-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Asymptotic behavior of a system of two coupled queues when the content of one queue is very high"],"prefix":"10.1007","volume":"105","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3739-327X","authenticated-orcid":false,"given":"Herwig","family":"Bruneel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Devos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,17]]},"reference":[{"issue":"1","key":"9894_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1023\/A:1011040100856","volume":"37","author":"IJBF Adan","year":"2001","unstructured":"Adan, I.J.B.F., Boxma, O.J., Resing, J.A.C.: Queueing models with multiple waiting lines. Queueing Syst. 37(1), 65\u201398 (2001)","journal-title":"Queueing Syst."},{"issue":"2","key":"9894_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01720521","volume":"15","author":"IJBF Adan","year":"1993","unstructured":"Adan, I.J.B.F., van Houtum, G.J., Wessels, J., Zijm, W.H.M.: A compensation procedure for multiprogramming queues. OR Spektrum 15(2), 95\u2013106 (1993)","journal-title":"OR Spektrum"},{"issue":"2","key":"9894_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S0963548312000594","volume":"22","author":"IJBF Adan","year":"2013","unstructured":"Adan, I.J.B.F., van Leeuwaarden, J.S.H., Raschel, K.: The compensation approach for walks with small steps in the quarter plane. Combin. Probab. Comput. 22(2), 161\u2013183 (2013)","journal-title":"Combin. Probab. Comput."},{"issue":"4","key":"9894_CR4","doi-asserted-by":"publisher","first-page":"783","DOI":"10.2307\/1427792","volume":"25","author":"IJBF Adan","year":"1993","unstructured":"Adan, I.J.B.F., Wessels, J., Zijm, W.H.M.: A compensation approach for two-dimensional Markov processes. Adv. Appl. Probab. 25(4), 783\u2013817 (1993)","journal-title":"Adv. Appl. Probab."},{"issue":"1","key":"9894_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1287\/opre.40.1.157","volume":"40","author":"JPC Blanc","year":"1992","unstructured":"Blanc, J.P.C.: The power-series algorithm applied to the shortest-queue model. Oper. Res. 40(1), 157\u2013167 (1992)","journal-title":"Oper. Res."},{"issue":"4","key":"9894_CR6","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1017\/S0269964800003089","volume":"7","author":"OJ Boxma","year":"1993","unstructured":"Boxma, O.J., van Houtum, G.J.: The compensation approach applied to a 2x2 switch. Probab. Eng. Inf. Sci. 7(4), 471\u2013493 (1993)","journal-title":"Probab. Eng. Inf. Sci."},{"issue":"3","key":"9894_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s11134-022-09754-x","volume":"100","author":"H Bruneel","year":"2022","unstructured":"Bruneel, H.: Some thoughts on the analysis of coupled queues. Queueing Syst. 100(3), 185\u2013187 (2022)","journal-title":"Queueing Syst."},{"key":"9894_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3130-2","volume-title":"Discrete-Time Models for Communication Systems Including ATM","author":"H Bruneel","year":"1993","unstructured":"Bruneel, H., Kim, B.G.: Discrete-Time Models for Communication Systems Including ATM. Kluwer Academic Publisher, Boston (1993)"},{"issue":"3","key":"9894_CR9","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/0377-2217(94)90287-9","volume":"76","author":"H Bruneel","year":"1994","unstructured":"Bruneel, H., Steyaert, B., Desmet, E., Petit, G.: Analytic derivation of tail probabilities for queue lengths and waiting-times in ATM multiserver queues. Eur. J. Oper. Res. 76(3), 563\u2013572 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"9894_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, J.W.: On the determination of the stationary distribution of a symmetric clocked buffered switch. In: Ramaswami, V., Wirth, P.E. (eds.) Proceedings of ITC-15, Teletraffic Contributions for the Information Age, vol. 2a, pp. 297\u2013307. Elsevier, Amsterdam (1997)","DOI":"10.1016\/S1388-3437(97)80034-0"},{"issue":"3","key":"9894_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1019133525165","volume":"30","author":"JW Cohen","year":"1998","unstructured":"Cohen, J.W.: On the asymmetric clocked buffered switch. Queueing Syst. 30(3), 385\u2013404 (1998)","journal-title":"Queueing Syst."},{"key":"9894_CR12","volume-title":"Boundary Value Problems in Queueing System Analysis","author":"JW Cohen","year":"1983","unstructured":"Cohen, J.W., Boxma, O.J.: Boundary Value Problems in Queueing System Analysis. North-Holland Publ. Cy., Amsterdam (1983)"},{"issue":"1\u20132, SI","key":"9894_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s11134-020-09663-x","volume":"96","author":"A Devos","year":"2020","unstructured":"Devos, A., Walraevens, J., Fiems, D., Bruneel, H.: Analysis of a discrete-time two-class randomly alternating service model with Bernoulli arrivals. Queueing Syst. 96(1\u20132, SI), 133\u2013152 (2020)","journal-title":"Queueing Syst."},{"issue":"1\u20132","key":"9894_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10479-015-2059-2","volume":"238","author":"I Dimitriou","year":"2016","unstructured":"Dimitriou, I.: A queueing model with two classes of retrial customers and paired services. Ann. Oper. Res. 238(1\u20132), 123\u2013143 (2016)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9894_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1017\/S0269964816000528","volume":"31","author":"I Dimitriou","year":"2017","unstructured":"Dimitriou, I.: A two-class retrial system with coupled orbit queues. Probab. Eng. Inf. Sci. 31(2), 139\u2013179 (2017)","journal-title":"Probab. Eng. Inf. Sci."},{"issue":"1","key":"9894_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.orl.2020.10.011","volume":"49","author":"I Dimitriou","year":"2021","unstructured":"Dimitriou, I.: Analysis of the symmetric join the shortest orbit queue. Oper. Res. Lett. 49(1), 23\u201329 (2021)","journal-title":"Oper. Res. Lett."},{"key":"9894_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60001-2","volume-title":"Random Walks in the Quarter-Plane","author":"G Fayolle","year":"1999","unstructured":"Fayolle, G., Malyshev, V.A., Iasnogorodski, R.: Random Walks in the Quarter-Plane, vol. 40. Springer, Berlin (1999)"},{"issue":"2","key":"9894_CR18","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0403019","volume":"3","author":"P Flajolet","year":"1990","unstructured":"Flajolet, P., Odlyzko, A.: Singularity analysis of generating functions. SIAM J. Discret. Math. 3(2), 216\u2013240 (1990)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"9894_CR19","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/cpa.3160300206","volume":"30","author":"L Flatto","year":"1977","unstructured":"Flatto, L., McKean, H.P.: Two queues in parallel. Commun. Pure Appl. Math. 30(2), 255\u2013263 (1977)","journal-title":"Commun. Pure Appl. Math."},{"issue":"5","key":"9894_CR20","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1137\/0148069","volume":"48","author":"G Hooghiemstra","year":"1988","unstructured":"Hooghiemstra, G., Keane, M., Van de Ree, S.: Power-series for stationary distributions of coupled processor models. SIAM J. Appl. Math. 48(5), 1159\u20131166 (1988)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"9894_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0166-5316(99)00081-4","volume":"42","author":"G Hooghiemstra","year":"2000","unstructured":"Hooghiemstra, G., Koole, G.: On the convergence of the power series algorithm. Perform. Eval. 42(1), 21\u201339 (2000)","journal-title":"Perform. Eval."},{"key":"9894_CR22","unstructured":"Jaffe, S.: Equilibrium results for a pair of coupled discrete-time queues. Technical report (1989)"},{"issue":"4","key":"9894_CR23","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1017\/S0269964800002655","volume":"6","author":"S Jaffe","year":"1992","unstructured":"Jaffe, S.: The equilibrium distribution for a clocked buffered switch. Probab. Eng. Inf. Sci. 6(4), 425\u2013438 (1992)","journal-title":"Probab. Eng. Inf. Sci."},{"issue":"4","key":"9894_CR24","doi-asserted-by":"publisher","first-page":"1314","DOI":"10.1214\/aoms\/1177704869","volume":"32","author":"JF Kingman","year":"1961","unstructured":"Kingman, J.F.: Two similar queues in parallel. Ann. Math. Stat. 32(4), 1314\u20131323 (1961)","journal-title":"Ann. Math. Stat."},{"issue":"4","key":"9894_CR25","doi-asserted-by":"publisher","first-page":"952","DOI":"10.2307\/3213071","volume":"18","author":"A Konheim","year":"1981","unstructured":"Konheim, A., Meilijson, I., Melkman, A.: Processor-sharing of 2 parallel lines. J. Appl. Probab. 18(4), 952\u2013956 (1981)","journal-title":"J. Appl. Probab."},{"issue":"5","key":"9894_CR26","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/S0167-6377(03)00046-4","volume":"31","author":"J Resing","year":"2003","unstructured":"Resing, J., Ormeci, L.: A tandem queueing model with coupled processors. Oper. Res. Lett. 31(5), 383\u2013389 (2003)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9894_CR27","first-page":"257","volume":"37","author":"M Saxena","year":"2017","unstructured":"Saxena, M., Boxma, O., Kapodistria, S., Nunez Queija, R.: Two queues with random time-limited polling. Probab. Math. Stat. 37(2), 257\u2013289 (2017)","journal-title":"Probab. Math. Stat."},{"issue":"1","key":"9894_CR28","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s11134-005-1683-y","volume":"51","author":"JSH Van Leeuwaarden","year":"2005","unstructured":"Van Leeuwaarden, J.S.H., Resing, J.A.C.: A tandem queue with coupled processors: computational issues. Queueing Syst. 51(1), 29\u201352 (2005)","journal-title":"Queueing Syst."},{"key":"9894_CR29","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01206550","volume":"23","author":"P Van Mieghem","year":"1996","unstructured":"Van Mieghem, P.: The asymptotic behavior of queueing systems: Large deviations theory and dominant pole approximation. Queueing Syst. 23, 27\u201355 (1996)","journal-title":"Queueing Syst."},{"key":"9894_CR30","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s11134-010-9188-8","volume":"66","author":"J Walraevens","year":"2010","unstructured":"Walraevens, J., van Leeuwaarden, J.S.H., Boxma, O.J.: Power series approximations for generalized processor sharing systems. Queueing Syst. 66, 107\u2013130 (2010)","journal-title":"Queueing Syst."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-023-09894-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11134-023-09894-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-023-09894-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T12:05:17Z","timestamp":1700913917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11134-023-09894-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,17]]},"references-count":30,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["9894"],"URL":"https:\/\/doi.org\/10.1007\/s11134-023-09894-8","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,17]]},"assertion":[{"value":"4 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}