C. Busch, M. Herlihy, and R. Wattenhofer. Randomized greedy hot-potato routing. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 458--466, January 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....these algorithms, each node forwards each packet closer to its destination whenever possible. Although greedy algorithms have been observed to work well in practice (for static routing problems) the known theoretical results for their performance are far from being tight. Recently, Busch et al. [9] present a greedy algorithm and prove upper bounds of O(n) for their average running time and of O(n log n) for their worse case running time on static routing problems. Especially for meshes and tori, a class of hot potato routing algorithms that has received much attention is that of ....

C. Busch, M. Herlihy, and R. Wattenhofer. Randomized Greedy Hot--Potato Routing. In Proc. of the 11th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA '00), pp. 458--466, 2000.

....in [21, 34] chooses a packet with minimum distance to its destination to advance, and in the maximum distance heuristic, a packet with maximum distance to its destination is chosen to advance. Only recently has there been any precise analysis of the performance of greedy hot potato 2 algorithms [6 8, 12, 14, 15, 18]. Non greedy hot potato algorithms have appeared in [13, 18, 23, 26 28] and lower bounds for hot potato routing on meshes have been presented by Ben Aroya et al. 5] An important result of Borodin et al. 12] establishes an upper bound of dist(p) 2(k Gamma 1) on the number of steps used by ....

C. Busch, M. Herlihy, and R. Wattenhofer, Randomized greedy hot-potato routing. In Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'00), ACM, to appear.

No context found.

C. Busch, M. Herlihy, and R. Wattenhofer. Randomized greedy hot-potato routing. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 458--466, January 2000.

No context found.

C. Busch, M. Herlihy, and R. Wattenhofer. Randomized greedy hot-potato routing. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 458-466, Jan. 2000.

No context found.

C. Busch, M. Herlihy, and R. Wattenhofer. Randomized greedy hot-potato routing. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 458--466, January 2000.

No context found.

C. Busch, M. Herlihy, and R. Wattenhofer. Randomized greedy hot-potato routing. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 458--466, January 2000.

.... optimal O(C D) algorithms for arbitrary networks [17, 18, 21, 22, 23] The technique of decreasing congestion, by assigning packets to di#erent sets, was first used in [17] In our algorithm (Section 3) packets have states with di#erent priorities; this particular technique was introduced in [11]. To our knowledge, there is no previous work on hot potato routing on arbitrary networks, not even on leveled networks, for the packet routing problems we consider here (routing problems analyzed in terms of congestion and dilation) Paper Outline We proceed in our paper as follows. In Section ....

C. Busch, M. Herlihy, and R. Wattenhofer. Randomized greedy hot-potato routing. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 458--466, Jan. 2000.

....in O(n) expected time when destinations are chosen uniformly at random. Since the distance to a randomly chosen destination is n) this complexity is also asymptotically optimal. Our algorithm exploits techniques for randomized hot potato routing ( home runs ) rst described by Busch et al. [10]. That algorithm, like most prior hot potato algorithms [12, 5, 17, 2, 7, 10, 9] is static: all packets are injected at time zero, and the analysis examines the time needed to deliver them. Static algorithms, by de nition, need not be concerned with ow control. Our new algorithm, like only a ....

....at random. Since the distance to a randomly chosen destination is n) this complexity is also asymptotically optimal. Our algorithm exploits techniques for randomized hot potato routing ( home runs ) rst described by Busch et al. 10] That algorithm, like most prior hot potato algorithms [12, 5, 17, 2, 7, 10, 9], is static: all packets are injected at time zero, and the analysis examines the time needed to deliver them. Static algorithms, by de nition, need not be concerned with ow control. Our new algorithm, like only a few others [8, 11] is dynamic: nodes may inject packets into the network ....

[Article contains additional citation context not shown here]

C. Busch, M. Herlihy, and R. Wattenhofer. Randomized greedy hot-potato routing. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'00), pages 458-466, Jan. 2000.

....in #(#) expected time when destinations are chosen uniformly at random. Since the distance to a randomly chosen destination is #) this complexity is also asymptotically optimal. Our algorithm exploits techniques for randomized hot potato routing ( home runs ) rst described by Buschetal. [10]. That algorithm, like most prior hot potato algorithms [12, 5, 17, 2, 7, 10, 9] is ######: all packets are injected at time zero, and the analysis examines the time needed to deliver them. Static algorithms, by de nition, need not be concerned with ow control. Our new algorithm, like only a ....

....at random. Since the distance to a randomly chosen destination is #) this complexity is also asymptotically optimal. Our algorithm exploits techniques for randomized hot potato routing ( home runs ) rst described by Buschetal. 10] That algorithm, like most prior hot potato algorithms [12, 5, 17, 2, 7, 10, 9], is ######: all packets are injected at time zero, and the analysis examines the time needed to deliver them. Static algorithms, by de nition, need not be concerned with ow control. Our new algorithm, like only a few others [8, 11] is dynamic: nodes may inject packets into the network ....

[Article contains additional citation context not shown here]

C. Busch, M. Herlihy, and R. Wattenhofer. Randomized greedy hot-potato routing. In ########### ## ### ######## ###### ######## ######### ## ######## ########## #########, pages 458-466, Jan. 2000.

No context found.

C. Busch, M. Herlihy, and R. Wattenhofer. Randomized greedy hot-potato routing. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 458-466, Jan. 2000.

No context found.

C. Busch, M. Herlihy, and R. Wattenhofer. Randomized greedy hot-potato routing. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 458-466, Jan. 2000.

No context found.

Busch, C. Herlihy, M. and Wattenhofer, R. (2000) Randomized greedy hot-potato routing. In Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'00), San Francisco, CA, USA, January 9-11, pp. 458 - 466. ACM/SIAM.

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