scholarly journals Adaptive and fault-tolerant routing algorithms for high performance 2D torus interconnection network

1992 ◽  
Vol 23 (1) ◽  
pp. 3-15 ◽  
Author(s):  
Ting-Wei Hou ◽  
S.R. Tsai ◽  
L.M. Tseng
Author(s):  
Abderezak Touzene ◽  
Khaled Day

We obtain the conditional fault-diameter of the square torus interconnection network under the condition of forbidden faulty sets (i.e. assuming that each non-faulty processor has at least one non-faulty neighbor). We show that under this condition, the square torus, whose connectivity is 4, can tolerate up to 5 faulty nodes without becoming disconnected. The conditional node connectivity is, therefore, 6. We also show that the conditional fault-diameter of the square torus is equal to the fault-free diameter plus two. With this result the torus joins a group of interconnection networks (including the hypercube and the star-graph) whose conditional fault-diameter has been shown to be only two units over the fault-free diameter. Two fault-tolerant routing algorithms are discussed based on the proposed vertex disjoint paths construction.  


Topology of the of interconnection network is one of the most important considerations in the design of parallel systems as it is the backbone network over which the different components of the computer communicate with each other. The properties of the topology such as connectivity, reliability, cost, fault tolerance, diameter and bisection width determine the flawless-less data transmission between the source and the sink nodes. In this paper, we propose a new hybrid interconnection network topology called TOR-CUBE (TC) which is a product of two classical popular interconnection topologies namely hypercube and torus. Further, we show the construction and characteristics of the proposed interconnection topology. We also presented some basic important properties and formulated two routing algorithms for TC. Our results show that the proposed interconnection topology has high connectivity, lesser diameter, low cost, fault tolerant, scalable and low average distance. The different reliability measures of TC are computed and found to be better as compared with its counterpart topologies and the parent topologies.


Sensors ◽  
2021 ◽  
Vol 21 (10) ◽  
pp. 3315
Author(s):  
Aida-Ștefania Manole ◽  
Radu-Ioan Ciobanu ◽  
Ciprian Dobre ◽  
Raluca Purnichescu-Purtan

Constant Internet connectivity has become a necessity in our lives. Hence, music festival organizers allocate part of their budget for temporary Wi-Fi equipment in order to sustain the high network traffic generated in such a small geographical area, but this naturally leads to high costs that need to be decreased. Thus, in this paper, we propose a solution that can help offload some of that traffic to an opportunistic network created with the attendees’ smartphones, therefore minimizing the costs of the temporary network infrastructure. Using a music festival-based mobility model that we propose and analyze, we introduce two routing algorithms which can enable end-to-end message delivery between participants. The key factors for high performance are social metrics and limiting the number of message copies at any given time. We show that the proposed solutions are able to offer high delivery rates and low delivery delays for various scenarios at a music festival.


1998 ◽  
Vol 44 (11) ◽  
pp. 849-866
Author(s):  
Douglas H. Summerville ◽  
José G. Delgado-Frias ◽  
Stamatis Vassiliadis

Sign in / Sign up

Export Citation Format

Share Document