Now showing items 1-4 of 4
Ants and Reinforcement Learning: A Case Study in Routing in Dynamic Networks
We investigate two new distributed routing algorithms for data networks based on simple biological "ants" that explore the network and rapidly learn good routes, using a novel variation of reinforcement learning. These two ...
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 ...
An Experimental Evaluation of List Scheduling
While altering the scope of instruction scheduling has a rich heritage in compiler literature, instruction scheduling algorithms have received little coverage in recent times. The widely held belief is that greedy heuristic ...