scholarly journals Performance Modeling of Fault-Tolerant Circuit-Switched Communication Networks

2006 ◽  
Author(s):  
F. Safaei ◽  
A. Khonsari ◽  
M. Fathy ◽  
N. Alzeidi ◽  
M. Ould-Khaoua
Keyword(s):  
Communication Networks ◽  
Performance Modeling ◽  
Fault Tolerant

In-Vehicle Network Architecture for the Next-Generation Vehicles

2010 ◽  
pp. 283-302 ◽  
Author(s):  
Syed Masud Mahmud
Keyword(s):  
Communication Networks ◽  
Network Architecture ◽  
Fault Tolerant ◽  
Fuel Efficiency ◽  
Simulation Models ◽  
Cost Effective ◽  
Multimedia Systems ◽  
Safety Features ◽  
Vehicle Network

New types of communication networks will be necessary to meet various consumer and regulatory demands as well as satisfy requirements of safety and fuel efficiency. Various functionalities of vehicles will require various types of communication networks and networking protocols. For example, driveby- wire and active safety features will require fault tolerant networks with time-triggered protocols to guarantee deterministic latencies. Multimedia systems will require high-bandwidth networks for video transfer, and body electronics need low-bandwidth networks to keep the cost down. As the size and complexity of the network grows, the ease of integration, maintenance and troubleshooting has become a major challenge. To facilitate integration and troubleshooting of various nodes and networks, it would be desirable that networks of future vehicles should be partitioned, and the partitions should be interconnected by a hierarchical or multi-layer physical network. This book chapter describes a number of ways using which the networks of future vehicles could be designed and implemented in a cost-effective manner. The book chapter also shows how simulation models can be developed to evaluate the performance of various types of in-vehicle network topologies and select the most appropriate topology for given requirements and specifications.

scholarly journals Designing and analyzing highly scalable and reliable of full fledged parallel algorithm for computing strongly connected com-ponents to analyze social graphs

2018 ◽  
Vol 7 (2.12) ◽  
pp. 374
Author(s):  
Dr Lokesh A ◽  
Mr Maria Navin J R ◽  
Mr Balaji K ◽  
Mr Pradeep M
Keyword(s):  
Parallel Algorithm ◽  
Communication Networks ◽  
Programming Model ◽  
Fault Tolerant ◽  
Connected Components ◽  
New Paradigm ◽  
Strongly Connected Components ◽  
Bulk Synchronous Parallel ◽  
Strongly Connected ◽  
Social Graphs

With the recent advent of Big Data, developing efficient distributed algorithms for computing Strongly Connected Components of a large dataset has received increasing interests. For example, social networks, information networks and communication networks such as the communities of people that have formed on those networks, what community a person belongs or finding cyclic de-pendencies in the graph.Apache Giraph is an open-source implementation of Google’s Pregel. It is an iterative and real-time graph processing engine designed to be scalable, fault tolerant and highly efficient. This framework provides an accurate platform for the development of parallel algorithms in a distributed environ-ment. It adopts a vertex-centric programming model inspired by Bulk Synchronous Parallel model. A strongly connected component is a maximal sub graph in which all vertices are reachable from every other vertex. Maximal means that it is the largest possible sub graph. It is not possible to find another vertex anywhere in the graph such that it could be added to the sub graph and all the verti-ces in the sub graph would still be connected. In a directed graph G, a pair of vertices u and v are said to be strongly connected to each other if there is a path in each direction between them. Here, we have implemented a parallel algorithm which is based on the new paradigm of graph decomposi-tion for computing strongly connected components. The final outcome mainly focuses on the reduc-tion of total communication costs. 

Diversity coding for transparent self-healing and fault-tolerant communication networks

1993 ◽  
Vol 41 (11) ◽  
pp. 1677-1686 ◽  
Author(s):  
E. Ayanoglu ◽  
Chih-Lin I ◽  
R.D. Gitlin ◽  
J.E. Mazo
Keyword(s):  
Communication Networks ◽  
Fault Tolerant ◽  
Self Healing ◽  
Diversity Coding

scholarly journals MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks*

2020 ◽  
Vol 174 (3-4) ◽  
pp. 229-258
Author(s):  
Qian Matteo Chen ◽  
Alberto Finzi ◽  
Toni Mancini ◽  
Igor Melatti ◽  
Enrico Tronci
Keyword(s):  
Fault Tolerance ◽  
Communication Networks ◽  
Electromagnetic Interference ◽  
Fault Tolerant ◽  
Relay Node ◽  
Problem Formulation ◽  
Leonardo Da Vinci ◽  
Radio Communication ◽  
Relay Nodes ◽  
Mission Critical

In critical infrastructures like airports, much care has to be devoted in protecting radio communication networks from external electromagnetic interference. Protection of such mission-critical radio communication networks is usually tackled by exploiting radiogoniometers: at least three suitably deployed radiogoniometers, and a gateway gathering information from them, permit to monitor and localise sources of electromagnetic emissions that are not supposed to be present in the monitored area. Typically, radiogoniometers are connected to the gateway through relay nodes. As a result, some degree of fault-tolerance for the network of relay nodes is essential in order to offer a reliable monitoring. On the other hand, deployment of relay nodes is typically quite expensive. As a result, we have two conflicting requirements: minimise costs while guaranteeing a given fault-tolerance. In this paper, we address the problem of computing a deployment for relay nodes that minimises the overall cost while at the same time guaranteeing proper working of the network even when some of the relay nodes (up to a given maximum number) become faulty (fault-tolerance). We show that, by means of a computation-intensive pre-processing on a HPC infrastructure, the above optimisation problem can be encoded as a 0/1 Linear Program, becoming suitable to be approached with standard Artificial Intelligence reasoners like MILP, PB-SAT, and SMT/OMT solvers. Our problem formulation enables us to present experimental results comparing the performance of these three solving technologies on a real case study of a relay node network deployment in areas of the Leonardo da Vinci Airport in Rome, Italy.

Sign in / Sign up

Export Citation Format

Share Document