An efficient dynamic resource allocation algorithm for packet-switched communication networks based on Hopfield neural excitation method

Dynamic Resource Allocation (DRA) algorithms set up different connections over the same resources and perform a scheduling policy to distribute the resources usage. Recently, intelligent DRA techniques based on Hopfield Neural Networks computational methods have been proposed, showing their potentia...

Full description

Saved in:
Bibliographic Details
Published in:Neurocomputing (Amsterdam) 2008-10, Vol.71 (16), p.3439-3446
Main Authors: Calabuig, D., Monserrat, J.F., Gómez-Barquero, D., Lázaro, O.
Format: Article
Language:English
Subjects:
Dynamic resource allocation
Hopfield neural networks
Scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Dynamic Resource Allocation (DRA) algorithms set up different connections over the same resources and perform a scheduling policy to distribute the resources usage. Recently, intelligent DRA techniques based on Hopfield Neural Networks computational methods have been proposed, showing their potential for solving this kind of complex optimization problems. However, the initial algorithms suffer from severe instability problems impacting performance. This paper addresses these specific limitations stressing the proper neuron dynamics and proposing an efficient energy formulation and an optimum calculation of the weighting coefficients. These changes result in a maximum resource utilization together with an optimized neural network convergence.
ISSN:0925-2312
1872-8286
DOI:10.1016/j.neucom.2007.10.009