File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Scopus: eid_2-s2.0-0022719112
- WOS: WOS:A1986A995900014
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: IMPROVED ALGORITHM FOR PERFORMANCE ANALYSIS OF NETWORKS WITH UNRELIABLE COMPONENTS.
Title | IMPROVED ALGORITHM FOR PERFORMANCE ANALYSIS OF NETWORKS WITH UNRELIABLE COMPONENTS. |
---|---|
Authors | |
Issue Date | 1986 |
Citation | Ieee Transactions On Communications, 1986, v. COM-34 n. 5, p. 496-497 How to Cite? |
Abstract | Reference is made to the approach for analyzing the performance of communication networks with unreliable components was given by V. D. K. Li and J. A. Silvester (ibid. , vol. COM-32, pp. 1105-1110, Oct 1984). An algorithm was developed to generate the most probable states of a network, and an analysis of those states gave a good approximation of network performance. In this paper, the authors present a new algorithm for generating the most probable states. This algorithm is regarded as a major improvement over the previous one in terms of efficiency and flexibility. |
Persistent Identifier | http://hdl.handle.net/10722/154857 |
ISSN | 2019 SCImago Journal Rankings: 2.126 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lam, YF | en_US |
dc.contributor.author | Li, Victor OK | en_US |
dc.date.accessioned | 2012-08-08T08:30:56Z | - |
dc.date.available | 2012-08-08T08:30:56Z | - |
dc.date.issued | 1986 | en_US |
dc.identifier.citation | Ieee Transactions On Communications, 1986, v. COM-34 n. 5, p. 496-497 | en_US |
dc.identifier.issn | 0096-1965 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/154857 | - |
dc.description.abstract | Reference is made to the approach for analyzing the performance of communication networks with unreliable components was given by V. D. K. Li and J. A. Silvester (ibid. , vol. COM-32, pp. 1105-1110, Oct 1984). An algorithm was developed to generate the most probable states of a network, and an analysis of those states gave a good approximation of network performance. In this paper, the authors present a new algorithm for generating the most probable states. This algorithm is regarded as a major improvement over the previous one in terms of efficiency and flexibility. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | IEEE Transactions on Communications | en_US |
dc.title | IMPROVED ALGORITHM FOR PERFORMANCE ANALYSIS OF NETWORKS WITH UNRELIABLE COMPONENTS. | en_US |
dc.type | Article | en_US |
dc.identifier.email | Li, Victor OK:vli@eee.hku.hk | en_US |
dc.identifier.authority | Li, Victor OK=rp00150 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-0022719112 | en_US |
dc.identifier.volume | COM-34 | en_US |
dc.identifier.issue | 5 | en_US |
dc.identifier.spage | 496 | en_US |
dc.identifier.epage | 497 | en_US |
dc.identifier.isi | WOS:A1986A995900014 | - |
dc.identifier.scopusauthorid | Lam, YF=7202563905 | en_US |
dc.identifier.scopusauthorid | Li, Victor OK=7202621685 | en_US |
dc.identifier.issnl | 0096-1965 | - |