File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: PERFORMANCE ANALYSIS OF NETWORKS WITH UNRELIABLE COMPONENTS.

TitlePERFORMANCE ANALYSIS OF NETWORKS WITH UNRELIABLE COMPONENTS.
Authors
Issue Date1984
Citation
Ieee Transactions On Communications, 1984, v. COM-32 n. 10, p. 1105-1110 How to Cite?
AbstractIn evaluating the performance of a communication network with unreliable components, researchers have traditionally approached the problem by enumerating all possible states of the system. Since the number of states of a communication network with n failure-prone components is 2**n, these methods are restricted to small systems. A new solution technique that is not doomed by the 'state-space explosion' problem is presented. Instead of enumerating all possible fail states, we consider only the most probable states. Since the network operates in these states most of the time, we can get upper and lower bounds and, hence, a good approximation of the network performance without having to analyze all possible states.
Persistent Identifierhttp://hdl.handle.net/10722/154837
ISSN

 

DC FieldValueLanguage
dc.contributor.authorLi, Victor OKen_US
dc.contributor.authorSilvester, John Aen_US
dc.date.accessioned2012-08-08T08:30:52Z-
dc.date.available2012-08-08T08:30:52Z-
dc.date.issued1984en_US
dc.identifier.citationIeee Transactions On Communications, 1984, v. COM-32 n. 10, p. 1105-1110en_US
dc.identifier.issn0096-1965en_US
dc.identifier.urihttp://hdl.handle.net/10722/154837-
dc.description.abstractIn evaluating the performance of a communication network with unreliable components, researchers have traditionally approached the problem by enumerating all possible states of the system. Since the number of states of a communication network with n failure-prone components is 2**n, these methods are restricted to small systems. A new solution technique that is not doomed by the 'state-space explosion' problem is presented. Instead of enumerating all possible fail states, we consider only the most probable states. Since the network operates in these states most of the time, we can get upper and lower bounds and, hence, a good approximation of the network performance without having to analyze all possible states.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Communicationsen_US
dc.titlePERFORMANCE ANALYSIS OF NETWORKS WITH UNRELIABLE COMPONENTS.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-0021515396en_US
dc.identifier.volumeCOM-32en_US
dc.identifier.issue10en_US
dc.identifier.spage1105en_US
dc.identifier.epage1110en_US
dc.identifier.scopusauthoridLi, Victor OK=7202621685en_US
dc.identifier.scopusauthoridSilvester, John A=7006743573en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats