Lazy flooding: a new technique for information dissemination in distributed network systems

Flooding is a commonly used technique for network resource and topology information dissemination in data communication networks. However, due to the well-known N-squared problem, it causes network congestion. We propose a new flooding technique, called lazy flooding; it floods only when links reach a certain status. It significantly cuts down the number of floods and thus reduces the data communication network congestion. On the other hand, it has negligible effect on network performance