Issue No. 06 - June (2000 vol. 49)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.862220
<p><b>Abstract</b>—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. We shall look at three different solutions to this problem. Marayuma and Tang [<ref type="bib" rid="bibT06089">9</ref>] proposed a single algorithm composed of several elementary heuristic procedures. Levi and Ersoy [<ref type="bib" rid="bibT06088">8</ref>] introduced a simulated annealing approach that produced substantially better results. In this paper, we introduce a new method which uses continuous learning automata to solve the problem. Our new schemes produce superior results when compared with either of the previous solutions and is, to our knowledge, currently the best known solution.</p>
Learning automata, capacity assignment problem, network design.
B. John Oommen, T. Dale Roberts, "Continuous Learning Automata Solutions to the Capacity Assignment Problem", IEEE Transactions on Computers, vol. 49, no. , pp. 608-620, June 2000, doi:10.1109/12.862220