The complexity of routing in Clos permutation networks.
David M. KoppelmanA. Yavuz OruçPublished in: IEEE Trans. Inf. Theory (1994)
Keyphrases
- network topologies
- social networks
- network size
- wireless ad hoc networks
- worst case
- computational complexity
- dynamic routing
- decision problems
- complex networks
- computer networks
- routing protocol
- mobile wireless
- traffic engineering
- vapnik chervonenkis dimension
- path selection
- network nodes
- network design
- space complexity
- network topology
- community structure
- network structure
- computational cost