WirelessHART, an international standard of wireless industrial networks, adopted the concept of graph routing to meet the requirements of short latency and high reliability. However, WirelessHART networks also require...
详细信息
Power Line Communication (PLC) is gaining increased attention because it only relies on the existing widespread power line facilities without additional wiring to transmit data. However, the current power line network...
详细信息
Recently, the first oligopolistic competition model of the closed-loop supply chain network involving uncertain demand and return has been established. This model belongs to the context of oligopolistic firms that com...
详细信息
Recently, the first oligopolistic competition model of the closed-loop supply chain network involving uncertain demand and return has been established. This model belongs to the context of oligopolistic firms that compete noncooperatively in a Cournot-Nash framework. In this paper, we modify the above model in two different directions. (i) For each returned product from demand market to firm in the reverse logistics, we calculate the percentage of its optimal product flows in each individual path connecting the demand market to the firm. This modification provides the optimal product flow routings for each product in the supply chain and increases the optimal profit of each firm at the Cournot-Nash equilibrium. (ii) Our model extends the method of finding the Cournot-Nash equilibrium involving smooth objective functions to problems involving nondifferentiable objective functions. This modification caters for more real-life applications as a lot of supply chain problems involve nonsmooth functions. Existence of the Cournot-Nash equilibrium is established without the assumption of differentiability of the given functions. Intelligent algorithms, such as the particle swarm optimization algorithm and the genetic algorithm, are applied to find the Cournot-Nash equilibrium for such nonsmooth problems. Numerical examples are solved to illustrate the efficiency of these algorithms.
Current routing devices route an individual car driver from start to destination in the shortest time. In this paper we propose a routing algorithm, routing the whole population of car drivers in the shortest time. Th...
详细信息
In order to save energy consumption and prolong lifetime of the network, the dissertation presents a new routing algorithm named LEACH-LMT (LEACH-Level Multi-hop Transmission) based on LEACH (Low-Energy Adaptive Clust...
详细信息
Hybrid wireless networks combining the advantages of both mobile ad-hoc networks and infrastructure wireless networks have been receiving increased attention due to their ultra-high performance. An efficient data rout...
详细信息
This paper proposes an inter-domain routing algorithm based on statistics of interdomain routing history information. Simulation results show that it has much better performance in terms blocking probability than some...
详细信息
Networks on chips (NoCs) have become a promising candidate for communication in future many-core architectures. However, manufacturing defects and aging effects are expected to cause permanent errors in future technol...
详细信息
Networks on chips (NoCs) have become a promising candidate for communication in future many-core architectures. However, manufacturing defects and aging effects are expected to cause permanent errors in future technology nodes, which are targeted by NoC-based architectures. Consequently, fault tolerance concepts are necessary in order to deal with these permanent errors. In this work, we propose a novel approach for fault tolerance in NoC-based architectures. We introduce an additional network layer to take over the duties of defective routers. In contrast to existing approaches, the proposed concept is independent of the routing algorithm and can substitute the bandwidth of defective routers. In addition, we show the potential of the concept for power saving. An ASIC implementation of the proposed design is used for performance and power saving evaluation as well as for overhead analysis.
Optical networks have been introduced to meet the bandwidth requirement of mega data centers (DC). Most existing approaches are neither scalable to face the massive growth of DCs, nor contention-free enough to provide...
详细信息
Optical networks have been introduced to meet the bandwidth requirement of mega data centers (DC). Most existing approaches are neither scalable to face the massive growth of DCs, nor contention-free enough to provide full bisection bandwidth. To solve this problem, we propose two symmetric network structures: ring-MEMS-ring (RMR) network and MEMS-ring-MEMS (MRM) network based on classical Clos theory. New strategies are introduced to overcome the additional wavelength constraints that did not exist in the traditional Clos network. Two structures that followed the strategies can enable high scalability and nonblocking property simultaneously. The one-to-one correspondence of the RMR and MRM structures to a Clos is verified and the nonblocking conditions are given along with the routing algorithms. Compared to a typical folded-Clos network, both structures are more readily scalable to future mega data centers with 51200 racks while reducing number of long cables significantly. We show that the MRM network is more cost-effective than the RMR network, since the MRM network does not need tunable lasers to achieve nonblocking routing. (C) 2015 Optical Society of America
Network rOle-based routing Intelligent Algorithm is a novel routing algorithm for wireless sensor networks, which combine various effective techniques in order to reduce energy consumption and improve data routes. Thi...
详细信息
Network rOle-based routing Intelligent Algorithm is a novel routing algorithm for wireless sensor networks, which combine various effective techniques in order to reduce energy consumption and improve data routes. This algorithm uses role assignment for distributing tasks over the network nodes and fuzzy logic for making decisions. There is a clear need for the use of formal methods to validate the correctness of the protocols as well as performance and functionality prior to the deployment of such algorithms in a real environment. This paper presents a formal and rigorous study of Network rOle-based routing Intelligent Algorithm. Prioritised-timed coloured petri nets (PTCPNs) have been chosen as an appropriate modelling language. In this way, PTCPNs have been used to describe complete and unambiguous specifications of system behaviour, whereas CPNTools is used to evaluate the correctness of the protocol using state space exploration and for performance evaluation using simulation. Copyright (c) 2015 John Wiley & Sons, Ltd.
暂无评论