Walking-Distance Introduced Queueing Theory

  • Daichi Yanagisawa
  • Akiyasu Tomoeda
  • Ayako Kimura
  • Katsuhiro Nishinari
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5191)

Abstract

We introduce the effect of delay in walking from the head of the queue to the service windows in the queueing theory, and obtain the suitable type of queueing system under various conditions. When there are plural service windows, the queueing theory indicates that a fork-type queue, which collects people into a single queue, is more efficient than a parallel-type queue, i.e., queues for each service windows. However, in the walking-distance introduced queueing theory, we find that the parallel-type queue is more efficient when sufficiently many people are waiting in queues, and service time is shorter than walking time. We also consider the situation where there are two kinds of people, whose service time is short and long. The analytical result says that we can decrease people’s waiting time and their stress by setting up queues for each kind of people separately.

Keywords

Service Time Cellular Automaton Service Rate Queueing System Throughput Rate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Erlang, A.K.: The theory of probabilities and telephone conversations. Nyt. Tidsskr. Mat. Ser. B 20, 33–39 (1909)Google Scholar
  2. 2.
    Kendall, D.G.: Stochastic Processes Occurring in the Theory of Queues and Their Analysis by the Method of the Imbedded Markov Chain. Ann. Math. Statist. 24(3), 338–354 (1953)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Burke, P.J.: The Output of a Queueing System. Operations Research 4(6), 699–704 (1956)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Jackson, J.K.: Networks of waiting lines. Operations Research 5(4), 518–521 (1957)MathSciNetGoogle Scholar
  5. 5.
    Little, J.C.D.: A proof for the queueing formula L = λW. Operations Research 9(3), 383–387 (1961)MATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Kasahara, S.: Towards Queueing Theory for the Internet Design. Technical Report of IEICE 101(649), 25–30 (2002)Google Scholar
  7. 7.
    Mukherjee, G., Manna, S.S.: Phase transition in a directed traffic flow network. Phys. Rev. E 71, 066108 (2005)CrossRefGoogle Scholar
  8. 8.
    Barabasi, A.-L.: The origin of bursts and heavy tails in human dynamics. Nature 435, 207–211 (2005)CrossRefGoogle Scholar
  9. 9.
    Helbing, D., Treiber, M., Kesting, A.: Understanding interarrival and interdeparture time statistics from interactions in queueing systems. Physica A 363, 62–72 (2006)CrossRefGoogle Scholar
  10. 10.
    Helbing, D., Jiang, R., Treiber, M.: Analytical investigation of oscillations in intersecting flows of pedestrian and vehicle traffic. Phys. Rev. E 72, 046130 (2005)CrossRefGoogle Scholar
  11. 11.
    Chowdhury, D., Santen, L., Schadschneider, A.: Statistical physics of vehicular traffic and some related systems. Phys. Rep. 329, 199–329 (2000)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Helbing, D.: Traffic and related self-driven many-particle systems. Rev. Mod. Phys. 73, 1067–1141 (2001)CrossRefGoogle Scholar
  13. 13.
    Nishinari, K., Kirchner, A., Namazi, A., Schadschneider, A.: Nonmembers: Extended Floor Field CA Model for Evacuation Dynamics. IEICE Transactions on Information and Systems E87-D(3), 726–732 (2004)Google Scholar
  14. 14.
    Yanagisawa, D., Nishinari, K.: Mean Field Theory for Pedestrian Outflow through an Exit. Phys. Rev. E 76, 061117 (2007)CrossRefGoogle Scholar
  15. 15.
    Bolch, G., Greiner, S., de Meer, H., Trivedi, K.S.: Queueing Networks and Markov Chains. A Wiley-Interscience Publication, U.S.A (1998)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Daichi Yanagisawa
    • 1
    • 2
  • Akiyasu Tomoeda
    • 1
  • Ayako Kimura
    • 1
  • Katsuhiro Nishinari
    • 1
    • 3
  1. 1.Department of Aeronautics and Astronautics, School of EngineeringThe University of Tokyo 
  2. 2.JSPS Research Fellow 
  3. 3.PRESTO, Japan Science and Technology Corporation TokyoJapan

Personalised recommendations