I. Ben-Aroya, I. Newman, and A. Schuster. Randomized single-target hot-potato routing. Journal of Algorithms, 23(1):101-120, Apr. 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....algorithm for the d dimensional mesh with DI 2(k 1) steps, where DI is the distance lower bound for any routing problem instance I. Similarly, Ben Aroya et al. 3] give an algorithm that nishes in DI 2(k 1) steps in the two dimensional mesh. For single target problems, Ben Aroya et al. [4] give a randomized algorithm for the d dimensional mesh that nishes in O(k=d) steps, with high probability. For the problems we consider here, in which there are n 2 packets to be routed, all these algorithms require O(n 2 ) steps, which can be achieved by a naive solution. The algorithm ....

I. Ben-Aroya, I. Newman, and A. Schuster. Randomized single-target hot-potato routing. Journal of Algorithms, 23(1):101-120, Apr. 1997.

.... results) For the 2 dimensional mesh and torus this algorithm preserves the O(n 1:5 ) bound given by Bar Noy et al. 2] For the 2 dimensional case a similar result was independently obtained by Ben Aroya et al. 4] For a single destination or a small set of destinations Ben Aroya et al. [5] present a randomized algorithm on the d dimensional mesh that nishes in O(k=d) steps, with high probability. For non greedy hot potato routing, Feige and Raghavan [9] present an algorithm for the n n torus that routes any random destination problem in 2n O(ln n) steps with high ....

I. Ben-Aroya, I. Newman, and A. Schuster. Randomized single-target hot-potato routing. Journal of Algorithms, 23(1):101-120, April 1997.

....algorithm for the d dimensional mesh with DI 2(k 1) steps, where DI is the distance lower bound for any routing problem instance I. Similarly, Ben Aroya et al. 3] give an algorithm that nishes in DI 2(k 1) steps in the two dimensional mesh. For single target problems, Ben Aroya et al. [4] give a randomized algorithm for the d dimensional mesh that nishes in O(k=d) steps, with high probability. For the problems we consider here, in which there are n 2 packets to be routed, all these algorithms require O(n 2 ) steps, which can be achieved by a naive solution. The algorithm ....

I. Ben-Aroya, I. Newman, and A. Schuster. Randomized single-target hot-potato routing. Journal of Algorithms, 23(1):101-120, Apr. 1997.

No context found.

I. Ben-Aroya, I. Newman, and A. Schuster. Randomized single target hot potato routing. Technical Report LPCR TR #9406, Technion, CS, June 1994.

.... in [Fei95] for the same problem is non greedy) A folklore algorithm achieves O(n 2 ) routing time on the 2 n hypercube for the same problem [Bor] Ben Aroya, Newman and Schuster gave a randomized single target greedy routing algorithm on d dimensional meshes and the n dimensional hypercube [BNS95]. As far that we know this is the only greedy hot potato routing algorithm for which the bound improves when higher dimensions are considered (i.e. the algorithm utilizes the higher in degree of the nodes) Borodin, Rabani and Schieber were the first to obtain a o(k) permutation greedy routing ....

I. Ben-Aroya, I. Newman, and A. Schuster. Randomized single target hot potato routing. J. of Algorithms, 1995. (To appear. Also in proc. 3rd Israeli Symp. on Theory of Computing and Systems, January 1995, pp. 20--29).

No context found.

I. Ben-Aroya, I. Newman, and A. Schuster, Randomized single-target hot-potato routing. J. Algorithms, 23:101--120, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC