114 search results - page 1 / 23 » Optimal Routing in Binomial Graph Networks |
PDCAT
2007
Springer
13 years 11 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
OTM
2007
Springer
13 years 11 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
ISPA
2007
Springer
13 years 11 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
WICON
2008
13 years 6 months ago
2008
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...