14 search results - page 2 / 3 » Static virtual channel allocation in oblivious routing |
WSS
1997
13 years 6 months ago
1997
We present a distributed protocol for maintaining a maximum flow spanning tree in a network, with a designated node as the root of the tree. This maximum flow spanning tree can be...
ICPADS
1998
IEEE
13 years 9 months ago
1998
IEEE
With respect to scalability and arbitrary topologies of the underlying networks in multiprogramming and multithread environment, fault tolerance in acknowledged ATAB and concurren...
IPPS
1996
IEEE
13 years 9 months ago
1996
IEEE
This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic depen...
ICDCN
2010
Springer
14 years 4 days ago
2010
Springer
Conventional wireless networks employ a contention based channel access mechanism, which not only imposes high latency but also reduces goodput of the network. Lack of interference...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
The switch design for interconnection networks plays an important role in the overall performance of multiprocessors and computer networks. It is therefore crucial to study variou...