Scheduled Hot-Potato Routing
نویسندگان
چکیده
This paper is concerned with fast, hot-potato routing, performed according to a predetermined schedule. At each time period each node selects an outgoing link, through which an incoming packet is sent. No buffers are used. We investigate first the problem of how to route a network-wide demand of packets, given the predetermined schedule. We show that certain versions of the problem have efficient solutions, while other versions are intractable. We then consider the problem of finding an optimal schedule given a network-wide demand of packets. We indicate that the problem is tractable for either a single source or single destination. However, for the multi-source multi-destination case we show that it is an NP-complete problem. We present an efficient heuristic for directed treenetworks, and adapt it to general topologies through a recursive scheme, for which an efficient performance bound is shown. Communicated by S. Khuller: submitted November 1996; revised November 1997. Raphael Rom is also with Sun Microsystems, Mountain View, CA, 94043. A preliminary version of this paper appeared in the Proceedings of IEEE INFOCOM 1995, Boston, MA, USA, pp. 579-586. This work was supported by the Broadband Telecommunications R&D Consortium administered by the chief scientist of the Israeli Ministry of Industry and Trade. J. Naor et al., Scheduled Hot-Potato Routing , JGAA, 2(4) 1–20 (1998) 2
منابع مشابه
Routing without Flow Control Hot-Potato Routing Simulation Analysis
This paper presents a simulation analysis of the algorithm presented in “Routing without Flow Control,” by Busch, Herlihy and Wattenhoffer, 2001, [1]. The hot-potato routing algorithm is simulated using Rensselaer’s Optimistic Simulation System. The simulation uses a novel reverse computation approach to efficiently and optimistically parallelize the system simulation. In addition to simulating...
متن کاملNear-Optimal Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study one-to-many batch routing problems on arbitrary tree topologies. We present two hot-potato routing algorithms, one deterministic and one randomized, whose routing times are asymptotically near-optimal (within pol...
متن کاملFlying Hot Potatoes
Optical communication networks and air traffic management systems share the same fundamental routing problem as both optical packets and aircraft must continuously move within the network, while avoiding conflicts. In this paper, we explore the use of hot potato and deflection routing algorithms, which are established routing methods in optical communication networks, in the conflict-free routi...
متن کامل