Abstract
The weighted multicommodity multistate unreliable network (WMMUN) is a novel network composed of multistate unreliable components (arcs and nodes) capable of transmitting different types of commodities in which capacity weight varies with components. It is an extension of the multistate network. The current method for evaluating the directed WMMUN reliability has been derived from minimal cut (MC) based algorithm. The existing best-known method needed extensive comparison and verification, and failed to find the real directed WMMUN reliability. A very simple algorithm based on minimal paths (MPs) is developed for the WMMUN reliability problem. The correctness and computational complexity of the proposed algorithm will be analyzed and proven. An example is given to illustrate how the WMMUN reliability is evaluated using the proposed algorithm. The relationships among all different versions of MPs are also clarified.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
