A numerical method to determine the waiting time and the idle time distributions of a GI/G/1 queue when inter-arrival times and/or service times have geometric tails. Issue 2 (3rd April 2019)

• Record Type: Journal Article
• Authors: Grassmann, Winfried K.; Tavakoli, Javad
• Is Part Of: Infor. Volume 57:Issue 2(2019)
• Page Start: 286
• Page End: 295
• Publication Date: 2019-04-03
• Subjects: Queueing theory -- GI/G/1 -- computational probability -- empirical distributions; Operations research -- Periodicals; Electronic data processing -- Periodicals; Systems engineering -- Periodicals; Systems engineering; Electronic data processing; Periodicals; 003.05
• DOI: 10.1080/03155986.2018.1533775
• Languages: English
• ISSNs: 0315-5986

Abstract

Abstract: We discuss a numerical method to find the distributions of the waiting time and the idle time for discrete-time G I / G / 1 queueing systems when inter-arrival or service time distributions have geometric tails. We showed by numerical experiments that our algorithm converges rapidly, and that the execution times for practical problems are negligible.