簡易檢索 / 詳目顯示

研究生: 張天維
Tien-Wei Chang
論文名稱: 以新式通用生成函數來評估網路可靠度之研究
A New Universal Generating Function Methodology for Evaluating Network Reliability
指導教授: 葉維彰
Wei-Chang Yeh
口試委員:
學位類別: 碩士
Master
系所名稱: 工學院 - 工業工程與工程管理學系
Department of Industrial Engineering and Engineering Management
論文出版年: 2007
畢業學年度: 95
語文別: 英文
論文頁數: 67
中文關鍵詞: 網路可靠度通用生成函數接收式網路接收式通用生成函數搜尋法多階二階最小路徑
外文關鍵詞: Network reliability, universal generating function (UGF), receiving network, receiving UGF, search method, multi-state, binary state, minimal path (MP)
相關次數: 點閱:3下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 隨著科技日新月異的進步,所需運算的資訊量也愈來愈龐大與複雜,而資料彼此之間的鏈結關係也相對提高。如此鏈結結構系統可視為一個網路系統,如何評估此網路系統可以正常的運作,可靠度一項很重要的水準指標。長久以來,網路可靠度不管是實務上、理論面均扮演著很重要的角色,相關之研究也是學者們熱烈討論的議題。然而,網路可靠度的評估是一個高度複雜的問題,屬於NP-hard問題。

    在過去,有許多研究學者致力於具有發射式資訊的網路模型中,但卻從未曾以接收式的觀點來研究與探討。因此,本研究提出了新式的網路型態,此網路型態是以接收式資訊的觀念來考量,稱為接收式網路系統,並且建立出相對應的演算法,此演算法是以過去常用來評估多階網路可靠度的通用生成函數為基礎,並針對網路的特性加以改良,此演算法稱為接收式通用生成函數。接收式通用生成函數可以用來評估接收式的多階網路系統之可靠度,亦可用來搜尋二階網路所有的最小路徑。是屬於一種新式的搜尋精確解方法。在實例驗證方面,無向網路與非循環有向網路在本研究中,皆有進行分析與探討。


    With updating development of technology, the more complex and large computing in formation, the closer chain relation. This chain relation can be regarded as a network system. Reliability is an important performance index to evaluate if the network system functions normally. For long time, the network reliability plays a significant role in practical and theoretic. It is also a popular discussed issue between researchers. However, network reliability evaluation is a high complex problem, and belonged to NP-hard problem.

    In the past, many researchers applied their energy on the emanating networks which is based on ascertaining the emanating information. However, it was never discussed with receiving aspect. As a result, we suggested a new type of network in our study. The new type of network called receiving network system is based on receiving information. Furthermore, we build the algorithm for evaluating receiving network reliability according to the network characteristic. This algorithm which is based on the universal generating function (UGF) has been used for evaluating multi-state network reliability is called receiving universal generating function (receiving UGF). Receiving UGF can evaluate the receiving multi-state network reliability and search all minimal paths in binary state network. It is belonged to a new search exact solution method. In this study, we take some examples including acyclic directed and undirected networks for implementing the proposed algorithm.

    中文摘要 i Abstract ii List of Figures v List of Tables vi Chapter 1 Introduction 1 1.1 Background 1 1.2 Motivation 3 1.3 Objectives 5 1.4 Organization of This Article 6 Chapter 2 Literature Review 7 2.1 Binary state network system 7 2.2 Multi-state network system 8 2.3 The universal generating function technique 9 2.4 Summary 10 Chapter 3 Acronyms, nomenclature, notation and assumptions 13 3.1 Acronyms 13 3.2 Nomenclature 14 3.3 Notation 15 3.4 Assumptions 16 Chapter 4 Preliminary 18 4.1 Multi-state system 18 4.2 Multi-state receiving network system description 19 4.3 The emanating universal generating function technique. 22 Chapter 5 Receiving multi-state signal network reliability evaluation 26 5.1 Receiving universal generating function and its properties for receiving MSAN 26 5.2 Receiving multi-state signal acyclic network (Receiving MSAN) reliability evaluation based on a receiving universal generating function algorithm 31 5.3 Receiving universal generating function and its properties for receiving MSUN 32 5.4 Receiving multi-state signal undirected network (Receiving MSUN) reliability evaluation based on a receiving universal generating function algorithm 33 Chapter 6 Illustrative examples for implementing receiving UGF 35 6.1 An example for implementing UGF receiving to evaluation receiving MSAN reliability 35 6.2 Examples for implementing receiving UGF to evaluation receiving MSCN reliability 40 Chapter 7 Other applications 45 7.1 Binary state arc network 45 7.2.1 Find all MPs in acyclic binary state network based on the receiving UGF technique 46 7.2.2 Find all MPs in undirected binary state network based on the receiving UGF technique 47 7.3 Illustrative examples 47 7.3.1 Analysis example for one-to-all acyclic binary-state arc network model 47 7.3.2 One-to-any node acyclic binary-state arc model 47 7.3.3 One-to-many nodes acyclic binary-state arc model 47 7.3.4 Undirected binary-state arc network 47 7.4 A brief summary 47 Chapter 8 Conclusion and Further research 47 8.1 Conclusion 47 8.2 Further research 47 Reference 47

    Reference
    [1] Abraham JA., "An improved method for network reliability", IEEE Transactions on Reliability, 1976, 28(1), pp 58–61
    [2] Allan RN, Billinton R, De Olveira MF., "An efficient algorithm for deducing the minimal cuts and reliability Indices of a General Network Configuration ", IEEE Transactions on Reliability, 1976, 25, pp 226-233.
    [3] Amjed M. Al-Ghanim, "A heuristic technique for generating minimal path and cutsets of a general network", Computers and Industrial Engineering, 1999, 36, pp 45-55
    [4] Aven T., "Availability evaluation of oil/gas production and transportation systems", Reliability Engineering and System Safety, 1987, 18, pp 35–44.
    [5] Aven T., "Some considerations on reliability theory and its applications", Reliability Engineering and System Safety, 1988, 21, pp 215–23.
    [6] Awosope COA, Akinbulare TO., "A computer program for generating power-system load point minimal paths", IEEE Transactions on Reliability, 1991, 40, pp 302–308.
    [7] C.J. Colbourn, "The combinatorics of network reliability", Oxford University Press, New York, 1987
    [8] C.M. Rocco and E. Zio, "Solving advanced network reliability problems by means of cellular automata and Monte Carlo sampling", Reliability Engineering and System Safety, 2005, 89(2), pp 219–226
    [9] D.R. Shier, "Network Reliability and Algebraic Structure", Clarendon Press, Oxford, 1991.
    [10] F.S. Roberts, F.K. Hwang and Clyde Monma, "Reliability of Computer and Communication Networks", DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1991, 5, AMS/ACM publisher
    [11] H. Boudali and J.B. Dugan, "A continuous-time Bayesian network reliability modeling, and analysis framework", IEEE Transactions on Reliability, 2006, 55(1), pp 86–97
    [12] Heidtmann KD., "Smaller sums of disjoin products by sub-product inversion", IEEE Transactions on Reliability, 1989, 38, pp 305–11
    [13] Hwang F, Yao Y., "Multistate consecutively-connected systems", IEEE Transactions on Reliability, 1989, 38, pp 472–474.
    [14] I. Ushakov, "Universal generating function", Journal of Computer and System Sciences, 1986, 24(5), pp. 118–129.
    [15] J. Malinowski and W. Preuss, "Reliability Evaluation for Tree-Structured Systems with Multistate Components", Microelectronics Reliability, 1996, 36, pp 9–17.
    [16] J.M. Nahman, "MPs and cuts or networks exposed to common-cause failures", IEEE Transactions on Reliability, 1992, 41, pp 76–80
    [17] Jasmon GB, Kai OS., "A new technique in minimal path and minimal cutset evaluation", IEEE Transactions on Reliability, 1985, 34, pp 136–143.
    [18] K.S. Sohn, S.Y. Nam, and D.K. Sung, "A spare bandwidth sharing scheme based on network reliability", IEEE Transactions on Reliability, 2005, 54(1), pp. 123–132
    [19] Kossow A, Preuss W., "Reliability of linear consecutively-connected systems with multistate components", IEEE Transactions on Reliability, 1995, 44, pp 518–522.
    [20] Kuo, Lu, Yeh, "Determining terminal-pair reliability based on edge expansion diagram usung OBDD", IEEE Transactions on Reliability, 1999, 48(3), pp 234–246.
    [21] Levitin G, "Reliability Evaluation for Acyclic Consecutively Connected Networks with Multistate Elements", Reliability Engineering and System Safety, 2001, 73, pp 137–143
    [22] Levitin G, "The Universal Generating Function in Reliability Analysis and Optimisation", Springer-Verlag: Berlin, 2005. ISBN: 1-85233-927-6, XVIII, 442 p. 142 illus. Series: Springer Series in Reliability Engineering.
    [23] Levitin G, "Optimal series–parallel topology of multi-state system with two failure modes", Reliability Engineering and System Safety, 2002, 77, pp 93–107
    [24] Levitin G, "Linear multi-state sliding-window systems", IEEE Transactions on Reliability, 2003, 52(2), pp 263–269.
    [25] Levitin G, "Reliability of linear multi-state multiple sliding window systems", Published online 26 January 2005 in Wiley InterScience
    [26] Levitin G., Lisnianski A., "Structure optimization of power system with bridge topology", Electric Power System Research, 1998, 45, pp 201-208
    [27] Levitin G., Lisnianski A., "Joint redundancy and maintenance optimization for multistate series–parallel systems", Reliability Engineering and System Safety, 1999, 64, pp 33–42
    [28] Levitin G., Lisnianski A., "Optimizing survivability of vulnerable series–parallel multi-state", Reliability Engineering and System Safety, 2003, 79, pp 319–331
    [29] Levitin G., Lisnianski A., "Reliability optimization for weighted voting system", Reliability Engineering and System Safety, 2001, 71, pp 131–138
    [30] Levitin G., Lisnianski A., "Importance and sensitivity analysis of multi-state systems using the universal generating function method", Reliability Engineering and System Safety, 1999, 65, pp 271–282
    [31] Levitin G., Lisnianski A., "A new approach to solving problems of multi-state system reliability optimization", Quality and Reliability Engineering International, 2001, 17, pp 93–104
    [32] Lisnianski A., Levitin G., "Multi-state system reliability. Assessment, optimization and applications", World Scientific, 2003
    [33] Locks MO., "Recursive disjoint products: a review of three algorithm", IEEE Transactions on Reliability, 1982, 31(1), pp 33–35.
    [34] M. Marseguerra, E. Zio, L. Podofillini and D.W. Coit, "Optimal design of reliable network systems in presence of uncertainty", IEEE Transactions on Reliability, 2005, 54(2), pp 243–253
    [35] Malinowski J, Preuss W., "Reliability evaluation for tree-structured systems with multistate components", Microelectronics Reliability, 1996, 36, pp 9–17.
    [36] Patvardhan C, Prasad VC, Prem Pyara V., "Vertex cutsets of undirected graphs", IEEE Transactions on Reliability,. 1995, 44(2), pp 347–353.
    [37] R.E. Bryant, "Graph-based algorithms for Boolean function manipulation", IEEE Transactions on Computers, 1986, 35, pp 677–691.
    [38] S. Soh and S. Rai, "An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities", IEEE Transactions on Reliability, 2005, 54(1), pp133–144
    [39] W.J. Ke and S.D. Wang, "Reliability evaluation for distributed computing networks with imperfect nodes", IEEE Transactions on Reliability, 1997, 46, pp 342–349
    [40] Y. Shen, "A new simple algorithm for enumerating all minimal paths and cuts of a graph", Microelectronics Reliability, 1995, 35(6), pp 973–976
    [41] Y.K. Lin, "Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs", Reliability Engineering and System Safety, 2002, 75, pp 41–46.
    [42] Y.K. Lin., "Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts", Reliability Engineering and System Safety, 2006, 91(5), pp 539–545.
    [43] Yeh WC., "Multistate-Node Acyclic Networks Reliability Evaluation Based on MC", Reliability Engineering and System Safety, 2003, 81(2), pp. 225–231.
    [44] Yeh WC., "The k-out-of-n Acyclic Multistate-Node Networks Reliability Evaluation Using the Universal Generating Function Method", Reliability Engineering and System Safety, 2006, 91(7), pp 800–808.
    [45] Yeh WC., "Search for minimal paths in modified networks", Reliability Engineering and System Safety, 2002, 75(3), pp 389–95.
    [46] Yeh WC., "Multistate-node acyclic network reliability evaluation", Reliability Engineering and System Safety, 2002, 78(2), pp 123–9.
    [47] Yeh WC., "An evaluation of the multi-state node networks reliability using the traditional binary-state networks reliability algorithm", Reliability Engineering and System Safety, 2003, 81(1), pp 1–7.
    [48] Yeh WC., "A MCS-RSM approach for the network reliability to minimize the total cost", International Journal of Advanced Manufacturing Technology, 2003, 22, pp 681–688
    [49] Yeh WC., "Search for all MCs in networks with unreliable nodes and arcs", Reliability Engineering and System Safety, 2003, 78(2), pp 95–101.
    [50] Yeh WC., "Search for MC in modified networks", Computers and Operations Research, 2001, 28(2), pp 177–84.
    [51] Yeh WC., "Search for minimal paths in modified networks", Reliability Engineering and System Safety, 2002, 75(3), pp 389–95.
    [52] Yeh WC., "An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths", Reliability Engineering and System Safety, 2007, 92, pp 260–268
    [53] Yeh WC., "Multistate Network Reliability Evaluation under Maintenance Cost Constraint", International Journal of Production Economics, 2004, 88(1), pp 73–83.
    [54] Yeh WC, "A New Approach to Evaluate the Reliability of Multistate Networks under the Cost Constraint", Omega: International Journal of Management Science, 2005, 33(3), pp.203–209.
    [55] Yeh WC., "A Novel Method for the Network Reliability in terms of Capacitated-Minimal-Paths without Knowing Minimal-Paths in Advance", Journal of the operational Research Society, 2005, 56(10), pp 1235-1240.
    [56] Yeh WC., "A Simple Algorithm to Search for All MCs in Networks", European Journal of Operational Research, 2006, 174(3), pp 1694–1705.
    [57] Yeh WC., "A Simple Universal Generating Function Method for Estimating General Multi-state Node Network Reliability",
    [58] Zhao LC, Kong FJ., "A new formula and an algorithm for reliability analysis of networks", Microelectronics Reliability, 1997, 37(3), pp 511–518.
    [59] Zuo M, Liang M., "Reliability of multi-state consecutively-connected systems", Reliability Engineering and System Safety, 1994, 44, pp 173–176.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE