Cart (Loading....) | Create Account
Close category search window

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
5 Author(s)
Okazaki, T. ; Graduate Sch. of Inf. Sci. & Technol., Osaka Univ. ; Kamada, H. ; Kinoshita, K. ; Tode, H.
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:

Applications and the Internet, 2006. SAINT 2006. International Symposium on

Date of Conference:

23-27 Jan. 2006

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.