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

@article{Boxma1992CyclicRS,
  title={Cyclic reservation schemes for efficient operation of multiple-queue single-server systems},
  author={Onno J. Boxma and Hanoch Levy and Uri Yechiali},
  journal={Annals OR},
  year={1992},
  volume={35},
  pages={187-208}
}
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… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Queueing analysis of polling models: An update, in Stochastic Arclysis of Computer and Communicalion

H. Takagi
Systems, d. H. Takagi (North-Holland, • 1990

The Mlcll queue with permanent customers

J. W. Cohen
IEEE J . Sel . Areas Commun . • 1990

Weststrate, Optimization of polling systems

O. J. Boxma, J.A.H. Levy
Proc. Performance'90, • 1990

Dynamic priority rules for cyclic - type queues

M. Bonatti, Browne, U. Yechiali
Adv . Appl . Prob . • 1989

On the optimal control of two queues with server set - up times and its analysis

K. W. Ross
SIAM J . Comp . • 1987

On optimal right - of - way policies at a single - server station when insertion of idle times is permitted

L. D. Servi
Stochastic Processes Appl . • 1977

On optimal right-of-way policies at a single-server station when insertion of idle times is permitted, Stochastic Processes Appl

I. Meilijson, U. Yechiali
1977

Waiting lines and times in a system wittr polling

A. G. Konheim andB. Meister
J. ACM 2l(1974Y70- • 1974

Similar Papers

Loading similar papers…