An Unified Method to Analyze Overtake Free Queueing Systems (Classic Reprint)

Excerpt from An Unified Method to Analyze Overtake Free Queueing Systems

In this paper we demonstrate that the distributional laws that relate the number of customers in the system (queue), L (Q) and the time a customer spends in the system (queue), S (W) under the first-in-first-out (FIFO) discipline lead to a complete solution for the distributions of L, Q, S, W for queueing systems which satisfy distributional laws for both L and Q (overtake free systems). Moreover, in such systems the derivation of the distributions of L, Q, S, W can be done in a unified way. Our results include a generalization of PASTA to queueing systems with arbitrary renewal arrivals under heavy traffic conditions, a generalization of the Pollaczek-Khinchin formula to the GI/ G/1 queue, an extension of the Fuhrmann and Cooper decomposition for queues with generalized vacations under mixed generalized Erlang renewal arrivals, new approximate results for the distributions of L, S in a queue, GI/ G/∞ and new exact results for the distributions of L, Q, S, W in priority queues with mixed generalized Erlang renewal arrivals.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.