Now showing items 1-2 of 2
A New Approach to Routing With Dynamic Metrics
We present a new routing algorithm to compute paths within a network using dynamic link metrics. Dynamic link metrics are cost metrics that depend on a link's dynamic characteristics, e.g., the congestion on the link. Our ...
A Simple, Practical Distributed Multi-Path Routing Algorithm
We present a simple and practical distributed routing algorithm based on backward learning. The algorithm periodically floods \emscout packets that explore paths to a destination in reverse. Scout packets are small and of ...