C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proc. STOC, pages 278--285, May 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Lower Bounds for One-to-one Packet Routing on Trees using .. - Roberts, Symvonis, Wood (2000) (Correct)
....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, Hard-potato routing. In Proc. 32nd Annual ACM Symposium on the Theory of Computing (STOC'00), pp. 278--285, ACM, 2000.
Efficient Bufferless Routing on Leveled Networks - Busch, Kelkar, Magdon-Ismail Self-citation (Busch) (Correct)
No context found.
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proc. STOC, pages 278--285, May 2000.
Direct Routing: Algorithms and Complexity - Busch, Magdon-Ismail.. Self-citation (Busch) (Correct)
No context found.
Busch, C., Herlihy, M., Wattenhofer, R.: Hard-potato routing. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. (2000) 278--285
Near-Optimal Hot-Potato Routing on Trees - Busch, Magdon-Ismail.. (2004) Self-citation (Busch Wattenhofer) (Correct)
No context found.
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 278--285, May 2000.
Universal Bufferless Routing - Busch, Magdon-Ismail, Mavronicolas (2004) Self-citation (Busch) (Correct)
No context found.
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 278--285, May 2000.
Efficient Bufferless Routing on Leveled Networks - Busch, Kelkar, Magdon-Ismail (2004) Self-citation (Busch) (Correct)
No context found.
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 278--285, May 2000.
Direct Routing: Algorithms and Complexity - Busch, Magdon-Ismail.. (2004) Self-citation (Busch) (Correct)
No context found.
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 278--285, May 2000.
Efficient Bufferless Routing on Leveled Networks - Busch, Kelkar, Magdon-Ismail (2004) Self-citation (Busch) (Correct)
No context found.
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 278--285, May 2000.
Universal Bufferless Routing - Busch, Magdon-Ismail, Mavronicolas (2004) Self-citation (Busch) (Correct)
No context found.
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 278--285, May 2000.
Direct Routing - Busch, Ismail, Mavronicolas, Spirakis (2003) Self-citation (Busch) (Correct)
No context found.
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 278--285, May 2000.
Universal Bufferless Routing - Busch, Magdon-Ismail, Mavronicolas (2004) Self-citation (Busch) (Correct)
No context found.
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 278--285, May 2000.
Greedy Õ(C+D) Hot-Potato Routing on Trees - Busch, Magdon-Ismail.. (2003) Self-citation (Busch Wattenhofer) (Correct)
No context found.
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 278--285, May 2000.
Direct Routing - Busch, Ismail, Mavronicolas, Spirakis (2003) Self-citation (Busch) (Correct)
No context found.
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 278--285, May 2000.
Greedy Õ(C+D) Hot-Potato Routing on Trees - Busch, Magdon-Ismail.. (2003) Self-citation (Busch Wattenhofer) (Correct)
No context found.
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 278--285, May 2000.
Õ(Congestion + Dilation) Hot-Potato Routing on Leveled.. - Busch (2003) Self-citation (Busch) (Correct)
....O(C L) bound, which might motivate searching for more practical algorithms that come to the same or even better performance guarantee. 1. 3 Related Work Hot potato routing algorithms have been studied for specific network multiprocessor architectures such as the 2 dimensional mesh and torus [5, 9, 10, 12, 14], the d dimensional mesh [5, 7] the hypercube [8, 12] and trees [2] Meyer auf der Heide and Scheideler [20] study the more general class of vertex symmetric networks. For more about multiprocessor architectures you can look at [15] Bhatt et al. 6] study hot potato routing on leveled networks, ....
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 278--285, May 2000.
Routing without Flow Control - Busch, Herlihy, Wattenhofer (2001) (2 citations) Self-citation (Busch Herlihy Wattenhofer) (Correct)
....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 ....
....packet on each outgoing link. The links are bidirectional. The distance between two nodes corresponds to the minimum time needed to send a packet from one node to the other. 1. 3 Packet Generation and Delivery As noted, most earlier hot potato algorithms consider only one shot (static) problems [12, 5, 17, 2, 7, 10, 9]. By contrast, our algorithm and analysis is dynamic, nodes may inject packets repeatedly over a long duration. We are aware of only two other dynamic hot potato algorithms [8, 11] All the packets have random destination, distributed uniformly over the n nodes in the network. As the ....
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC'00), pages 278-285, May 2000.
Routing without Flow Control - Busch, Herlihy, Wattenhofer (2001) (2 citations) Self-citation (Busch Herlihy Wattenhofer) (Correct)
....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 ....
....packet on each outgoing link. The links are bidirectional. The distance between two nodes corresponds to the minimum time needed to send a packet from one node to the other. 1. 3 Packet Generation and Delivery As noted, most earlier hot potato algorithms consider only one shot (static) problems [12, 5, 17, 2, 7, 10, 9]. By contrast, our algorithm and analysis is #######, nodes may inject packets repeatedly over a long duration. We are aware of only two other dynamic hot potato algorithms [8, 11] All the packets have random destination, distributed uniformly over the # # nodes in the network. As the ....
C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In ########### ## ### #### ###### ### ######### ## ###### ## ######### #########, pages 278-285, May 2000.
Coordinating Multiple Droplets in Planar Array . . . - Griffith, Akella (Correct)
No context found.
Busch, C., Herlihy, M., andWattenhofer, R. 2000. Hard-potato routing. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000), Portland, OR, May, pp. 278--285.
Lower Bounds for One-to-one Packet Routing on Trees - Roberts, Symvonis, Wood (Correct)
No context found.
Busch, C. Herlihy, M. and Wattenhofer, R. (2000) Hard-potato routing. In Proc. 32nd Annual ACM Symposium on the Theory of Computing (STOC'00), Portland, Oregon, USA, May 21-23, pp. 278-285. ACM.
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