Efficient flooding control suitable for multiple requests

摘要

Flooding algorithm is a fundamental control mechanism to notify all the nodes of some information, to get desired information from all the nodes, or to reserve a route, and so on. Flooding algorithm has merits of robustness and optimality to solutions. However, flooding algorithm has problems which increase the processing time until finishing the flooding control, and cause congestion in the network. To solve these problems, we have proposed an efficient flooding algorithm based on a biotic growth process of primitive creatures like molds or microbes. However, this algorithm has a problem which increases the processing time in a heavily loaded network. In this paper, we extend this flooding algorithm based on a biotic propagation, by using priority queuing and aggregation mechanism of returned information.