A. Ben-Dor, S. Halevi, and A. Schuster. Potential function analysis of greedy hot-potato routing. ###### ## ######### #######, 31(1):41-61, Jan./Feb. 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....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 ....

A. Ben-Dor, S. Halevi, and A. Schuster. Potential function analysis of greedy hot-potato routing. ###### ## ######### #######, 31(1):41-61, Jan./Feb. 1998.

....destination of exactly one packet, and in the random destinations problem every packet chooses its destination at random. In the more general setting of arbitrary many to one batch routing problems, there are several known hot potato algorithms. Using potential function analysis, Ben Dor et al. [5] provide a simple algorithm for the 2 dimensional n n mesh with O(n p k) steps, where k is the total number of packets to be routed. They generalized their techniques for the d dimensional mesh to obtain O(e d n d 1 k 1=d ) steps. Borodin et al. 6] present a hot potato routing algorithm ....

A. Ben-Dor, S. Halevi, and A. Schuster. Potential function analysis of greedy hot-potato routing. Theory of Computing Systems, 31(1):41-61, Jan./Feb. 1998.

....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 ....

A. Ben-Dor, S. Halevi, and A. Schuster, Potential function analysis of greedy hotpotato routing. Theory Comput. Syst., 31(1):41--61, 1998.

....[20] the Connection machine [12] and the Caltech Mosaic C [19] as well as high speed communication networks [16] Hot potato routing algorithms are well suited for optical networks [1, 10, 16, 22, 23] because it is dicult to bu er optical messages. A hot potato routing algorithm is greedy [3, 6] if each node forwards each packet closer to its destination whenever possible (that is, whenever the desired links are not already assigned to other advancing packets) A packet that does not advance toward its destination is said to be de ected. Greedy algorithms are particularly attractive ....

....follow the shortest routes to their destinations. Because greedy algorithms are local, they are well suited to problems in which packets are injected dynamically. This paper presents a new greedy hot potato routing algorithm for the 2 dimensional n n mesh or torus. Like some earlier algorithms [6, 11], we assign priorities to packets. Each packet is divided into an immutable message part, and a mutable header containing the packet s priority (three bits suce) A novel aspect of our algorithm is the way it exploits randomization to adjust priorities. Each time a packet is de ected, there is a ....

[Article contains additional citation context not shown here]

A. Ben-Dor, S. Halevi, and A. Schuster. Potential function analysis of greedy hot-potato routing. Theory of Computing Systems, 31(1):41-61, January/February 1998.

....on meshes was given by [NS92] The algorithm is based on sorting. An improvement in the leading constant was later obtained by [KLS94] Very recently, a lower bound on routing permutations by a certain class of algorithms was given [BS94] Work on general type of routing problems was done by [Haj91, BC91, BHS94, Fei94, BRS94, BTS95]. The goal in earlier works [Haj91, BC91] which was pursued in [BTS95, Fei94, BRS94] was to present a simple algorithm for hypercubes and meshes which routes k packets with any combination of origins and destinations, in d max 2(k Gamma 1) steps, where d max is the maximal sourceto ....

....arc which is not already taken by the previously considered packets. Thus the involved hardware scans the entrances in a single pass while assigning exits on the fly. The one pass property was generalized by [BRS94] to k pass, which is defined analogously. ffl Ben Dor, Halevi and Schuster [BHS94] defined greedy algorithms where a packet al..ways advances towards its target unless all the good exits are already taken by other advancing packets. This definition was later extended to the strongly greedy concept [BTS95] or equivalently the totally greedy [BRS94] or the maximal advancing ....

[Article contains additional citation context not shown here]

A. Ben-Dor, S. Halevi, and A. Schuster. Potential function analysis of greedy hot-potato routing. In Proc. of 13th ACM Symp. on Principles of Distr. Comput., Los Angeles, August 1994.

No context found.

A. Ben--Dor, S. Halevi, and A. Schuster. Potential Function Analysis of Greedy Hot--Potato Routing. In Proc. of the 13th Annual ACM Symposium on Principles of Distributed Computing, pp. 225--234, 1994.

No context found.

A. Ben-Dor, S. Halevi and A. Schuster. "Potential Function Analysis of Greedy Hot-Potato Routing", Proc. of the 13th Annual ACM Symposium on Principles of Distributed Computing, pp. 225-234, 1994.

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