By Topic

Efficient flooding control suitable for multiple requests

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
T. Okazaki ; Graduate Sch. of Inf. Sci. & Technol., Osaka Univ., Japan ; H. Kamada ; K. Kinoshita ; H. Tode
more authors

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

Published in:

International Symposium on Applications and the Internet (SAINT'06)

Date of Conference:

23-27 Jan. 2006