A uniform randomized routing algorithm.
| Titre: | A uniform randomized routing algorithm. |
| Auteur: | Contreras, Felipe. |
| Résumé: | 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. |
| Date: | 2002 |
| URI: | http://hdl.handle.net/10393/6222 |
Fichier(s) constituant ce document :
| Fichier(s) | Taille | Format | |
|---|---|---|---|
| NQ76431.PDF | 2.636Mb | application/pdf |
Voir/ |