A simple approximation to minimum-delay routing.
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is very responsive to topological and link-cost changes; however, except under light traffic loads, the delays obtained with t...
| Argitaratua izan da: | Computer communication review. 29, 4 (1999). |
|---|---|
| Egile nagusia: | |
| Formatua: | Artikulua |
| Hizkuntza: | English |
| Gaiak: |