File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: PERFORMANCE ANALYSIS OF NETWORKS WITH UNRELIABLE COMPONENTS.

TitlePERFORMANCE ANALYSIS OF NETWORKS WITH UNRELIABLE COMPONENTS.
Authors
Issue Date1983
Citation
Conference Record - International Conference On Communications, 1983, v. 1, p. 493-498 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. We present a new solution technique that is not doomed by the 'state-space explosion' problem. Instead of enumerating all possible fail states, we only consider 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. We illustrate our solution technique by analyzing network reliability, the expected number of communicating pairs and network average delay for some particular networks.
Persistent Identifierhttp://hdl.handle.net/10722/157971
ISSN

 

DC FieldValueLanguage
dc.contributor.authorLi, Victor OKen_US
dc.contributor.authorSilvester, John Aen_US
dc.date.accessioned2012-08-08T08:57:31Z-
dc.date.available2012-08-08T08:57:31Z-
dc.date.issued1983en_US
dc.identifier.citationConference Record - International Conference On Communications, 1983, v. 1, p. 493-498en_US
dc.identifier.issn0536-1486en_US
dc.identifier.urihttp://hdl.handle.net/10722/157971-
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. We present a new solution technique that is not doomed by the 'state-space explosion' problem. Instead of enumerating all possible fail states, we only consider 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. We illustrate our solution technique by analyzing network reliability, the expected number of communicating pairs and network average delay for some particular networks.en_US
dc.languageengen_US
dc.relation.ispartofConference Record - International Conference on Communicationsen_US
dc.titlePERFORMANCE ANALYSIS OF NETWORKS WITH UNRELIABLE COMPONENTS.en_US
dc.typeConference_Paperen_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-0021002438en_US
dc.identifier.volume1en_US
dc.identifier.spage493en_US
dc.identifier.epage498en_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