Generally, the inventory routing problem occurs in a supply chain where customers consider the supplier responsible for inventory replenishment. In this situation, the supplier finds the answer to questions regarding the time and quantity of delivery to the customer as well as the sequence of customers in the routes. Considering the effect of production decisions on answering these questions, t...

Routing packets opportunistically is an essential part of multihop ad hoc wireless sensor networks. The existing routing techniques are not adaptive opportunistic. In this paper we have proposed an adaptive opportunistic routing scheme that routes packets opportunistically in order to ensure that packet loss is avoided. Learning and routing are combined in the framework that explores the optima...

This paper develops the theoretical background for the design of deadlock-free adaptive routing algorithms for virtual cut-through and store-and-forward switching. This theory is valid for networks using either central buffers or edge buffers. Some basic definitions and three theorems are proposed, developing conditions to verify that an adaptive algorithm is deadlock-free, even when there are ...

In this paper, we compare the self-adaptive QRouting and dual reinforcement Q-Routing algorithms with the conventional shortest path routing algorithm. The Q-Routing algorithm embeds a learning policy at every node to adapt itself to the changing network conditions, which leads to a synchronised routing information, in order to achieve a shortest delivery time. Unlike Q-Routing, the shortest pa...

Development of a new regular topology for Network on Chip (NoC) is a challenging task, as the proposed design should meet the application specific targets of latency, throughput, area, and energy as well. A suitable routing over newly proposed topology must handle congestion and provide deadlock free transmission. This paper discusses design, implementation of five port regular NoC structure (e...

Network performance can be improved by allowing adaptive routing, but doing so introduces new possibilities of deadlock which can overwhelm the exibility advantages. Planar-adaptive routing (PAR) resolves this tension by limiting adaptive routing to a series of two-dimensional planes, reducing hardware requirements for deadlock prevention. We explore the performance of planar-adaptive routers f...

ÐCut-through switching promises low latency delivery and has been used in new generation switches, especially in high speed networks demanding low communication latency. The interconnection of cut-through switches provides an excellent network platform for high speed local area networks (LANs). For cost and performance reasons, irregular topologies should be supported in such a switch-based net...

This paper describes and evaluates the Conndence-based Dual Reinforcement Q-Routing algorithm (CDRQ-Routing) for adap-tive packet routing in communication networks. CDRQ-Routing is based on an application of the Q-learning framework to network routing, as rst proposed by Littman and Boyan (1993). The main contribution of CDRQ-routing is an increased quantity and an improved quality of explorati...

Location based routing protocols are the kinds of routing protocols, which use of nodes’ location information, instead of links’ information for routing. They are also known as position based routing. In position based routing protocols, it is supposed that the packet source node has position information of itself and its neighbors and packet destination node. In recent years, many location bas...

Fault tolerant routing refers to transfer of messages from a source to destination in a network with faulty links and/or nodes. Fault tolerant routing is one of the key problems in designing robust distributed algorithms. Internet routing protocols like BCG are also examples of adaptive routing algorithms. Adaptive routing in distributed systems can be desirable at either the application level ...