In this paper, a fault-tolerant routing in -D meshes with dynamic faults is provided. It is based on an early work on fault-tolerant routing in dynamic 2-D meshes [9] and 3-D meshes [10] where faults occur during a routing process. Unlike many traditional models that assume all the nodes know global fault information, our approach is based on the concept of limited global fault information. Fir...

We consider an online routing problem in continuous time, where calls have Poisson arrivals and exponential durations. The first-fit dynamic alternative routing algorithm sequentially selects up to d random two-link routes between the two endpoints of a call, via an intermediate node, and assigns the call to the first route with spare capacity on each link, if there is such a route. The balance...

The proposed hybrid stage shop scheduling (HSSS) model, inspired from a real case in the high-fashion industry, aims to fully exploit the potential of parallel resources, splitting and overlapping concurrent operations among teams of multifunctional machines and operators on the same job. The HSSS formally extends mixed shop scheduling (a combination of flowshop and open shop), which is able to...

In geographical ad hoc routing, each node has to be equipped with Global Positioning System (GPS). This requirement is quite realistic today as such devices are inexpensive and can provide reasonable precision. In this work, we are interested in the optimization of the geographical routing protocol, LAR (Location-Aided Routing) [1]. LAR is an on-demand routing protocol using geographical locati...

Network restoration is often done at the electronic layer by rerouting traffic along a redundant path. With Wavelength Division Multiplexing (WDM) as the underlying physical layer, it is possible that both the primary and backup paths traverse the same physical links and would fail simultaneously in the event of a link failure. It is therefore critical that lightpaths are routed in such a way t...

Networks of workstations (NOWs) are becoming increasingly popular as a cost-effective alternative to parallel computers. Typically, these networks connect processors using irregular topologies, providing the wiring flexibility, scalability, and incremental expansion capability required in this environment. In some of these networks [1], packets are delivered using source routing. Due to the irr...

With the aim to improve the quality of service of the modern distributed application, we propose a multi-criteria routing algorithm running in a mesh structured overlay network. Using a grid pattern can improve routing remarkably, since it provides alternative and partly disjunctive paths of equal length as well as the ability to measure distances between nodes in the overlay network. A Thermal...

Multicast is an important collective communication operation on multicomputer systems, in which the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In our previous work on wormhole star graph networks routing, we proposed a path-base...

Network restoration is often done at the electronic layer by rerouting traffic along a redundant path. With Wavelength Division Multiplexing (WDM) as the underlying physical layer, it is possible that both the primary and backup paths traverse the same physical links and would fail simultaneously in the event of a link failure. It is therefore critical that lightpaths are routed in such a way t...

Alternative paths may significantly improve routing reliability in an IP network. One application of this technique is to enhance the reliability of the popular Open Shortest Path First (OSPF) routing protocol. In our proposed Reliable OSPF (ROSPF) routing protocol, one primary path and two alternate backup paths are deployed for data transmission. As expected, the number of shared links and ro...