This paper presents a nonblocking routing algorithm for Beneš networks. Such networks are of potential interest in implementing large scale optical cross-connects, but their complex routing algorithm limits their applications. We use a simple approach to determine the routing tags for a conflict free routing. Available methods proposed in the literature use computationally complex solutions to ...

many appealing multicast services such as on-demand tv, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. when multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. designing a good multicast tree to route data packets could enhance the...

mobile ad hoc networks (manet) are constructed by mobile nodes without access point. since manet has certain constraints, including power shortages, an unstable wireless environment and node mobility, more power-efficient and reliable routing protocols are needed. the olsr protocol is an optimization of the classical link state algorithm. olsr introduces an interesting concept, the multipoint r...

In this study a multicast routing algorithm has been developed for faulty hypercube parallel processing system using cube algebra. Without any restriction to the number of the faulty nodes, the routing from the source node to the destination node is implemented minimally. The developed routing algorithm has been visually simulated via prepared data routing simulator program. It has been observe...

In this paper, we propose a novel algorithm to routing called NRA, in mobile ad hoc networks, that allows the network layer to adjust its routing protocol dynamically based on SNR along the end-to-end routing path for each transmission link. The experimental results are very promising as the proposed algorithm exhibits superior performance with respect to traditional DSR routing algorithm in te...

in this paper, we investigate a decision support system (dss) for the resolution of real-life vehicle routing and scheduling problem (vrsp). scheduling the deliveries from a regional distribution centre (rdc) to large stores of a major fmcg retailer includes every possible vehicle routing complexity. usual constraints that are seen are: size of the vehicle and the length of the driving day, loa...

increasing of the distribution efficiency is one of the most objectives of an integrated logistic system developed as a new management philosophy in the past few decades. the problem is examind in two parts: facilities location problem (flp) for long policies and vehicle routing problem (vrp) to meet the customer demand. these two components can be solved separately; however, this solution may ...

in this paper, a stochastic multi-depot multi-objective vehicle routing problem (vrp) is studied. based on observations in real-world problems, we develop an aspect of the problem, such as stochastic availability of routes. to solve the problem in this situation, a two-objective mathematical model is developed, in which the related objective functions are: (1) minimizing transportation costs an...

A design problem of cross-docking distribution networks is addressed as a new research area in logistics management. This paper presents a new mathematical model for the location of cross-docking facilities and vehicle routing scheduling problems in distribution networks. For this purpose, a two-phase mixed-integer programming (MIP) is formulated. Then, a new heuristic-based simulated annealing...