本文關(guān)鍵詞： 多值決策圖 網(wǎng)絡(luò)可靠度 不可靠節(jié)點(diǎn) 不可靠邊　出處：《計(jì)算機(jī)科學(xué)》2016年01期 　論文類型：期刊論文

【摘要】：節(jié)點(diǎn)或邊不可靠網(wǎng)絡(luò)的可靠度分析問(wèn)題是NP-hard問(wèn)題,網(wǎng)絡(luò)節(jié)點(diǎn)和邊都不可靠的假設(shè)更接近現(xiàn)實(shí)�；诰W(wǎng)絡(luò)節(jié)點(diǎn)和邊二元狀態(tài)的假設(shè),構(gòu)建了節(jié)點(diǎn)和邊不可靠網(wǎng)絡(luò)的形式化模型,給出了分析節(jié)點(diǎn)和邊不可靠網(wǎng)絡(luò)可靠度的NEF_MDD算法。該算法將單個(gè)節(jié)點(diǎn)與其未訪問(wèn)鄰接邊劃分為一個(gè)集合,通過(guò)枚舉節(jié)點(diǎn)和邊的不同組合,合并導(dǎo)致子網(wǎng)同構(gòu)的冗余狀態(tài),獲得簡(jiǎn)化后的狀態(tài)向量和可靠度向量,并用一個(gè)多值決策圖變量來(lái)表述。通過(guò)使用自定義的MDD操作算子,構(gòu)建整個(gè)網(wǎng)絡(luò)的MDD,遍歷MDD節(jié)點(diǎn),計(jì)算網(wǎng)絡(luò)的可靠度。與二元決策圖方法相比,該方法能夠降低決策圖層數(shù)和節(jié)點(diǎn)規(guī)模,有助于節(jié)點(diǎn)和邊不可靠網(wǎng)絡(luò)的可靠度分析。
[Abstract]:The reliability analysis problem of nodes or edge unreliable networks is a NP-hard problem. The assumption that both nodes and edges are unreliable is closer to reality, and it is based on the assumption of network nodes and edge binary states. The formal model of node and edge unreliable network is constructed. The NEF_MDD algorithm for analyzing the reliability of nodes and edge unreliable networks is presented. The algorithm divides a single node and its unvisited adjacent edges into a set and enumerates different combinations of nodes and edges. The redundant state of subnet isomorphism is combined to obtain the simplified state vector and reliability vector, and to express them with a multi-valued decision graph variable. By using the custom MDD operator. The MDD of the whole network is constructed, the MDD nodes are traversed, and the reliability of the network is calculated. Compared with the binary decision graph method, this method can reduce the number of decision layers and the scale of nodes. It is helpful to the reliability analysis of node and edge unreliable networks.
【作者單位】： 桂林電子科技大學(xué)廣西可信軟件重點(diǎn)實(shí)驗(yàn)室;
【基金】：國(guó)家自然科學(xué)基金(61363070) 廣西可信軟件重點(diǎn)實(shí)驗(yàn)室資助課題(kx201401) 廣西高等學(xué)校高水平創(chuàng)新團(tuán)隊(duì)及卓越學(xué)者計(jì)劃 桂林電子科技大學(xué)創(chuàng)新團(tuán)隊(duì)資助
【分類號(hào)】：TP393.02
【正文快照】： 行不交化處理求解網(wǎng)絡(luò)的可靠度。文獻(xiàn)[2,3]需要找出網(wǎng)絡(luò)1　引言的所有最小路徑,這是一個(gè)NP-hard問(wèn)題[2,10]。同時(shí),容斥原網(wǎng)絡(luò)可靠度分析是網(wǎng)絡(luò)設(shè)計(jì)、驗(yàn)證和維護(hù)階段的一個(gè)關(guān)理在擴(kuò)展過(guò)程中會(huì)生成很多相互抵消的項(xiàng),導(dǎo)致冗余計(jì)鍵問(wèn)題,廣泛應(yīng)用于無(wú)線傳感器網(wǎng)絡(luò)、隨機(jī)流網(wǎng)絡(luò)等領(lǐng)

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 周亞萍;吳連元;;計(jì)算一般網(wǎng)絡(luò)可靠度的一個(gè)代數(shù)方法[J];東北重型機(jī)械學(xué)院學(xué)報(bào);1988年04期

2 馮添樂(lè);江永豐;;基于支持向量回歸機(jī)的可靠度預(yù)測(cè)模型[J];計(jì)算機(jī)與數(shù)字工程;2011年02期

3 雷俊牛;孫新利;李振;;基于邊狀態(tài)枚舉計(jì)算多狀態(tài)網(wǎng)絡(luò)可靠度動(dòng)態(tài)界[J];計(jì)算機(jī)科學(xué);2012年08期

4 劉建中;李e，

本文編號(hào)：1445572