16 search results - page 1 / 4 » Some permutation routing algorithms for low-dimensional hype... |
TCS
2002
13 years 10 months ago
2002
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
STOC
2001
ACM
14 years 11 months ago
2001
ACM
JSA
2000
13 years 10 months ago
2000
We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a nonfaulty hypercube. The number of faulty nodes and links may b...
STOC
1993
ACM
14 years 2 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
SPAA
1996
ACM
14 years 3 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...