Int. J. of Granular Computing, Rough Sets and Intelligent Systems   »   2009 Vol.1, No.2

 

 

Title: Network hierarchical algorithm based on granular computing

 

Author: Runxiu Wu, Shuixiu Wu, Qing Liu

 

Addresses:
Department of Computer Science and Technology, NanChang Institute of Technology, Nanchang 330099, China.
The College of Computer Information and Engineering, Jiangxi Normal University, NanChang 330027, China.
School of Information Engineering, Nanchang University, Nanchang 330046, China

 

Abstract: Aiming at the wider use of the hierarchical network topology, as well as the cost of data allocation optimisation strategy in this structure was obviously lower than the general network, a network hierarchical model and algorithm based on granular computing are proposed in the paper. This algorithm maps the complex network entirely to the hierarchical network, thus we can deal with the problems of the allocation optimisation strategy for the general network by using the optimal algorithms of the data allocation of the hierarchical network. It will greatly decrease the cost of optimisation data allocation for the general network, and can dynamically adjust hierarchical network's coarseness and fineness for obtaining a rational state for the hierarchical network, which can not only reduce the complexity of data allocation optimisation strategy, but also accord with the practical problems.

 

Keywords: granular computing; GrC; hierarchical networks; equivalence granulation; data allocation; optimisation.

 

DOI: 10.1504/IJGCRSIS.2009.028005

 

Int. J. of Granular Computing, Rough Sets and Intelligent Systems, 2009 Vol.1, No.2, pp.137 - 149

 

Available online: 27 Aug 2009

 

 

Editors Full text accessAccess for SubscribersPurchase this articleComment on this article