以FDDI多媒體網路為例之分散式系統之程式可靠度分析

Abstract

在分散式系統中對於一般網路架構的分散程式可靠度之複雜度是以指數成 長 。於是我們針對特殊的網路架構探討是否有快速的演算法來計算可靠 度。對於環狀此類之網路架構則具有多項式的時間複雜度的演算法。這篇 論文提出了這樣的演算法。除此之外,資料檔可視為各自具有要求時間限 制的檔案。而多媒體的資料亦可視為具有要求時間限制的檔案。故分析多 媒體程式可靠度近似於分析即時程式可靠度。如此針對環狀網路, 限時分 散程式可靠度的計算也於此論文中提出來。 The time complexity of Distributed Program Reliability (DPR) or Time-Constrained DPR (TCDPR) is non-polynomial for the general netwrk topology of Distributed Computing System (DCS). For this reason, this thesis studies specific network topologies . The token-ring network has become important because of its popularity, specially as an FDDI network. This thesis proposes polynomial-time algorithms to compute the DPR and TCDPR for ring networks. Two main algorithms, Distributed Program Reliability for Ring (DPRR) and Distributed Program Reliability for Path (DPRP), are used to compute the DPR . Moreover, data file has its own requirements, such as time- constraints. We can regard multimedia data files as different types of time- constrained data files. Based on such views on the data files, we can compute TCDPR for multimedia data files.