A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
FAULT TOLERANT RING EMBEDDING IN TETRAVALENT CAYLEY NETWORK GRAPHS

1996
*
Journal of Circuits, Systems and Computers
*

Our purpose in the present paper is to investigate the structural properties

doi:10.1142/s0218126696000352
fatcat:lj727lnkqbg7nmwrkrffatytsa
*of*the newly proposed Cayley*networks**of*constant*node*degree 4. ... We show that the graph contains rings*of*maximal length in presence*of*multiple*faults*. Our results provide further evidence to the usefulness and robustness*of*these*network*graphs. ... All Cayley graphs are*regular*, but*almost*none*of*the Cayley graphs studied so far offer constant*node*degree (where*node*degree does not change*with*size or dimension*of*the*network*). ...##
###
A Partial Irregular-Network Routing on Faulty k-ary n-cubes

2006
*
Automated Software Engineering, IEEE International Conference
*

The

doi:10.1109/iwias.2006.23
fatcat:5nxqmbk3nbhgbi66klzg76hrbe
*network*is logically divided into the*fault*and*regular*regions. ... As the*number**of*faulty links increases to up to 8 on 256*nodes*, its throughput is only decreased by 15%. ... To*tolerate*a hard failure on links or routers. a large*number**of**fault*-*tolerant*routings have been studied on*regular*topologies, such as k-array n-cubes. ...##
###
TIONets: triangular interconnection of optical networks

2002
*
IEEE Communications Letters
*

In this letter we propose a multihop

doi:10.1109/4234.984703
fatcat:jpalsqwek5c7hhpoxuxsywvkyy
*network*called TIONet or Triangular Interconnection*of*optical*networks*. The graph is examined from routing and scaling approaches. ... Index Terms-Multihop*networks*. ... Extending the same approach*of*taking*an*average*of*the summation*of**number**of**nodes*covered in each new hop for*an**arbitrary*source*node*to reach every other*node*in the*network*, the average hop distance ...##
###
Fault Tolerance of Small-World Regular and Stochastic Interconnection Networks
[article]

2014
*
arXiv
*
pre-print

It is shown that in the broad range

arXiv:1312.0510v2
fatcat:fhy2h7zus5fcpoci3mospng7ae
*of*values*of*the fraction*of*faulty*nodes*the*networks*under consideration possess high*fault**tolerance*, the deterministic*networks*being slightly better than the stochastic ... Resilience*of*the most important properties*of*stochastic and*regular*(deterministic) small-world interconnection*networks*is studied. ... Therefore the*fault**tolerance**of*such*networks*is*an*important issue. ...##
###
Page 5959 of Mathematical Reviews Vol. , Issue 94j
[page]

1994
*
Mathematical Reviews
*

We present

*an*efficient distributed algorithm*with**an*O(N) message and time complexity, where N is the*number**of**nodes*in the*network*. ... “We design*an**almost*optimal, strongly adaptive algorithm on mesh-connected*networks**of**arbitrary*dimension. ...##
###
A new family of Cayley graph interconnection networks of constant degree four

1996
*
IEEE Transactions on Parallel and Distributed Systems
*

We propose a new family

doi:10.1109/71.481595
fatcat:opsvzhmflvcgfivqprkpns6ph4
*of*interconnection*networks*that are Cayley graphs*with*constant*node*degree 4. These graphs are*regular*, have logarithmic diameter and are maximally*fault**tolerant*. ... We investigate different algebraic properties*of*these*networks*(including*fault**tolerance*) and propose optimal routing algorithms. ... The graph has a diameter logarithmic in the*number**of**nodes*, are*regular*and dense, and is maximally*fault**tolerant*. ...##
###
Research on Topology Structure Analysis of Several Interconnection Networks

2016
*
DEStech Transactions on Computer Science and Engineering
*

There are many indicators to evaluate the performance

doi:10.12783/dtcse/cmsam2016/3594
fatcat:it2hj4vnqjcuvhghtweaxgtyrm
*of**an*interconnection*network*, this paper introduces the basic methods and principles*of**an*interconnection*network*, and analyzes the characteristics ... In this paper, it is proved that the routing selection*of*some graphs can achieve the minimum*fault**tolerance*. ... The*fault**tolerance**of*the*network*is that the*network*can allow the*number**of*points and (or) the connection malfunction at the same time, the rest*nodes*in the sub*network*can still maintain communication ...##
###
A Network Coding Based Energy Efficient Data Backup in Survivability-Heterogeneous Sensor Networks

2015
*
IEEE Transactions on Mobile Computing
*

The guidelines are based on random linear

