6533b823fe1ef96bd127e9ed

RESEARCH PRODUCT

A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms

Adam Czubak

subject

Distance-vector routing protocolLink-state routing protocolComputer scienceAnt colony optimization algorithmsComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSMultipath routingComputer Science::Networking and Internet ArchitectureProbabilistic logicPath vector protocolProbabilistic analysis of algorithmsRouting (electronic design automation)Algorithm

description

Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.

yearjournalcountryeditionlanguage
2013-01-01
https://doi.org/10.1007/978-3-319-00945-2_10