@article {14983,
	title = {Load balancing and routing on the hypercube and related networks},
	journal = {Journal of Parallel and Distributed Computing},
	volume = {14},
	year = {1992},
	month = {1992/04//},
	pages = {431 - 435},
	abstract = {Several results related to the load balancing problem on the hypercube, the shuffle-exchange, the cube-connected cycles, and the butterfly are shown. Implications of these results for routing algorithms are also discussed. Our results include the following: {\textbullet}⊎ Efficient load balancing algorithms are found for the hypercube, the shuffle-exchange, the cube-connected cycles, and the butterfly.
{\textbullet}
⊎ Load balancing is shown to require more time on a p-processor shuffle-exchange, cube-connected cycle or butterfly than on a p-processor weak hypercube.
{\textbullet}
⊎ Routing n packets on a p-processor hypercube can be done optimally whenever n = p1+1/k, for any fixed k \&gt; 0.
},
	isbn = {0743-7315},
	doi = {10.1016/0743-7315(92)90081-W},
	url = {http://www.sciencedirect.com/science/article/pii/074373159290081W},
	author = {JaJa, Joseph F. and Ryu,Kwan Woo}
}
