کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
808535 | 905710 | 2006 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A simple algorithm to generate all (d,B)-MCs of a multicommodity stochastic-flow network
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی مکانیک
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A simple algorithm to generate all (d,B)-MCs of a multicommodity stochastic-flow network A simple algorithm to generate all (d,B)-MCs of a multicommodity stochastic-flow network](/preview/png/808535.png)
چکیده انگلیسی
Both minimal paths and minimal cuts are important media to evaluate the performance indexes, the system reliability or unreliability, for a single-commodity stochastic-flow network. This paper concentrates on a multicommodity stochastic-flow network in which each arc has both the capacity and cost attributes. Different from the single-commodity case, the system capacity is a pattern for multicommodity case. Since the traditional performance indexes are not suitable for multicommodity case, we propose a new performance index, the probability that the system capacity is less than or equal to a given pattern under the budget constraint. A simple algorithm based on minimal cuts is presented to generate all (d,B)-MCs that are the maximal capacity vectors meeting the demand d and budget B. The proposed performance index can be evaluated in terms of (d,B)-MCs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Reliability Engineering & System Safety - Volume 91, Issue 8, August 2006, Pages 923-929
Journal: Reliability Engineering & System Safety - Volume 91, Issue 8, August 2006, Pages 923-929
نویسندگان
Yi-Kuei Lin,