By Topic

Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques

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
$33 $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

4 Author(s)
A. Vasilakos ; Inst. of Comput. Sci., Found. for Res. & Technol.-HELLAS (FORTH), Crete, Greece ; M. P. Saltouros ; A. F. Atlassis ; W. Pedrycz

In this paper, the use of a computational intelligence approach -a reinforcement learning algorithm (RLA)-for optimizing the routing in asynchronous transfer mode (ATM) networks based on the private network-to-network interface (PNNI) standard is proposed. This algorithm which is specially designed for the quality of service (QoS) routing problem, aims at maximizing the network revenue (allocating efficiently the network resources) while ensuring the QoS requirements for each connection. In this study, large-scale networks are considered where it becomes necessary to be organized hierarchically so that a scale in terms of computation, communication and storage requirements will be achieved. A comparative performance study of the proposed and other commonly used routing schemes is demonstrated by means of simulation on existing commercial networks. Simulation results over a wide range of uniform, time-varying and skewed loading conditions show the effectiveness of the proposed routing algorithm, and disclose the strength and weakness of the various schemes.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)  (Volume:33 ,  Issue: 3 )