File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: RELIABILITY MODELING AND ANALYSIS OF COMMUNICATION NETWORKS WITH DEPENDENT FAILURES.

TitleRELIABILITY MODELING AND ANALYSIS OF COMMUNICATION NETWORKS WITH DEPENDENT FAILURES.
Authors
Lam, YFLi, Victor OK
Issue Date1986
Citation
Ieee Transactions On Communications, 1986, v. COM-34 n. 1, p. 82-84 How to Cite?
AbstractA new model is represented for studying the reliability of communication networks in which link failures are statistically dependent. The approach tries to identify and model explicitly the events that cause communication link failures. No conditional probabilities are needed, and so two major difficulties inherent in them, namely, an exponential number of conditional probabilities to deal with and a consistency requirement to satisfy, are avoided. For reliability computations, some existing algorithms for finding network reliability can be used with minor modifications and no significant increase in computational complexity.
Persistent Identifierhttp://hdl.handle.net/10722/154852
ISSN
0096-1965
2019 SCImago Journal Rankings: 2.126
ISI Accession Number ID
WOS:A1986AXQ5700013

 

DC FieldValueLanguage
dc.contributor.authorLam, YFen_US
dc.contributor.authorLi, Victor OKen_US
dc.date.accessioned2012-08-08T08:30:55Z-
dc.date.available2012-08-08T08:30:55Z-
dc.date.issued1986en_US
dc.identifier.citationIeee Transactions On Communications, 1986, v. COM-34 n. 1, p. 82-84en_US
dc.identifier.issn0096-1965en_US
dc.identifier.urihttp://hdl.handle.net/10722/154852-
dc.description.abstractA new model is represented for studying the reliability of communication networks in which link failures are statistically dependent. The approach tries to identify and model explicitly the events that cause communication link failures. No conditional probabilities are needed, and so two major difficulties inherent in them, namely, an exponential number of conditional probabilities to deal with and a consistency requirement to satisfy, are avoided. For reliability computations, some existing algorithms for finding network reliability can be used with minor modifications and no significant increase in computational complexity.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Communicationsen_US
dc.titleRELIABILITY MODELING AND ANALYSIS OF COMMUNICATION NETWORKS WITH DEPENDENT FAILURES.en_US
dc.typeArticleen_US
dc.identifier.emailLi, Victor OK:vli@eee.hku.hken_US
dc.identifier.authorityLi, Victor OK=rp00150en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0022489012en_US
dc.identifier.volumeCOM-34en_US
dc.identifier.issue1en_US
dc.identifier.spage82en_US
dc.identifier.epage84en_US
dc.identifier.isiWOS:A1986AXQ5700013-
dc.identifier.scopusauthoridLam, YF=7202563905en_US
dc.identifier.scopusauthoridLi, Victor OK=7202621685en_US
dc.identifier.issnl0096-1965-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats