Discretized learning automata solutions to the capacity assignment problem for prioritized networks
We present a discretized learning automaton (LA) solution to the capacity assignment (CA) problem which focuses on finding the best possible set of capacities for the links that satisfy 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 average packet lengths and different priorities are transmitted over the networks. This generalized model is the focus of this paper. Although the problem is inherently NP-hard, a few approximate solutions have been proposed in the literature. Marayuma and Tang  proposed a single algorithm composed of several elementary heuristic procedures. Other solutions tackle the problem by using modern-day artificial intelligence (AI) paradigms such as simulated annealing and genetic algorithms (GAs) , , . A new method, superior to these, that uses continuous LA, was introduced in . In this paper, we will present a discretized LA solution to the problem. This solution uses a meta-action philosophy new to the field of LA, and is probably the best available solution to this extremely complex problem.
|Keywords||Adaptive network design, Learning automata (LA), Network capacity assignment|
|Journal||IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics|
Oommen, J, & Roberts, T.D. (T. Dale). (2002). Discretized learning automata solutions to the capacity assignment problem for prioritized networks. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 32(6), 821–831. doi:10.1109/TSMCB.2002.1049616