Skip to main content
Log in

The Snowblower Problem

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

A snowblower is circling a closed-loop racetrack, driving clockwise and clearing off snow in a constant snowblowing rate. Both the snowfall and the snowblower's driving speed vary randomly (in both space and time coordinates). The snowblower's motion and the snowload profile on the racetrack are co-dependent and co-evolve, resulting in a coupled stochastic dynamical system of ‘random motion (snowblower) in a random environment (snowload profile)’. Snowblowing systems are closely related to continuous polling systems – or, so-called, polling systems on the circle – which are the continuum limits of ‘standard’ polling systems. Our aim in this manuscript is to introduce a stochastic model that would apply to a wide class of stochastic snowblower-type systems and, simultaneously, generalize the existing models of continuous polling systems. We present a general snowblowing-system model, with arbitrary Lévy snowfall and arbitrary snowblower delays, and study it by analyzing an underlying stochastic Poincaré map governing the system's evolution. The log-Laplace transform and mean of the Poincaré map are computed, convergence to steady state (equilibrium) is proved, and the system's equilibrium behavior is explored.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Altman and S. Foss, Polling on a graph with general arrival and service time distribution, Lett. Oper. Res. 20 (1997) 187-194.

    Google Scholar 

  2. E. Altman and H. Levy, Queueing in space, Adv. in Appl. Probab. 26 (1994) 1095-1116.

    Google Scholar 

  3. D.J. Bertismas and G. Van Ryzin, A stochastic and dynamic vehicle routing problem in the Euclidean plane,Oper. Res. 39 (1991) 601-615.

    Google Scholar 

  4. J. Bertoin, Lévy Processes (Cambridge Univ. Press, Cambridge, 1996).

    Google Scholar 

  5. E.G. Coffman, Jr. and E.N. Gilbert, A continuous polling system with constant service times, IEEE Trans. Inform. Theory 32 (1986) 584-591.

    Google Scholar 

  6. E.G. Coffman, Jr. and E.N. Gilbert, Polling and greedy servers on the line, Queueuing Systems 2 (1987) 115-145.

    Google Scholar 

  7. E.G. Coffman, Jr. and A. Stolyar, Continuous polling on graphs, Probab. Engrg. Inform. Sci. 7 (1993) 209-226.

    Google Scholar 

  8. I. Eliazar, Gated polling systems: A dynamical-systems approach, submitted.

  9. I. Eliazar, From polling to snowblowing, submitted.

  10. S.W. Fuhrmann and R.B. Copper, Applications of the decomposition principle in M / G / 1 vacation models to two continuum cyclic queueing models, AT&T Tech. J. 64 (1985) 1091-1098.

    Google Scholar 

  11. O. Kallenberg, Random Measures, 3rd ed. (Academic Press, New York, 1997).

    Google Scholar 

  12. D.E. Knuth, The Art of Computer Programming, Vol. III (Addison-Wesley, Reading, MA, 1973) pp. 254-255 and 259-264.

    Google Scholar 

  13. D.P. Kroese and V. Schmidt, A continuous polling system with general service times, Ann. Appl. Probab. 2(4)(1992) 906-927.

    Google Scholar 

  14. D.P. Kroese and V. Schmidt, Queueing systems on the circle, Z. Oper. Res. 37(3) (1993) 303-331.

    Google Scholar 

  15. D.P. Kroese and V. Schmidt, Single-server queues with spatially distributed arrivals, Queueuing Systems 17 (1994) 317-345.

    Google Scholar 

  16. D.P. Kroese and V. Schmidt,Light-traffic analysis for queues with spatially distributed arrivals, Math. Oper. Res. 21 (1996) 135-157.

    Google Scholar 

  17. A. Lasota and M.C. Mackey, Chaos, Fractals, and Noise, 2nd ed. (Springer, Berlin, 1994).

    Google Scholar 

  18. G. Samrodintsky and M.S. Taqqu, Stable Non-Gaussian Random Processes (CRC Press, Boca Raton, Fl, 1994).

    Google Scholar 

  19. A.V. Skorokhod, Random Processes with Independent Increments (Kluwer Academic, Dordrecht, 1991) (original work published by Nauka, Moscow, 1986).

    Google Scholar 

  20. H. Takagi, Analysis of Polling Systems (MIT Press, Cambridge, MA, 1986).

    Google Scholar 

  21. H. Takagi, Queueing analysis of polling systems: An update, in:Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (North-Holland, Amsterdam, 1990) pp.267-318.

    Google Scholar 

  22. H. Takagi, Queueing analysis of polling models: Progress in 1990-1994, in: Frontiers in Queueing: Models and Applications in Science and Engineering, ed. J.H. Dshalalow (CRC Press, Boca Raton, FL, 1997) pp. 119-146.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eliazar, I. The Snowblower Problem. Queueing Systems 45, 357–380 (2003). https://doi.org/10.1023/B:QUES.0000018027.64828.2d

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:QUES.0000018027.64828.2d

Navigation