We probabilistically model dynamic routing on un-buuered 2-dimensional tori. We consider shortest-path routing with packet loss and retransmissions versus a newly proposed all-link busy (ALB) hot-potato routing strategy with packet deeections. Computations of the sustained packet generating rate, node through-put, and average packet latency indicate that the proposed ALB strategy is a much bett...

EEcient data transfer between processors is an essential component in any large scale parallel computation. Motivated by the growing interest in parallel computers, a signiicant amount of theoretical research has been devoted to the area of interconnection networks for parallel computers , most of it to the packet routing (or store-and-forward) model of communication. We survey some of the majo...

We solve a rich logistical problem inspired from practice, in which a heterogeneous xed eet of vehicles is used for collecting recyclable waste from large containers over a nite planning horizon. Each container is equipped with a sensor, which communicates its level at the start of the day. Given a history of observations, a forecasting model is used to estimate the point demand forecasts as we...

In dynamic P2P networks, nodes join and depart from the system frequently, which partially damages the predefined P2P structure, and impairs the system performance such as basic lookup functionality. Therefore stabilization process has to be done to restore the logical topology. This paper presents an approach to relax the requirement on routing tables to provide provably better stability than ...

Wireless Sensor Networks are a research area of growing importance within the Wireless Networks research community. One of the major issues in this area is the search for efficient routing methods. Most of the routing algorithms developed so far are limited to single-sink scenarios with no or limited mobility. This paper presents a new routing approach, ODEUR (Opportunistic relative DistanceEna...

Most current flow routing algorithms use digital elevation models (DEMs) to construct flow models. In order to successfully use current techniques for flow routing, they flood local minima and then find a way of routing the flow across the flat surfaces. In this paper, we examine an alternative method for computing flow routing on these flooded surfaces that takes into account the original elev...

Themain challengein wireless sensor network is to improve the fault tolerance of each node and also provide an energy efficient fast data routing service. In this paper we propose an energyefficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant multipath routing scheme for energy efficientwireless sensor network (FTMRS).The FTMRSis based on multipath ...

We present a new routing methodology that focuses on the hierarchical structure of a control time scale. The key concept of this study is to simultaneously implement both multiple routing protocols: OSPF routing (shortest-path) and MLB routing (multi-path). By considering the difference in their control time scales, we construct a new routing scheme that deals with sudden changes in network con...

We probabilistically model dynamic packet routing on unbuuered 2-D and 3-D toroidal networks. We consider shortest-path routing with packet loss and retrans-missions versus a newly proposed all-link busy (ALB) hot-potato routing strategy with packet deeections. Computations of the sustained packet generating rate, node throughput, and average packet latency indicate that the proposed ALB strate...

In computer networks the routing is based on shortest path routing algorithms. Based on its advantages, an alternative method is used known as Genetic Algorithm based routing algorithm, which is highly scalable and insensitive to variations in network topology. Here we propose a coarse-grained parallel genetic algorithm to solve the shortest path routing problem with the primary goal of computa...