On designing a reconfigurable fault-tolerant pyramid tree network architecture

Author(s):  
M. Mohsin ◽  
B. Gupta
Author(s):  
Syed Masud Mahmud

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.


Author(s):  
Chakib Nehnouh ◽  
Mohamed Senouci

To provide correct data transmission and to handle the communication requirements, the routing algorithm should find a new path to steer packets from the source to the destination in a faulty network. Many solutions have been proposed to overcome faults in network-on-chips (NoCs). This article introduces a new fault-tolerant routing algorithm, to tolerate permanent and transient faults in NoCs. This solution called DINRA can satisfy simultaneously congestion avoidance and fault tolerance. In this work, a novel approach inspired by Catnap is proposed for NoCs using local and global congestion detection mechanisms with a hierarchical sub-network architecture. The evaluation (on reliability, latency and throughput) shows the effectiveness of this approach to improve the NoC performances compared to state of art. In addition, with the test module and fault register integrated in the basic architecture, the routers are able to detect faults dynamically and re-route packets to fault-free and congestion-free zones.


1987 ◽  
Vol C-36 (5) ◽  
pp. 619-623 ◽  
Author(s):  
Sengupta ◽  
Sen ◽  
Bandyopadhyay

2014 ◽  
Vol 5 (1) ◽  
pp. 20-45 ◽  
Author(s):  
Sharad Sharma ◽  
Shakti Kumar ◽  
Brahmjit Singh

Wireless Mesh Networks (WMNs) are emerging as evolutionary self organizing networks to provide connectivity to end users. Efficient Routing in WMNs is a highly challenging problem due to existence of stochastically changing network environments. Routing strategies must be dynamically adaptive and evolve in a decentralized, self organizing and fault tolerant way to meet the needs of this changing environment inherent in WMNs. Conventional routing paradigms establishing exact shortest path between a source-terminal node pair perform poorly under the constraints imposed by dynamic network conditions. In this paper, the authors propose an optimal routing approach inspired by the foraging behavior of ants to maximize the network performance while optimizing the network resource utilization. The proposed AntMeshNet algorithm is based upon Ant Colony Optimization (ACO) algorithm; exploiting the foraging behavior of simple biological ants. The paper proposes an Integrated Link Cost (ILC) measure used as link distance between two adjacent nodes. ILC takes into account throughput, delay, jitter of the link and residual energy of the node. Since the relationship between input and output parameters is highly non-linear, fuzzy logic was used to evaluate ILC based upon four inputs. This fuzzy system consists of 81 rules. Routing tables are continuously updated after a predefined interval or after a change in network architecture is detected. This takes care of dynamic environment of WMNs. A large number of trials were conducted for each model. The results have been compared with Adhoc On-demand Distance Vector (AODV) algorithm. The results are found to be far superior to those obtained by AODV algorithm for the same WMN.


Sign in / Sign up

Export Citation Format

Share Document