An Evaluation of Weak State Mechanism for Large-Scale Dynamic Networks
Forwarding decisions in routing protocols rely on information about the destination nodes provided by routing table states. When paths to a destination change, corresponding states become invalid and need to be refreshed with control messages for resilient routing. In large and highly dynamic networks, this overhead can crowd out the capacity for data traffic. For such networks, the authors propose the concept of weak state, which is interpreted as a probabilistic hint, not as absolute truth. Weak state can remain valid without explicit messages by systematically reducing the confidence in its accuracy.