In the pursuit for ever-increasing compute power, and with Moore’s law slowly coming to an end, highperformance computing started to scale-out to larger systems. Alongside the increasing system size, the interconnection network is growing to accommodate and connect tens of thousands of compute nodes. These networks have a large influence on total cost, application performance, energy consumptio...

This paper proposed and evaluates a QOS routing policy in packets topology and irregular traffic of communications network called K-shortest Widest paths Q-Routing. The technique used for the evaluation signals of reinforcement is Q-learning. Compared to standard Q-Routing, the exploration of paths is limited to K best non loop paths in term of hops number (number of routers in a path) leading ...

Flow-based routing algorithms have recently been proposed where the online routing process uses a priori knowledge of the ingress-egress pairs and an estimation of the traffic profile to reduce LSP rejection in MPLS networks. This paper presents a new routing scheme referred to as Least Interference Optimization (LIO) where the online routing process uses the current bandwidth availability and ...

Subarea Tree Routing (STR), a new routing protocol for multi-hop wireless ad hoc networks, is proposed. The novelty of the STR protocol is to divide the whole network into many subareas constructed as a result of establishing subarea trees. Its main idea is to identify root nodes by manual configuration or auto-discovery process firstly, then the root nodes originate the process of establishing...

Because of several constraints in ad hoc networks, an adaptive ad hoc routing protocol is increasingly required. In this paper, we propose a synopsis of an adaptation process for an adaptive ad hoc routing protocol. Next, we put into practice the analysis of the process of adaptation to mobility by realizing an adaptive routing protocol: CSR (Cluster Source Routing) which is an extension of a w...

the shapley value, one of the most common solution concepts of cooperative game theory is defined and axiomatically characterized in different game-theoretic models. certainly, the shapley value can be used in interesting sharing cost/reward problems in the operations research area such as connection, routing, scheduling, production and inventory situations. in this paper, we focus on the shapl...

This paper presents cell formation (CF) problem in dynamic condition with multiple alternative process plans and a set of alternative routes for each of process plans. Previous models paid attention to just one of the terms of process plans and routes and also they have not reflected the notion of defect rate after operations. Therefore, this paper also addresses defect rate. The proposed model...

In this paper, we propose a deadlock-free routing in irregular networks using pre x routing. Pre x routing is a special type of routing with a compact routing table associated with each node (processor). Basically, each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a pre x of the label of the destination node. Node and channel labelin...