Delivery reliability of computer networks for data transmission within the permitted packet error rate and latency
暂无分享,去创建一个
[1] Paramote Wardkein,et al. Reliability optimization of topology communication network design using an improved ant colony optimization , 2009, Comput. Electr. Eng..
[2] Y. L. Chen,et al. Finding the k Quickset Simple Paths in a Network , 1994, Inf. Process. Lett..
[3] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[4] Wei-Chang Yeh,et al. A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability , 2008, Reliab. Eng. Syst. Saf..
[5] G. P. Biswas,et al. Design of multi-path data routing algorithm based on network reliability , 2012, Comput. Electr. Eng..
[6] Gen-Huey Chen,et al. Algorithms for the constrained quickest path problem and the enumeration of quickest paths , 1994, Comput. Oper. Res..
[7] Yi-Kuei Lin,et al. On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint , 2007, Eur. J. Oper. Res..
[8] D. T. Lee,et al. The All-Pairs Quickest Path Problem , 1993, Inf. Process. Lett..
[9] Anja Feldmann,et al. Deriving traffic demands for operational IP networks: methodology and experience , 2001, TNET.
[10] Gen-Huey Chen,et al. On the Quickest Path Problem , 1990, Inf. Process. Lett..
[11] Gen-Huey Chen,et al. Distributed algorithms for the quickest path problem , 1992, Parallel Comput..
[12] Yen-Liang Chen,et al. An algorithm for finding the k quickest paths in a network , 1993, Comput. Oper. Res..
[13] Yi-Kuei Lin,et al. System Reliability Evaluation for a Multistate Supply Chain Network With Failure Nodes Using Minimal Paths , 2009, IEEE Trans. Reliab..
[14] Wei-Chang Yeh,et al. A Sequential Decomposition Method for Estimating Flow in a Multi-Commodity, Multistate Network , 2011, IEEE Transactions on Reliability.
[15] João C. N. Clímaco,et al. Internet packet routing: Application of a K , 2007, Eur. J. Oper. Res..
[16] Yi-Kuei Lin,et al. Network Reliability of a Time-Based Multistate Network Under Spare Routing With $p$ Minimal Paths , 2011, IEEE Transactions on Reliability.
[17] Fotis Foukalas,et al. Spectral efficiency of cognitive radio networks under interference constraint and QoS guarantees , 2012, Comput. Electr. Eng..
[18] Hong-Zhong Huang,et al. An efficient method for reliability evaluation of multistate networks given all minimal path vectors , 2007 .
[19] Yi-Kuei Lin. Time version of the shortest path problem in a stochastic-flow network , 2009 .
[20] Yen-Liang Chen,et al. Minimum time paths in a network with mixed time constraints , 1998, Comput. Oper. Res..
[21] Chin-Chia Jane,et al. Computing Multi-State Two-Terminal Reliability Through Critical Arc States That Interrupt Demand , 2010, IEEE Transactions on Reliability.
[22] Y. H. Chin,et al. The quickest path problem , 1990, Comput. Oper. Res..