Zhang, BailiLing, KekeZhang, PeiZhang, ZhaoZhong, Mingjun2021-12-072021-12-072022-01-01Zhang, B, Ling, K, Zhang, P, Zhang, Z & Zhong, M 2022, 'Algorithms to calculate the most reliable maximum flow in content delivery network', Computer Systems Science and Engineering, vol. 41, no. 2, pp. 699-715. https://doi.org/10.32604/csse.2022.0201930267-6192ORCID: /0000-0002-1525-1270/work/104426114https://hdl.handle.net/2164/17634Funding Information: Funding Statement: This work was partly supported by Open Research Fund from State Key Laboratory of Smart Grid Protection and Control, China (Zhang B, www.byqsc.net/com/nrjt/), Rapid Support Project (61406190120, Zhang B), the Fundamental Research Funds for the Central Universities (2242021k10011, Zhang B, www.seu.edu.cn) and the National Key R&D Program of China (2018YFC0830200, Zhang B, www.most.gov.cn).17403166engContent delivery networkFlow reliabilityMaximum flowUncertain graphQA75 Electronic computers. Computer scienceControl and Systems EngineeringTheoretical Computer ScienceGeneral Computer ScienceQA75Journal article10.32604/csse.2022.020193http://www.scopus.com/inward/record.url?scp=85119015453&partnerID=8YFLogxK412