Advertisement

A fast and efficient solution to the Capacity Assignment problem using discretized learning automata

  • B. John Oommen
  • T. Dale Roberts
1 Synthesis Tasks Spatial, Temporal and Spatio-Temporal Planning and Scheduling
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1416)

Abstract

The Capacity Assignment (CA) problem focuses on finding the best possible set of capacities for the links that satisfies the traffic requirements in a prioritized network while minimizing the cost. Most approaches consider a single class of packets flowing through the network, but in reality, different classes of packets with different packet lengths and priorities are transmitted over the networks. In this paper we assume that the traffic consists of different classes of packets with different average packet lengths and priorities. Marayuma and Tang [7] proposed a single algorithm composed of several elementary heuristic procedures. Levi and Ersoy [6] introduced a simulated annealing approach which produced substantially better results. A new method that uses continuous learning automata was introduced in a previous paper [12]. In this paper we introduce a new method which uses discretized learning automata to solve the problem. Indeed, to the best of our knowledge, this is the fastest and most accurate scheme currently available.

Keywords

Probability Vector Random Environment Link Capacity Network Cost Learn Automaton 
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]
    Bertsekas, D. and Gallager, R., Data Networks Second Edition, Prentice-Hall, New Jersey, 1992.Google Scholar
  2. [2]
    Roberts, T. D., Learning Automata Solutions to the Capacity Assignment Problem, M.C.S. Thesis, School of Computer Science, Carleton University, Ottawa, Canada: K1S 5B6,1997.Google Scholar
  3. [3]
    Etheridge, D., Simon, E., Information Networks Planning and Design, Prentice Hall, New Jersey, 1992, pp 263–272.Google Scholar
  4. [4]
    Kleinrock, L., Communication Nets: Stochastic Message Flow and Delay, McGraw-Hill Book Co., Inc., New York, 1964.Google Scholar
  5. [5]
    Lakshmivarahan, S., Learning Algorithms Theory and Applications, Springer-Verlag, New York, 1981.Google Scholar
  6. [6]
    Levi, A., and Ersoy, C., “Discrete Link Capacity Assignment in Prioritized Computer Networks: Two Approaches”, Proceedings of the Ninth International Symposium on Computer and Information Services, November 7–9, 1994, Antalya, Turkey, pp. 408–415.Google Scholar
  7. [7]
    Maruyama, K., and Tang, D. T., “Discrete Link Capacity and Priority Assignments in Communication Networks”, IBM J. Res. Develop., May 1977, pp. 254–263.Google Scholar
  8. [8]
    Narendra, K. S., and Thathachar, M. A. L., Learning Automata, Prentice-Hall, 1989.Google Scholar
  9. [9]
    Oommen, B.J. and Lanctôt, J.K., “Discretized Pursuit Learning Automata”, IEEE Transactions on Systems, Man and Cybernetics, Vol. SMC-20, July/August 1990, pp. 431–438.Google Scholar
  10. [10]
    Oommen, B. J., and Ma, D. C. Y., “Deterministic Learning Automata Solutions to the Equi-Partitioning Problem”, IEEE Trans. Com.., Vol. 37, 1988, pp 2–14.Google Scholar
  11. [11]
    Oommen, B.J., “Absorbing and Ergodic Discretized Two Action Learning Automata”, IEEE Transactions on Systems, Man and Cybernetics, 1986, pp. 282–293.Google Scholar
  12. [12]
    Oommen, B. J. and Roberts, T. D., “Continuous Learning Automata Solutions to the Capacity Assignment Problem”. (Submitted for Publication).Google Scholar
  13. [13]
    Oommen, B. J. and Roberts, T. D., “Discrete Learning Automata Solutions to the Capacity Assignment Problem”. (Submitted for Publication).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • B. John Oommen
    • 1
  • T. Dale Roberts
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations