A. Ben-Dor, S. Halevi, and A. Schuster. On greedy hot-potatoe routing. Technical Report PCL Report #9204, CS Department, Technion, January 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Packet Routing in Multiprocessor Networks - Chinn (1995) (Correct)
....of Figure 4.6. This difference is small because the algorithm is using more randomness than in Experiments 1 and 2, so the initial random state has less impact on delivery time than in the previous experiments. 64 4. 3 A Greedy Hot Potato Algorithm Hot potato or deflection routing [BNRST93, BDHS93, FR92, Haj91, KKR93] where a node must send on the next step any packets it receives in the current step, offers the possibility of simple logic and simple algorithms. Greedy hot potato routing [BDHS93] where packets use profitable outlinks whenever they are available, might be a nonminimal ....
....experiments. 64 4.3 A Greedy Hot Potato Algorithm Hot potato or deflection routing [BNRST93, BDHS93, FR92, Haj91, KKR93] where a node must send on the next step any packets it receives in the current step, offers the possibility of simple logic and simple algorithms. Greedy hot potato routing [BDHS93] where packets use profitable outlinks whenever they are available, might be a nonminimal adaptive solution to route arbitrary permutations in time linear in n on the n Theta n mesh. Makedon and Symvonis [MS93] give an algorithm that is based on odd even transposition and behaves much like a ....
A. Ben-Dor, S. Halevi, and A. Schuster. On greedy hot-potatoe routing. Technical Report PCL Report #9204, CS Department, Technion, January 1993.
The Performance of Adaptive Routers on Worst Case Permutations - Chinn (1994) (1 citation) (Correct)
....because in such situations there is no reason to deroute. Given that assumption, then only when congestion is heavy can a nonminimal algorithm behave differently from a minimal algorithm. But by then, it perhaps is too late to try to relieve the congestion. Hot potato or deflection routing [1, 2, 9, 10, 12], where a node must send on the next step any packets it receives in the current step, offers the possibility of simple logic and simple algorithms. Because nodes in hot potato routing do not use extra buffer space, congestion does not have a chance to build as it does in networks where nodes do ....
....it receives in the current step, offers the possibility of simple logic and simple algorithms. Because nodes in hot potato routing do not use extra buffer space, congestion does not have a chance to build as it does in networks where nodes do have extra buffer space. Greedy hot potato routing [2], where packets use profitable outlinks whenever they are available, might be a nonminimal adaptive solution to route arbitrary permutations in time linear in n on the n Theta n mesh. Makedon and Symvonis [15] give an algorithm that is based on odd even transposition and behaves much like a hot ....
A. Ben-Dor, S. Halevi, and A. Schuster. On greedy hot-potatoe routing. Technical Report PCL Report #9204, CS Department, Technion, Jan. 1993.
Lecture Notes on Message Routing in Parallel Machines - Martin Tompa (1994) (4 citations) (Correct)
....Newman and Schuster [17] present a 7n o(n) time deflection packet routing algorithm for any permutation. Although this improves the results of Theorems 7.3 and 9.2, it is based on sorting. See Section 6.2 for a discussion of drawbacks of routers based on sorting. Ben Dor, Halevi, and Schuster [2] present an O(n p k) time deflection packet routing algorithm that routes any k packets on the n 2 n mesh in a static (but not necessarily permutation) problem. We will improve on this result in Theorem 14.4. We will consider this same static setting, parameterized by the number k of packets, in ....
A. Ben-Dor, S. Halevi, and A. Schuster. On greedy hot-potatoe routing. Technical Report PCL Report #9204, CS Department, Technion, Jan. 1993.
Potential Function Analysis of Greedy Hot-Potato Routing .. - Ben-Dor, Halevi.. (1994) (6 citations) Self-citation (Ben-dor Halevi Schuster) (Correct)
No context found.
A. Ben-Dor, S. Halevi, and A. Schuster. On greedy hot-potatoe routing. Technical Report PCL Report #9204, CS dept. Technion, January 1993.
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