A Hierarchical Network (HRRP(k)) and Its Application

This paper is concerned with the problem of how to share distributed resources. Based on a distributed resource sharing application in schools, an HRRP(k) network is proposed and its properties studied. It is proven that the HRRP(k) network has better performance than a 2-D mesh in group communication. Then, to improve the quality of service (QoS) of the education resource sharing network, several key strategies are proposed, including the strategy for a node to join or leave the system, the strategy for searching for resources, and the strategy for setting up connections between nodes. To realize local and global resource retrieval, several algorithms based on the HRRP(k) network are proposed. Finally, the advantages of the HRRP(k) network and the effectiveness of proposed strategies are established by theoretical analysis and comparison. Based on these findings, a prototype of a resource sharing application is proposed, which shows the HRRP(k) network has a better performance than alternative network architectures.