Randomized Greedy Hot-Potato Routing
- Costas Busch ,
- Maurice Herlihy ,
- Roger Wattenhofer
Published by Association for Computing Machinery, Inc.
We present a novel greedy hot-potato routing algorithm for the 2-dimensional n x n mesh or torus. This algorithm uses randomization to adjust packet priorities.
Copyright © 2000 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org. The definitive version of this paper can be found at ACM's Digital Library -http://www.acm.org/dl/.