By Topic

Discretized learning automata solutions to the capacity assignment problem for prioritized networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Oommen, B.J. ; Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada ; Roberts, T.D.

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 (1977) 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). In 2000, we introduced a new method, superior to these, that uses continuous LA. In this paper, we 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.

Published in:

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on  (Volume:32 ,  Issue: 6 )