Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network.
Ching Yuh JanA. Yavuz OruçPublished in: IEEE Trans. Computers (1993)
Keyphrases
- minimum cost
- network flow
- network flow problem
- spanning tree
- np hard
- switched networks
- network topologies
- approximation algorithms
- minimum cost flow
- capacity constraints
- network simplex algorithm
- routing algorithm
- network traffic
- complex networks
- computer networks
- worst case
- wireless sensor networks
- search algorithm
- network topology
- network design
- routing protocol
- minimal cost
- shortest path
- linear programming
- interconnection networks
- dynamic programming
- routing table