## Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold

- Cheng-Fu Huang, Yi-Kuei Lin, Louis Cheng-Lu Yeng
- Inf. Sci.
- 2016

Highly Influenced

@article{Brecht1988LowerBO, title={Lower bounds on two-terminal network reliability}, author={Timothy B. Brecht and Charles J. Colbourn}, journal={Discrete Applied Mathematics}, year={1988}, volume={21}, pages={185-198} }

- Published 1988 in Discrete Applied Mathematics
DOI:10.1016/0166-218X(88)90065-0

One measure of two-terminal network reliability, termed probabilistic connectedness, is the probability that two specified communication centers can communicate. A standard model of a network is a graph in which nodes represent communications centers and edges represent links between communication centers. Edges are assumed to have statistically independent probabilities of failing and nodes are assumed to be perfectly reliable. Exact calculation of two-terminal reliability for general networks… CONTINUE READING

Highly Cited

This paper has 79 citations. REVIEW CITATIONS

Citations per Year

Semantic Scholar estimates that this publication has **79** citations based on the available data.

See our **FAQ** for additional information.

Showing 1-10 of 45 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential