کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
567859 | 1452082 | 2013 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A New Technique for Generating Minimal Cut Sets in Nontrivial Network
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزار
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Network reliability analysis problem is the center of many scientific productions. It consists of evaluating the all-terminal reliability of networks. Two classes have emerged; exact and approximate methods. The aim of this paper is to present an efficient exact method for enumerating minimal cuts (MCS) of R-networks. The algorithm proceeds by determining minimal paths set (MPS) and from which minimal cuts are generated by managing binary decision diagrams. The manipulation process consists of a series of transformations, reductions and filtering operations. The approach succeeds in the reduction of computation time and memory space and was applied for evaluating the reliability of a national radio communication network.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: AASRI Procedia - Volume 5, 2013, Pages 67-76
Journal: AASRI Procedia - Volume 5, 2013, Pages 67-76