Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
