Many of the calculating systems are made based on a parallel nodes architecture. In these systems, interconnection networks play a main role. Because the number of nodes is thousands, the probability of failure is high. So, developing fault-tolerant mechanisms is essential. In this paper a new fault-tolerant routing algorithm, which is based on deterministic methods, is introduced for a two dim...

In this paper we consider the problem of creating minimal, deadlock-free routing algorithms, where a routing algorithm is said to be minimal if it uses only shortest paths. In particular, we examine the possibility of creating scalable algorithms that use only a constant number of buuers per node. Minimal, scalable, deadlock-free routing algorithms are known for many important networks includin...

In this paper, we propose a new mathematical model for Capacitated Inventory Routing Problem (CIRP), which considers freshly delivery of perishable products to the customers’ location; otherwise, a reduction in products’ demand may occur. Therefore, we attempt to plan delivering process of products at the right time to avoid extra inventory causing increase in age of products. This ...

Optical network uses a tool for routing called Latin router. These routers use particular algorithms for routing. For example, we can refer to LDF algorithm that uses backtracking (one of CSP methods) for problem solving. In this paper, we proposed new approached for completion routing table (DRA&CRA algorithm) and compare with pervious proposed ways and showed numbers of backtracking, blocking...

In this paper, we study the routing problem for the undirected binary de Bruijn interconnection network. Researchers have never proposed a shortest path routing algorithm on the undirected binary de Bruijn network. We first propose a shortest path routing algorithm, whose time complexity in the binary de Bruijn network of 2 nodes is O(m2). Then, based on our shortest path routing algorithm, we ...

An integrated model considers all parameters and elements of different deficiencies in one problem. This paper presents a new integrated model of a supply chain that simultaneously considers facility location, vehicle routing and inventory control problems as well as their interactions in one problem, called location-routing-inventory (LRI) problem. This model also considers stochastic demands ...

The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...

Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-r...

Elastic Optical Networks (EONs) are a promising optical technology to deal with the ever-increasing traffic and vast number of connected devices next generation Internet, associated paradigms like Internet Things (IoT), Tactile or Industry 4.0, name just few. In this kind network, each circuit lightpath is provisioned by means superchannels variable bandwidth. manner, only necessary bandwidth a...

most of the QoS routing mechanisms involve periodic exchange of global state information which causes communication overheads. Therefore, localized routing is the method to avoid this problem. The network in this technique is inferred by the source nodes using statistics which are collected locally. This paper presents new localized algorithm Highest Minimum Bandwidth routing algorithm (HMB). T...