On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks.
Torsten SuelPublished in: IPPS/SPDP Workshops (1998)
Keyphrases
- network topologies
- dynamic routing
- randomized algorithms
- social networks
- traffic engineering
- switched networks
- complex networks
- network topology
- fixed number
- network design
- wireless ad hoc networks
- shortest path
- inter domain
- link failure
- path selection
- atm networks
- decision forest
- routing problem
- routing algorithm
- computer networks
- network traffic
- routing protocol
- packet forwarding