Citations: hot-potato - Szymanski, of (ResearchIndex)

11 citations found. Retrieving documents...

T. Szymanski. An analysis of "hot potato" routing in a fiber optic packet switched hypercube. In Proc. IEEE INFOCOM, pages 918--925, 1990.

Home/Search Document Not in Database Summary Related Articles Check

This paper is cited in the following contexts:

Õ(Congestion + Dilation) Hot-Potato Routing on Leveled.. - Busch (2003) (Correct)

.... been used in parallel machines such as the HEP multiprocessor [25] the Connection machine [13] and the Caltech Mosaic C [24] as well as in high speed communication networks [19] Hot potato routing algorithms are well suited for optical networks since it is di#cult to bu#er optical messages [1, 26]. 1 L 0 1 2 3 4 5 6 0 1 2 3 Butterfly Mesh L 1 . 0 2 Leveled Network Figure 1: Leveled networks We study hot potato routing algorithms for the wide class of leveled networks. A leveled network with depth L consists from L 1 levels of nodes, numbered 0 to L, such that each ....

T. Szymanski. An analysis of "hot potato" routing in a fiber optic packet switched hypercube. In Proc. IEEE INFOCOM, pages 918--925, 1990. 19

Hot-Potato Routing on Multi-Dimensional Tori - Friedhelm Meyer Auf (1995) (4 citations) (Correct)

....before they start to move, output buffers contain them after they have reached their destinations. Packets in transit are never stored in buffers. This keeps the hardware cheap and routing cycles very fast. Because of these reasons hot potato routing is especially useful in optical networks [AS92, HK90, S90], where buffering involves the packets to be stored in electronic media. 1.1 The Routing Model A processor network is represented by a directed graph whose nodes are processors and whose edges are the unidirectional communication links. This work is partially supported by the ....

....about Hot Potato Routing In the following the term with high probability means with probability of at least 1 Gamma N Gammaff , where N is the number of the nodes and ff 1 is a constant. Experimental results on simulations of hot potato routing on various networks are documented in [AS92, GG93, GH92, HK90, M89, S90]. In several of these papers a probabilistic analysis of simple protocols is presented, but various independence assumptions are made to make the analysis tractable. Feige and Raghavan [FR92] present a simple deterministic hot potato routing protocol that routes a random f 2 F Gamma n 2 ; 1 ....

T. Szymanski: An analysis of "hot-potato" routing in a fiber optic packet switched hypercube. Proceedings of the IEEE INFOCOM (1990) 918--925

Deterministic Many-to-Many Hot Potato Routing - Borodin, Rabani, Schieber (1994) (26 citations) (Correct)

....z IBM T.J. Watson Research Center, Yorktown, NY. E mail: sbar watson.ibm.com 1 Introduction This paper studies routing in a synchronous network, in which at most one packet can traverse any link in each time step. We consider a form of routing known as hot potato routing or deflection routing [1, 5, 8, 9, 10, 11, 12, 13, 15, 20, 21]. The striking feature of this form of routing is that unlike traditional store and forward packet routing, it involves no queues at intermediate nodes. Thus packets are always moving, giving rise to the term hot potato. A packet attempts to travel towards its destination. However, due to ....

....of avoiding hot spots, and (iii) the elimination of queues can reduce the price of switching hardware. Because of these reasons deflection routing was used in parallel machines such as the HEP multiprocessor [17] as well as high speed communications networks [15] especially in optical networks [1, 9, 15, 20], where buffering involves transforming the packets into electronic media. Although it has been advocated for thirty years (see Baran [3] few papers have attempted any precise analysis for hot potato schemes, while experimentally these algorithms seem to work exceptionally well [1, 9, 10, 13, ....

T. Szymanski. An analysis of "Hot Potato" routing in a fiber optic packet switched hypercube. In Proc. IEEE INFOCOM, pages 918--925. IEEE Computer Society Press, 1990.

Approximate Mean Value Analysis of Deflection-routed Shuffle-loop .. - Wagner (1992) (Correct)

....must defer to messages that are already in the network. These characteristics have led to this technique also being referred to as hot potato routing. Because deflection routing eliminates the need for switch buffering, investigation of its performance is currently receiving widespread attention [4, 6, 7, 8, 11, 12, 19, 21, 26, 30]. The typical strategy of these analyses is to make uniformity assumptions about the network that allow it to be decomposed, reducing the problem from studying the entire network to studying only a single switch. Another assumption that is commonly made is that messages unable to enter the network ....

Szymanski, T. An analysis of "hot-potato" routing in a fiber optic packet switched network. In Proc. INFOCOM '90 (1990), IEEE, pp. 918--926.

Wormhole versus deflection routing: A case study on the .. - Karaivazoglou.. (Correct)

....free output links. Therefore no buffers are needed for storing packets on any node. Since there are no buffers, deflection routing is easy to implement on hardware, and routing cycles can be very fast. Because of its properties, deflection routing can be used in optical networks [AS 92] MAX 89] SZY 90] One should notice that in our case, deflection of the packets destroys the desired message contiguity. Therefore reordering is needed as soon as all packets of a specific message have reached their destination. In this paper, we present a series of experimental results from simulations of ....

T. Szymanski. An analysis of "hot-potato" routing in a fiber optic packet switched hypercube. In Proceedings of the IEEE INFOCOM, pages 918-925, 1990

Near-Optimal Hot-Potato Routing on Trees - Busch, Magdon-Ismail.. (2004) (Correct)