A Two-Stage Fault Tolerance Method for Large-Scale Manufacturing Network

Nowadays, networked manufacturing paradigm, such as cloud manufacturing, has brought new challenges for fault tolerance methods. Failures and errors of manufacturing services are unavoidable in the large-scale network. Appropriate fault tolerance methods need to be adopted to improve the reliability...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2019, Vol.7, p.81574-81592
Main Authors: Wu, Yinan, Peng, Gongzhuang, Wang, Hongwei, Zhang, Heming
Format: Article
Language:English
Subjects:
A search
Fault tolerance
Fault tolerant systems
Heuristic algorithms
Manufacturing
manufacturing network
Network reliability
nodal importance ranking
Search algorithms
Task analysis
Web services
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Nowadays, networked manufacturing paradigm, such as cloud manufacturing, has brought new challenges for fault tolerance methods. Failures and errors of manufacturing services are unavoidable in the large-scale network. Appropriate fault tolerance methods need to be adopted to improve the reliability of the whole manufacturing network. Aiming at solving this problem, a two-stage fault tolerance method is, thus, proposed. In the off-line stage, a LeaderRank-based manufacturing nodes ranking (LNR) algorithm is put forward to rank the manufacturing services according to their significance in fault tolerance. Replication strategies are employed only for critical services to achieve the tradeoff between fault tolerance effect and fault tolerance loss. In the online stage, an A*-based heuristic alternative path searching (AHPS) algorithm is proposed to find suitable replacement schemes for composite services. The experimental results illustrate that the two-stage fault tolerance method can improve the reliability of large-scale manufacturing networks both effectively and efficiently.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2019.2923660