A uniform randomized routing algorithm.

Felipe. Contreras
Given a set of routes between pairs of sites over a communication network, the traffic load of a link measures the number of routes using it. We analyze traffic load for some randomized local routing algorithms, some of which assume geometric information on the network. We also propose a uniform randomized routing algorithm generating uniform distributed routes between a pair of sites where only source, destination and current neighbor information are available.
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.