- Title
- Redundant paths and reliability bounds in gamma networks
- Creator
- Gunawan, Indra
- Date
- 2008
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/60614
- Identifier
- vital:6105
- Identifier
-
https://doi.org/10.1016/j.apm.2007.01.003
- Identifier
- ISSN:0307-904x
- Abstract
- Multistage Interconnection Networks (MINs) are network systems providing fast and efficient communications at a reasonable cost. A gamma network is a specific class of MINs, which provides redundant paths in the system. In a gamma network, information from source nodes is transmitted through a specific set of routes to destination nodes. Reliability of an MIN is used as a measure of system’s ability to transform information from input to output devices. Due to the complexity of network configuration and availability of redundant paths, reliability bounds to estimate the exact reliability of a gamma network is proposed. A numerical example of an 8 × 8 gamma network is presented to demonstrate the accuracy of the reliability bounds. When the lower bound reliability provides sufficient assurance that the system will be operational at some specified time and closely approximates the exact reliability, then no further effort for obtaining the exact reliability expression is necessary.
- Relation
- Applied Mathematical modelling Vol. 32, no. (2008 2008), p. 588-594
- Rights
- Copyright Elsevier
- Rights
- This metadata is freely available under a CCO license
- Subject
- Gamma; Interconnection; Multistage; Network; Reliability; Stages; Switching elements; 0102 Applied Mathematics
- Reviewed
- Hits: 874
- Visitors: 872
- Downloads: 0