TY - GEN

T1 - Optimal oblivious path selection on the mesh

AU - Busch, Costas

AU - Magdon-Ismail, Malik

AU - Xi, Jing

PY - 2005

Y1 - 2005

N2 - In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent of the traffic distribution. The quality of the paths is determined by the congestion C, the maximum number of paths crossing an edge, and the dilation D, the maximum path length. So far, the oblivious algorithms studied in the literature have focused on minimizing the congestion while ignoring the dilation. An open question is whether C and D can be controled simultaneously. Here, we answer this question for the d-dimensional mesh. We present an online algorithm for which C and D are both within O(d 2) of optimal. The algorithm uses randomization, and we show that the number of random bits required per packet is within O(d) of the minimum number of random bits required by any algorithm that obtains near-optimal congestion. For fixed d, our algorithm is asymptotically optimal.

AB - In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent of the traffic distribution. The quality of the paths is determined by the congestion C, the maximum number of paths crossing an edge, and the dilation D, the maximum path length. So far, the oblivious algorithms studied in the literature have focused on minimizing the congestion while ignoring the dilation. An open question is whether C and D can be controled simultaneously. Here, we answer this question for the d-dimensional mesh. We present an online algorithm for which C and D are both within O(d 2) of optimal. The algorithm uses randomization, and we show that the number of random bits required per packet is within O(d) of the minimum number of random bits required by any algorithm that obtains near-optimal congestion. For fixed d, our algorithm is asymptotically optimal.

UR - http://www.scopus.com/inward/record.url?scp=32144448246&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=32144448246&partnerID=8YFLogxK

U2 - 10.1109/IPDPS.2005.311

DO - 10.1109/IPDPS.2005.311

M3 - Conference contribution

AN - SCOPUS:32144448246

SN - 0769523129

SN - 0769523129

SN - 9780769523125

T3 - Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

SP - 82

BT - Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

T2 - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Y2 - 4 April 2005 through 8 April 2005

ER -