Skip to main content
Stevens Digital Collections
Home
Browse All
Log in

Help

English
English
EngishPirate
한국어
Search
Advanced Search
Find results with:
error div
Add another field
Search by date
Search by date:
from
after
before
on
from:
to
to:
Searching collections:
The Bailey
Add or remove collections
Home
The Bailey
A coherent model for the reliability of multiprocessor networks
Reference URL
Share
Add tags
Comment
Rate
To link to this object, paste this link in email, IM or document
To embed this object, paste this HTML in website
A coherent model for the reliability of multiprocessor networks
View Description
Download
small (250x250 max)
medium (500x500 max)
Large
Extra Large
large ( > 500x500)
Full Resolution
Print
1.pdf
Description
Rating
Identifier
SITECE.00001
Title
A
coherent
model
for the
reliability
of
multiprocessor
networks
Personal author (1)
Boesch, Francis T.
Personal author (2)
Gross, Daniel
Personal author (3)
Suffel, Charles
Institute affiliation (1)
Stevens Institute of Technology. Dept. of Electrical Engineering and Computer Science
Institute affiliation (2)
Seton Hall University. Dept. of Mathematics and Computer Science
Publication year
1996
Technical report no.
9611
Abstract
There
is
extensive
literature
devoted
to
developing
a
mathematical
reliability
model
which
is
applied
to the
design
of
many
large
networks
. This
model
assumes
that a
graph
G
has
perfectly
reliable
nodes
, but
each
edge
has a
probability
of
operating
. The
reliability
R
is
defined
as the
probability
that there
is
an
operating
connected
spanning
subgraph
.
Analysis
problems
concern
the
determination
of
efficient
algorithms
to
find
R
.
It
is
known
that
calculating
R
is
NP
hard
for
general
graphs
, and that
it
remains
NP
hard
even
when
G
is
a
simple
undirected
planar
graph
and
each
edge
has the
same
probability
.
However
there are
classes
of
graphs
for
which
R
can
be
found
by a
polynomial
algorithm
.
Reliability
synthesis
problems
concern
finding
graphs
that are,
according
to
some
definition
, the
most
reliable
in the
class
of
all
graphs
having
a
given
number
of
edges
and
nodes
. In those
applications
such
as
multiprocessor
networks
where
the
edges
are
perfectly
reliable
but the
nodes
operate
with
known
probabilities
, the
obvious
analog
is
to
define
the
residual
node
reliability
as the
probability
that there
exists
a
spanning
connected
subgraph
on the
operating
nodes
.
However
this
suffers
by not
having
the
property
called
coherence
,
i.e.
,
it
is
possible
that
operating
subnetworks
generated
by
certain
operating
nodes
become
nonoperational
when
the
same
nodes
operate
but
some
additional
nodes
also
operate
.
Two
other
methods
for
treating
node
failures
have been
introduced
.
However
, the
first
of these
is
not a
reliability
model
, and the
second
does
not
handle
the
case
when
all
nodes
are
subject
to
failure
. In this
work
we
propose
a
new
definition
of a
reliability
function
to
handle
the
case
of
node
failures
.
We
show
that
it
is
coherent
, and
we
determine
many
of its
properties
.
Several
analysis
and
synthesis
results
are
presented
.
Tags
Add tags
for A coherent model for the reliability of multiprocessor networks
View as list

View as tag cloud

report abuse
Comments
Post a Comment
for
A coherent model for the reliability of multiprocessor networks
Your rating was saved.
you wish to report:
Your comment:
Your Name:
...
Back to top
Select the collections to add or remove from your search
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
Select All Collections
S
Stute (Hoboken, N.J.)
T
The Bailey
The Frederick Winslow Taylor manuscript collection
500
You have selected:
1
OK
Cancel