Safe, Fast, and Cycle-Free Multi-Path Routing Using Vouchers

Abstract

A new approach to loop-free shortest-path routing is introduced that uses distance vouchers that attest to the acyclic nature of paths. Routers search and find new shortest paths to destinations without ever creating routing loops by trusting updates originated by routers that vouch being closer to destinations. The new approach is shown to converge faster than prior loop-free shortest-path routing methods.