Some reflections on the Renewal-theory paradox in queueing theory. (1998)

• Record Type: Journal Article
• Authors: Cooper, Robert B.; Niu, Shun-Chen; Srinivasan, Mandyam M.
• Is Part Of: Journal of applied mathematics and stochastic analysis. Volume 11:Number 3(1998)
• Page Start: 355
• Page End: 368
• Publication Date: 1998
• Subjects: inspection paradox -- renewal-theory paradox -- waiting-time paradox -- M/G/1 queues -- vacation models -- polling models -- waiting times -- decomposition; Mathematical models -- Periodicals; Computer simulation -- Periodicals; Computer science -- Mathematics -- Periodicals; Computer science -- Mathematics; Computer simulation; Mathematical models; Applied Mathematics; Periodicals; Electronic journals; 519.22
• DOI: 10.1155/S104895339800029X
• Languages: English
• ISSNs: 1048-9533

Abstract

Abstract : The classical renewal-theory (waiting time, or inspection) paradox states that the length of the renewal interval that covers a randomly-selected time epoch tends to be longer than an ordinary renewal interval. This paradox manifests itself in numerous interesting ways in queueing theory, a prime example being the celebrated Pollaczek-Khintchine formula for the mean waiting time in the M / G / 1 queue. In this expository paper, we give intuitive arguments that “explain” why the renewal-theory paradox is ubiquitous in queueing theory, and why it sometimes produces anomalous results. In particular, we use these intuitive arguments to explain decomposition in vacation models, and to derive formulas that describe some recently-discovered counterintuitive results for polling models, such as the reduction of waiting times as a consequence of forcing the server to set up even when no work is waiting.