The efficiency of greedy routing in hypercubes and butterflies

We analyze the following problem. Each node of the d-dimensional hypercube independently generates packets according to a Poisson process with rate /spl lambda/. Each of the packets is to be sent to a randomly chosen destination; each of the nodes at Hamming distance k from a packet's origin is assigned an a priori probability p/sup k/(1-p)/sup d-k/. Packets are routed under a simple greedy scheme: each of them is forced to cross the hypercube dimensions required in increasing index-order, with possible queueing at the hypercube nodes. Assuming unit packet length and no other communications taking place, we show that this scheme is stable (in steady-state) if /spl rho/ >

[1]  Shelby L. Brumelle Some Inequalities for Parallel-Server Queues , 1971, Oper. Res..

[2]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[3]  Allan Borodin,et al.  Routing, merging and sorting on parallel models of computation , 1982, STOC '82.

[4]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[5]  Yukon Chang,et al.  Continuous routing and batch routing on the hypercube , 1986, PODC '86.

[6]  Paul G. Spirakis,et al.  Queueing delays in buffered multistage interconnection networks , 2018, SIGMETRICS '87.

[7]  Bruce Hajek,et al.  Delay and Routing in Interconnection Networks , 1987 .

[8]  Debasis Mitra,et al.  Randomized parallel communications on an extension of the omega network , 1987, JACM.

[9]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

[10]  Krishnan Padmanabhan,et al.  Performance of the Direct Binary n-Cube Network for Multiprocessors , 1989, IEEE Trans. Computers.

[11]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[12]  Leslie G. Valiant,et al.  General Purpose Parallel Architectures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[13]  John N. Tsitsiklis,et al.  Optimal Communication Algorithms for Hypercubes , 1991, J. Parallel Distributed Comput..

[14]  Albert G. Greenberg,et al.  Deflection routing in hypercube networks , 1992, IEEE Trans. Commun..

[15]  John N. Tsitsiklis,et al.  Efficient Routing Schemes for Multiple Broadcasts in Hypercubes , 1993, IEEE Trans. Parallel Distributed Syst..