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...

Full beskrivning

Bibliografiska uppgifter
I publikationen:	Computer communication review. 29, 4 (1999).
Huvudupphovsman:	Vutukury, Srinivas
Materialtyp:	Artikel
Språk:	English
Ämnen:	Computer systems organization. Computer communication networks. Local and wide area networks. Internet (e.g., TCP/IP). Computing methodologies. Artificial intelligence. Problem Solving, Control Methods, and Search. Heuristic methods. Algorithms. Design. Measurement. Performance. Standardization. Theory. Verification.