Routing is a process of forwarding the data from a known source to the destination. In this process, the data may travel through several intermediate paths, and there exist a need to select the best possible optimal nodes to forward the data. This optimal selection of nodes will enable to achieve a high performance in the network. Large amount of worked has been carried out to find the optimal ...

in the recent decade, special attention is paid to reverse logistic due to economic benefits of recovery and recycling of used products as well as environmental legislation and social concerns. on the other hand، many researches claim that separately and sequential planning of forward and reverse logistic causes sub-optimality. effective transport activities are also one of the most important c...

A shortest-path routing is optimal if it maximizes the probability of reaching the destination from a given source, assuming that each link in the system has a given failure probability. An approximation for the shortest-path routing policy, maximumshortest-path (MSP) routing was proposed by Wu [3]. Reference [3] • shows that MSP is optimal in the mesh and hypercube networks, • shows that MSP i...

In this paper we present lower bounds for compact routing schemes. We give (1) networks on n vertices which for any interval routing scheme, (n) routers of the network require (n) intervals on some outgoing link and (2) for each d 3, networks of maximal degree d which for any interval routing scheme, (n) routers each require (n= logn) intervals on some outgoing link. Our results give the best k...

The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We present two routing schemes for dynamic trees that maintain labels of asymptotically optimal size using extremely low average message complexity (per node). Specifically, we first present a dynamic routing scheme that supports addi...

In this paper we study routing algorithms for one-to-one communication in multi-processors, whose interconnection networks have toroidal structure. A toroidal network is an n-dimensional rectangular mesh with additional edge-to-edge connections. Mathematically speaking, these networks are undirected graphs obtained by cartesian product of cycles. We show, that a broad class of routing algorithm...

WIA-PA is a kind of wireless network for industrial process automation, which has a high requirement for the real-time and reliability of the data transmission. Based on the deficiency of the existing routing protocols, this paper puts forward a new kind of WIA-PA routing protocol MWD. The protocol chooses the stablest link in the routing table as the optimal route, and then based on the node d...

The paper underlines the main advantages and drawbacks of IP routing. Some possibilities for resolving of routing problems are analyzed. A motivation for the use of Soft Computing Technologies (SCT) and Multiple Protocol Label Switching (MPLS) protocol for solving network routing problems is shown. The basic concept of the MPLS networks are described. Some definitions of Soft Computing Agents (...

We study route selection for packet switching in the competitive throughput model. In contrast to previous papers which considered competitive algorithms for packet scheduling, we consider the packet routing problem (output port selection in a node). We model the node routing problem as follows: a node has an arbitrary number of input ports and an arbitrary number of output queues. At each time...