doi:10.1109/tmc.2014.2374168
fatcat:k3u2xtuotnbq7kde33zmo3hl2q
*network*coding and provide lower bounds*of*the*number**of*robust sensors that each*regular*sensor should choose for data backup, such that the required*fault**tolerance*... Sensor*nodes*deployed outdoors are subject to environmental detriments and often need to cache data for*an*extended period*of*time. ... As k → ∞, the probability*of*the existence*of*a perfect matching approaches 1. Since generally a sensor*network*is composed*of*a large*number**of**regular*sensors, the probability is*almost*100%. ...##
###
Page 1905 of Mathematical Reviews Vol. , Issue 97C
[page]

1997
*
Mathematical Reviews
*

We develop a

*fault**tolerant*routing algorithm which can compute a minimal path between two*arbitrary**nodes*in*an*IEH graph in the presence*of*the maximum*number**of*allowable*faults*. ... Moreover, for any given*number**of**nodes*, the difference*of*the maximum and the minimum degree*of*a*node*in the graph is < 1; ie., the graph is*almost**regular*. ...##
###
Fault Tolerance in Networks of Bounded Degree

1988
*
SIAM journal on computing (Print)
*

We believe that in forseeable technologies the

doi:10.1137/0217061
fatcat:vsghupe7mzfnvdkv347nxe6ixu
*number**of**faults*will grow*with*the size*of*the*network*while the degree will remain practically fixed. ... among themselves undisturbed by the (*arbitrary*) behavior*of*the faulty*nodes*. ... Combinatorial characterization*of**fault*-*tolerant**networks*. ...##
###
Immunet

2004
*
SIGARCH Computer Architecture News
*

As long as the

doi:10.1145/1028176.1006718
fatcat:4kjhryd36recxflvy7qmaylxry
*network*remains connected, Immunet can*tolerate*any*number**of*failures regardless*of*their spatial and temporal combinations. ... Immunet has four important advantages over previous*fault*-*tolerant*switching mechanisms. Its low hardware costs minimize the overhead that the*network*must support in absence*of**faults*. ... Although our*fault*-*tolerant*routing can be used in*arbitrary*topologies, we will focus our attention in this paper on analyzing its application to*regular**networks*. ...##
###
On some super fault-tolerant Hamiltonian graphs

2004
*
Applied Mathematics and Computation
*

A super

doi:10.1016/s0096-3003(02)00933-5
fatcat:yyjcdvvrbbctfohdntgrron4ay
*fault*-*tolerant*Hamiltonian graph has a certain optimal flavor*with*respect to the*fault*-*tolerant*Hamiltonicity and Hamiltonian connectivity. ... A k-*regular*Hamiltonian and Hamiltonian connected graph G is super*fault*-*tolerant*Hamiltonian if G remains Hamiltonian after removing at most k À 2*nodes*and/or edges and remains Hamiltonian connected ... Acknowledgements This work was supported in part by the National Science Council*of*the Republic*of*China under Contract NSC 90-2213-E-009-149. ...##
###
Distributed fault detection of wireless sensor networks

2006
*
Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks - DIWANS '06
*

*Faults*occurring to sensor

*nodes*are common due to the sensor device itself and the harsh environment where the sensor

*nodes*are deployed. ...

*Faults*occurring to sensor

*nodes*are common due to the sensor device itself and the harsh environment where the sensor

*nodes*are deployed. ... This cross-validation-based technique can be applied to a broad set

*of*

*fault*models. It is generic and can be applied to

*an*

*arbitrary*system

*of*sensors that use

*an*

*arbitrary*type

*of*data fusion. ...

##
###
Correlated Set Coordination in Fault Tolerant Message Logging Protocols
[chapter]

2011
*
Lecture Notes in Computer Science
*

One

doi:10.1007/978-3-642-23397-5_6
fatcat:epuntl54ffdz3df4a3sgwi4fd4
*of*the most scalable checkpoint restart techniques, the message logging approach, is the most challenged when the*number**of*cores per*node*increases, due to the high overhead*of*saving the message ... Based on our current expectation for the exascale systems, composed*of*hundred*of*thousands*of*many-core*nodes*, the mean time between failures will become small, even under the most optimistic assumptions ... The emission and reception dates*of*messages are beyond the control*of*the*fault**tolerant*algorithm: one could delay the emission or reception dates to match some*arbitrary*ordering*with*checkpoint events ...##
###
Embedding cycles in IEH graphs

1997
*
Information Processing Letters
*

We also find

doi:10.1016/s0020-0190(97)00147-6
fatcat:ave7zue7u5arnoc2wxf4zyr6ga
*an**arbitrary*cycle*of*odd length NO where 2 < NO < N if and only if a*node**of*this graph has at least one forward 2-Inter-Cube (IC) edges. ... Next, we show that for*an*IEH graph*of*size N,*an**arbitrary*cycle*of*even length N, where 3 < Ne < N is found. ... This topology can be defined for*an**arbitrary**number**of**nodes*and still preserves several advantages such as optimal*fault**tolerance*, a low diameter, a simple routing algorithm, and*almost**regularity*. ...
« Previous

*Showing results 1 — 15 out of 6,821 results*