Author(s)

Yongqiong Zhu

Corresponding Author

Yongqiong Zhu

ABSTRACT

One of the core issues of self-organizing networks is how quickly the network can respond to user resource requests while reducing network bandwidth consumption and ensuring system scalability. This paper presents a caching strategy based on node weights for self-organizing networks. In this algorithm, each node records the information of the cache node and the weight of the importance. Based on the weight, the node can use the node with higher weight as its direct neighbour to guide the query to quickly find the target resource. Experiments show that the algorithm has significantly improves the performance of resource search.

KEYWORDS

Cache Strategy, Self-Organizing Network, RREQ