臺灣人文及社會科學引文索引資料庫系統

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：資料再傳輸機制下電腦網路的網路可靠度評估
作者：潘志理
作者(外文)：Chih-Li - Pan
校院名稱：國立臺灣科技大學
系所名稱：管理研究所
指導教授：林義貴
學位類別：博士
出版日期：2016
主題關鍵詞：隨機流量電腦網路；網路可靠度；多路徑傳輸控制協定；具再傳輸機制的隨機電腦網路；封包錯誤率；資料傳輸時間；Stochastic-flow computer network；Network reliability；Multipath transmission control protocol (MPTCP)；Stochastic computer network with retransmission；packet error rate (PER)；data latency.
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:129
電腦系統可視為是一個由傳輸邊與資料中心構成的網路拓樸，由於各條傳輸邊會因為失效、部分失效及維修保養等因素而讓頻寬呈現隨機狀態，因此真實世界的網路可被視為具再傳輸機制的隨機電腦網路，且實際網路的運作須要有一種資料再傳輸的機制來維持資料傳輸品質，資料再傳輸機制可以避免在資料傳送中的資料錯誤。封包錯誤率以及資料傳輸時間是評估網路服務品質績效指標的關鍵因素。此篇研究著重於評估在一具再傳輸機制的隨機電腦網路中，資料在可允許的延遲時間內資料可成功傳輸的網路可靠度;其中網路可靠度的定義為可滿足上述需求之機率。本論文針對具再傳輸機制的隨機電腦網路的傳輸路徑特性，對於下列三種情況進行探討: (i) 單一傳輸路徑之網路可靠度, (ii) 各傳輸路徑上 之各傳輸邊具相同封包錯誤率多條傳輸路徑之網路可靠度, (iii) 各傳輸路徑上之各傳輸邊可具不同封包錯誤率多條傳輸路徑之網路可靠度。 從網路管理之觀點，網路可靠度可作為評估網路系統之重要績效指標。
本論文提出演算法計算在具傳輸機制的隨機電腦網路的不同傳輸路徑狀況下，各傳輸邊為滿足需求而所需提供的最低邊界值。網路可靠度即可經由這些最低邊界值計算求解。最後，本論文透過兩個實際案例:中國教育學術網路以及泛歐教育學術網路來呈現不同具再傳輸機制的隨機電腦網路中網路可靠度之評估。本論文所提出的演算法，在範例中計算電腦網路可靠度所需時間皆在0.2秒內，具有實務的應用性。
Computer systems can be constructed as a network topology with arcs (transmission media) and nodes (data centers). Because there are conditions such as failure, partial failure, and maintenance, arc’s capacity should be considered as stochastic. In order to sustain data quality, a data retransmission mechanism is necessary in practical computer networks. Such a mechanism can avoid data error during transmission procedure. Packet error rate and data latency are critical factors to assess the quality of service over the Internet. Therefore this study focuses on a stochastic computer network to evaluate network reliability that the data can be transmitted successfully with a retransmission mechanism under permitted latency. In which, the network reliability is defined as the probability of request criteria satisfaction. Three types of SCNRM are addressed to evaluate the network reliability in this dissertation: (i) Network reliability evaluation for an SCNRM with a single data transmission path, (ii) Network reliability evaluation for an SCNRM with multiple data transmission path that the PER of each arc is identical, and (iii) Network reliability evaluation for an SCNRM with multiple data transmission path that the PER of each arc can be different. From network management point of view, the network reliability is a key performance indicator of computer network evaluation.
For each type of SCNRM, different model is constructed to generate all lower boundary points satisfying requirements. Then, network reliability can be computed in terms of such boundary points accordingly. Two practical cases, the China Education and Research Network, the Pan-European Research and Education Network, are demonstrated to illustrate the procedure of network reliability evaluation and decision making for each type of SCNRM. In numerical experiments, the CPU time of the proposed algorithm to evaluate the network reliability were less than 0.2sec makes it practical for application.
Aven, T. (1985), “Reliability evaluation of multistate systems with multistate components,” IEEE Transactions on Reliability, R-34, 473-479.
Carrigy, A., Ramirez-Marquez, J.E., and Rocco, C. M. (2010), “Multistate stochastic network interdiction via reliability modelling and evolutionary optimization,” Proc. Inst Mech. Eng. Part O-J. Risk Reliability, 224, 1, 27-42.
Chen, G. H. and Hung, Y. C. (1993), “On the quickest path problem,” Information Processing Letters, 46, 125-128.
Chen, G. H. and Hung, Y. C. (1994), “Algorithms for the constrained quickest path problem and the enumeration of quickest paths,” Computers and Operations Research, 21, 113-118.
Chen, Y. L. (1993), “An algorithm for finding the k quickest paths in a network,” Computers and Operations Research, 20, 59-65.
Chen, Y. L. (1994), “Finding the k quickest simples paths in a network,” Information Processing Letters, 50, 89-92.
Chen, Y. L. and Tang, K. (1998), “Minimum time paths in a network with mixed time constraints,” Computers and Operations Research, 25, 793-805.
Chen, Y. L. and Chin, Y. H. (1990), “The quickest path problem,” Computers and Operations Research, 17, 153-161.
Dasgupta, M. and Biswas, G. P.(2012), “Design of multi-path data routing algorithm based on network reliability,” Computers and Electrical Engineering, 20, 6, 1433-1443.
Ford, A., Raiciu, C., Handley, M., Barre, S., and Iyengar, J. (2011), “Architectural Guidelines for Multipath TCP Development,” IETF, RFC 6182.
Ford, A., Raiciu, C., Handley, M., and Bonaventure, O. (2013), “TCP Extensions for Multipath Operation with Multiple Addresses,” IETF, RFC 6824.
Foukalas, F. T., Karetsos, G. T. and Merakos, L. (2012), “Spectral efficiency of cognitive radio networks under interference constraint and QoS guarantees,” Computers and Electrical Engineering, 38, 3, 591-602.
Grinnemo, K. and Brunstrom, A. (2015), “A first study on using MPTCP to reduce latency for cloud based mobile applications,” IEEE Symposium on computers and communication, 64-69.
Huang, C. F. and Lin, Y. K. (2014), “A Stochastic node-failure network with individual tolerable error rate at multiple sinks,” International Journal of System Science. 45, 5, 935–946.
Jane, C. C., Lin, J. S. and Yuan, J. (1993), “On reliability evaluation of a limited-flow network in terms of minimal cutsets,” IEEE Transactions on Reliability, 42, 354-361.
Kurose, J. F. and Ross, K. W. (2013), “Computer Networking-A Top down Approach Featuring the Internet,” Addison-Wesley Press, 230-238.
Lawniczak, A. T. and Xie, S. (2010), “Impact of source load and routing on QoS of packets delivery,” Journal of Computational Science, 1, 2, 121-129.
Lee, D. T. and Papadopoulou, E. (1993), “The all-pairs quickest path problem,” Information Processing Letters, 45, 261-267.
Levitin, G. and Lisnianski, A. (2001), “A new approach to solving problems of multi-state system reliability optimization,” Quality and Reliability Engineering International, 17, 93-104.
Lin, J. S., Jane, C. C. and Yuan, J. (1995), “On reliability evaluation of a capacitated-flow network in terms of minimal pathsets,” Network, 25, 131-138.
Lin, Y. K. (2001), “A simple algorithm for reliability evaluation of a stochastic-flow network with node failure,” Computers and Operations Research, 28, 1277-1285.
Lin, Y. K. (2003), “Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network,“ Computers and Operations Research, 30, 567-575
Lin, Y. K. (2009), “Optimal routing policy of a stochastic-flow network,” Comput. Ind. Eng., 56, 4, 1414-1418.
Lin, Y. K., (2010) “The stochastic quickest path problem via minimal paths,” Journal of the Chinese Institute of Industrial Engineers, 27, 2, 132-139.
Lin, Y. K., (2011) “Network reliability of a time-based multistate network under spare routing with p minimal paths,” IEEE Transactions on Reliability, 60, 61-69.
Lin, Y. K. and Chang, P. C (2011) “Maintenance reliability estimation for a cloud computing network with nodes failure,” Expert System with Applications, 38, 11, 14185-14189.
Lin, Y. K. and Huang, C. F. (2013), “Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints,” International Journal of Computer Mathematics, 90, 3, 457-474.
Lin, Y. K. and Huang, C. F (2013), “Delivery reliability of computer networks for data transmission within the permitted packet error rate and latency.” Computers and Electrical Engineering, 39, 7, 2161-2172.
Lin, Y. K. and Huang, C. F. (2014), “Reliability assessment of a stochastic node-failure network with multiple sinks under tolerable error rate”, International Journal of Computer Mathematics, 91, 5, 819-833.
Lin, Y. K. and Huang, C. F. (2016), “Reliability of a multi-state computer network through k minimal paths within tolerance error rate and time threshold”. Quality and Reliability Engineering International 32, 4, 1393-1405.
Lin, Y. K. and Yeh, C. T. (2011), “Computer network reliability optimization under double-resource assignments subject to a transmission budget,” Information Sciences. 181, 3, 582–599.
Martins, E. D. Q. V. and Santos, J. L. E. D. (1997), “An algorithm for the quickest path problem,” Operations Research Letters, 20, 195-198.
Park, C. K., Lee, S. and Park, S. (2004), “A label-setting algorithm for finding a quickest path,” Computers and Operations Research, 31, 2405-2418.
Pascoal, M. M. B., Captivo, M. E. V. and Climaco, J. C. N. (2005), “An algorithm for ranking quickest simple paths,” Computers and Operations Research, 32, 509-520.
Rocco, C. M., Ramirez-Marquez, J. E., Salazar, D. E., and Hernandez, I. (2010), “Implementation of multi-objective optimization for vulnerability analysis of complex networks,” Proc. Inst. Mech. Eng. Part O-J. Risk Reliability, 224, 2, 87-95.
Postel, J. (1981), “Transmission Control Protocol,” IETF, RFC 793.
Ramirez-Marquez, J. E. and Coit, D. W. (2007), “Multi-state component criticality analysis for reliability improvement in multi-state systems Reliability,” Reliability Engineering & System Safety, 92, 1608-1619.
Sharf, M. and Ford, A. (2013), “Multipath TCP (MPTCP) Application Interface Considerations,” IETF, RFC 6897.
Watcharastthiwat, K and Wardkein, P. (2009), “Reliability optimization of topology communication network design using an improved ant colony optimization,” Computers and Electrical Engineering, 35, 5, 730-747.
Xue, J. (1985), “On multistate system analysis,” IEEE Transactions on Reliability, R-34, 329-337.
Yarlagadda, R. and Hershey, J. (1991), “Fast algorithm for computing the reliability of communication network,” International Journal of Electronics, 70, 549–564.
Yeh, W. C. (1998), “A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network,” IEEE Transactions on Reliability, 47, 436-442.
Yeh, W. C. (2005), “A new approach to evaluating reliability of multistate networks under the cost constraint,” Omega, 33, 203-209.
Yeh, W. C. (2008), “A simple minimum path method for estimating the weighted multi-commodity multistate unreliable networks reliability,” Reliability Engineering& System Safety, 93, 125-136.
Zuo, M.J., Tian, Z. and Huang, H. Z., (2007) “An efficient method for reliability evaluation of multistate networks given all minimal path vector”, IIE Transactions, 39, 8, 811-817.
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

臺灣人文及社會科學引文索引資料庫

目前上線人數：392（臺灣：387，外國：5） ／ 本年度總使用人次：1430120 ／ 訪客人次（自102年09月）：67239239
國家圖書館著作權聲明 Copyright © 2013 All rights reserved.
本館地址: 100201臺北市中山南路20號． 本館地圖及交通資訊．
總機：(02)23619132．最佳瀏覽解析度為1024x768以上