Placement and routing method for analogue layout generation using modified cuckoo optimisation algorithm

2018 ◽  
Vol 12 (5) ◽  
pp. 532-541
Author(s):  
Seyed Mahmoud Anisheh ◽  
Hossein Shamsi
Keyword(s):  
Optimisation Algorithm ◽  
Layout Generation ◽  
Placement And Routing ◽  
Routing Method

A Fuzzy Routing Method in UAV Delay Tolerant Networks

2012 ◽  
Vol E95.B (9) ◽  
pp. 2769-2773 ◽  
Author(s):  
Xuanya LI ◽  
Linlin CI ◽  
Wenbing JIN
Keyword(s):  
Delay Tolerant Networks ◽  
Routing Method ◽  
Delay Tolerant

scholarly journals Reliability-Aware Multipath Routing of Time-Triggered Traffic in Time-Sensitive Networks

Electronics ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 125
Author(s):  
Kai Huang ◽  
Xinming Wan ◽  
Ke Wang ◽  
Xiaowen Jiang ◽  
Junjian Chen ◽  
...  
Keyword(s):  
Fault Tolerance ◽  
High Reliability ◽  
Multipath Routing ◽  
Shortest Path Routing ◽  
Industrial Networks ◽  
Negative Effect ◽  
Routing Method ◽  
No Wait ◽  
Spatial Redundancy ◽  
Unreliable Links

With the development of industrial networks, the demands for strict timing requirements and high reliability in transmission become more essential, which promote the establishment of a Time-Sensitive Network (TSN). TSN is a set of standards with the intention of extending Ethernet for safety-critical and real-time applications. In general, frame replication is used to achieve fault-tolerance, while the increased load has a negative effect on the schedule synthesis phase. It is necessary to consider schedulability and reliability jointly. In this paper, a heuristic-based routing method is proposed to achieve fault tolerance by spatial redundancy for TSNs containing unreliable links. A cost function is presented to evaluate each routing set, and a heuristic algorithm is applied to find the solution with higher schedulability. Compared to the shortest path routing, our method can improve the reliability and the success rate of no-wait scheduling by 5–15% depending on the scale of topology.

scholarly journals Toward Decentralised Sanitary Sewage Collection Systems: A Multiobjective Approach for Cost-Effective and Resilient Designs

Water ◽  
2021 ◽  
Vol 13 (14) ◽  
pp. 1886
Author(s):  
Arezoo Zahediasl ◽  
Amin E. Bakhshipour ◽  
Ulrich Dittmer ◽  
Ali Haghighi
Keyword(s):  
Treatment Plant ◽  
Drainage System ◽  
Cost Effective ◽  
Optimization Approach ◽  
Hydraulic Design ◽  
Multiobjective Approach ◽  
Layout Generation ◽  
Plant Allocation ◽  
Problem Solving Process

In recent years, the concept of a centralized drainage system that connect an entire city to one single treatment plant is increasingly being questioned in terms of the costs, reliability, and environmental impacts. This study introduces an optimization approach based on decentralization in order to develop a cost-effective and sustainable sewage collection system. For this purpose, a new algorithm based on the growing spanning tree algorithm is developed for decentralized layout generation and treatment plant allocation. The trade-off between construction and operation costs, resilience, and the degree of centralization is a multiobjective problem that consists of two subproblems: the layout of the networks and the hydraulic design. The innovative characteristics of the proposed framework are that layout and hydraulic designs are solved simultaneously, three objectives are optimized together, and the entire problem solving process is self-adaptive. The model is then applied to a real case study. The results show that finding an optimum degree of centralization could reduce not only the network’s costs by 17.3%, but could also increase its structural resilience significantly compared to fully centralized networks.

scholarly journals Analysis of Nonlinear Bypass Route Computation for Wired and Wireless Network Cooperation Recovery System

2018 ◽  
Vol 2 (3) ◽  
pp. 28 ◽  
Author(s):  
Yu Nakayama ◽  
Kazuki Maruta
Keyword(s):  
Programming Problem ◽  
Wireless Network ◽  
Resource Sharing ◽  
Computation Method ◽  
Integer Programming Problem ◽  
Binary Integer Programming ◽  
Telecommunication Services ◽  
Network Cooperation ◽  
Wireless Links ◽  
Routing Method

It is a significant issue for network carriers to immediately restore telecommunication services when a disaster occurs. A wired and wireless network cooperation (NeCo) system was proposed to address this problem. The goal of the NeCo system is quick and high-throughput recovery of telecommunication services in the disaster area using single-hop wireless links backhauled by wired networks. It establishes wireless bypass routes between widely deployed leaf nodes to relay packets to and from dead nodes whose normal wired communication channels are disrupted. In the previous study, the optimal routes for wireless links were calculated to maximize the expected physical layer throughput by solving a binary integer programming problem. However, the routing method did not consider throughput reduction caused by sharing of wireless resources among dead nodes. Therefore, this paper proposes a nonlinear bypass route computation method considering the wireless resource sharing among dead nodes for the NeCo system. Monte Carlo base approach is applied since the nonlinear programming problem is difficult to solve. The performance of the proposed routing method is evaluated with computer simulations and it was confirmed that bandwidth division loss can be avoided with the proposed method.

Sign in / Sign up

Export Citation Format

Share Document