Open AccessStudy on queue resource allocation in scale-free networks
Author(s) -
Cunlai Pu,
Wei Pei,
Miao Rui-Hua,
Siyuan Zhou,
Kai Wang
Publication year - 2010
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.59.6009
Subject(s) - computer science , queue , node (physics) , resource allocation , active queue management , queueing theory , shortest path problem , network packet , queue management system , scale free network , priority queue , computer network , network congestion , mathematical optimization , complex network , graph , mathematics , theoretical computer science , physics , world wide web , quantum mechanics
In this article,information traffic dynamics in scale-free networks with limited queue resource is investigated firstly. It is found that the network transits from a free flow state to full congestion state with the increase in the packet generation rate. Then,a queue resource allocation model based on node degree is proposed. The core of this model is to make the queue length of node i proportional to kβi (ki being the degree of node i and β being an allocation parameter). Simulations show that the capacity of the scale-free network is maximal when β is about 1.25 for the shortest path algorithm used to transfer information. Furthermore,the optimal value of allocation parameter β is irrelevant to the network size and the amount of queue resource.