Performance Evaluation of Neural Networks Applied to Queueing Allocation Problem

  • Junichi Takinami
  • Yutaka Matsumoto
  • Norio Okino
Conference paper


In this paper we consider the dynamic allocation of customers to queues and study the performance of neural networks applied to the problem. The queueing system consists of N parallel distinct servers, each of which has its own queue with infinite capacity. A controller allocates each arriving customer to one of the servers at arrival epoch, who maximizes the probability of starting service for the customer in the earliest time. A neural network is incorporated into the controller, so that the neural controller can make an allocation decision adaptively to changing situations. We present a simple training method for the neural controller. We consider two types of neural networks (BP and LVQ3) and compare their performance in numerical examples.


Service Time Arrival Rate Allocation Decision Service Time Distribution Neural Controller 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    L. Kleinrock, Queueing Systems, Vol. II: Computer Applications, John Wiley & Sons, NY, 1976.Google Scholar
  2. [2]
    T. Kohonen, G. Barna, and R. Chirsley, “Statistical Pattern Recognition with Neural Networks: Benchmarking Studies,” Proc. IEEE Int. Conf. Neural Networks, vol. I (San Diego, CA), pp. I-61–68, July 24–27, 1988.CrossRefGoogle Scholar
  3. [3]
    T. Kohonen, “The Self-Organizing Map,” Proceedings of the IEEE, vol. 78, no. 9, pp. 1464–1480, September 1990.CrossRefGoogle Scholar
  4. [4]
    K. R. Krishnan, “Markov Decision Algorithms for Dynamic Routing,” IEEE Communications Magazine, pp. 66-69, October 1990.Google Scholar
  5. [5]
    Z. P. Lo, Y. Yu, and B. Bavarian, “Derivation of Learning Vector Quantization Algorithms,” Proc. IJCNN’92, vol. III (Baltimore, MD), pp. III-561–566, June 7–11, 1992.Google Scholar
  6. [6]
    D. E. Rumelhart, J. L. McClelland, and the PDP Research Group, Parallel Distributed Processing, Volume 1: Foundations, Cambridge, MIT Press, 1988.Google Scholar
  7. [7]
    S. A. Solla, E. Levin, and M. Fleisher, “Accelerated Learning in Layerd Neural Networks,” Complex Systems 2, pp. 625–640, 1988.MathSciNetMATHGoogle Scholar
  8. [8]
    A. C. Tsoi and R. A. Pearson, “Comparison of Three Classification Techniques, CART, C4.5 and Multi-Layer Perceptrons,” Neural Information Processing Systems 3, pp. 963–969, Morgan Kaufmann Publishers, CA, 1991.Google Scholar
  9. [9]
    J. Walrand, An Introduction to Queueing Networks, Prentice Hall, NJ, 1988.MATHGoogle Scholar
  10. [10]
    R. R. Weber, “On the Optimal Assignment of Customers to Parallel Servers,” J. Appl. Prob., vol. 15, pp. 406–413, 1978.MATHCrossRefGoogle Scholar
  11. [11]
    W. Winston, “Optimality of the Shortest Line Discipline,” J. Appl. Prob., vol. 14, pp. 181–189, 1977.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag/Wien 1993

Authors and Affiliations

  • Junichi Takinami
    • 1
  • Yutaka Matsumoto
    • 1
  • Norio Okino
    • 1
  1. 1.Division of Applied Systems Science Faculty of EngineeringKyoto UniversityKyotoJapan

Personalised recommendations