Cyclic reservation schemes for efficient operation of multiple-queue single-server systems

We study two new cyclic reservation schemes for the efficient operation of systems consisting of a single server and multiple queues. The schemes are the Globally Gated regime and the Cyclic-Reservation Multiple-Access (CRMA). Both procedures possess mechanisms for prioritizing the queues and lend themselves to a closed-form analysis. The combination of these two properties allows for effective and efficient operation of the systems, for which we provide a thorough delay analysis and derive simple rules for optimal operation.

[1]  B. T. Doshi,et al.  Queueing systems with vacations — A survey , 1986, Queueing Syst. Theory Appl..

[2]  Peter W. Jones,et al.  Stochastic Modelling and Analysis , 1988 .

[3]  J. P. C. Blanc.  A numerical approach to cyclic-service queueing models , 1990, Queueing Syst. Theory Appl..

[4]  Kin K. Leung.  Waiting time distributions for token-passing systems with limited-one service via discrete Fourier transforms , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[5]  W. Burnside.  Theory of Functions , 1899, Nature.

[6]  Onno J. Boxma,et al.  Workloads and waiting times in single-server systems with multiple customer classes , 1989, Queueing Syst. Theory Appl..

[7]  Mehdi Nassehi,et al.  CRMA: an access scheme for high-speed LANs and MANs , 1990, IEEE International Conference on Communications, Including Supercomm Technical Sessions.

[8]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[9]  Moshe Sidi,et al.  Polling systems: applications, modeling, and optimization , 1990, IEEE Trans. Commun..

[10]  Robert B. Cooper.  Queues served in cyclic order: Waiting times , 1970, Bell Syst. Tech. J..

[11]  Eitan Altman,et al.  Polling Systems With Synchronization Constraints , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[12]  Leslie D. Servi,et al.  D/G/1 Queues with Vacations , 1986, Oper. Res..

[13]  U. Yechiali,et al.  Dynamic priority rules for cyclic-type queues , 1989, Advances in Applied Probability.

[14]  Bernd Meister,et al.  Waiting Lines and Times in a System with Polling , 1974, JACM.

[15]  O. J. Boxma,et al.  The M/G/1 Queue with Permanent Customers , 1991, IEEE J. Sel. Areas Commun..

[16]  Martin Eisenberg,et al.  Queues with Periodic Service and Changeover Time , 1972, Oper. Res..

[17]  Henk Tijms,et al.  Stochastic modelling and analysis: a computational approach , 1986 .

[18]  Isaac Meilijson,et al.  On optimal right-of-way policies at a single-server station when insertion of idle times is permitted , 1977 .

[19]  Micha Hofri,et al.  On the Optimal Control of Two Queues with Server Setup Times and its Analysis , 1987, SIAM J. Comput..

[20]  Vincent Hodgson,et al.  The Single Server Queue. , 1972 .

[21]  Hanoch Levy,et al.  Efficient Visit Orders for Polling Systems , 1993, Perform. Evaluation.

[22]  Uri Yechiali,et al.  Dynamic routing in polling systems , 1989 .

[23]  高木 英明,et al.  Analysis of polling systems , 1986 .

[24]  Hanoch Levy,et al.  Optimization of Polling Systems , 1990, International Symposium on Computer Modeling, Measurement and Evaluation.