Algorithms to calculate the most reliable maximum flow in content delivery network
| dc.contributor.author | Zhang, Baili | |
| dc.contributor.author | Ling, Keke | |
| dc.contributor.author | Zhang, Pei | |
| dc.contributor.author | Zhang, Zhao | |
| dc.contributor.author | Zhong, Mingjun | |
| dc.contributor.institution | University of Aberdeen.Computing Science | en |
| dc.contributor.institution | University of Aberdeen.Machine Learning | en |
| dc.date.accessioned | 2021-12-07T14:00:00Z | |
| dc.date.available | 2021-12-07T14:00:00Z | |
| dc.date.issued | 2022-01-01 | |
| dc.description | Funding 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). | en |
| dc.description.status | Peer reviewed | en |
| dc.format.extent | 17 | |
| dc.format.extent | 403166 | |
| dc.identifier | 209763385 | |
| dc.identifier | 04dd92f8-4419-49f1-8ce5-64aabca04794 | |
| dc.identifier | 85119015453 | |
| dc.identifier.citation | Zhang, 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.020193 | en |
| dc.identifier.doi | 10.32604/csse.2022.020193 | |
| dc.identifier.iss | 2 | en |
| dc.identifier.issn | 0267-6192 | |
| dc.identifier.other | ORCID: /0000-0002-1525-1270/work/104426114 | |
| dc.identifier.uri | https://hdl.handle.net/2164/17634 | |
| dc.identifier.url | http://www.scopus.com/inward/record.url?scp=85119015453&partnerID=8YFLogxK | en |
| dc.identifier.vol | 41 | en |
| dc.language.iso | eng | |
| dc.relation.ispartof | Computer Systems Science and Engineering | en |
| dc.subject | Content delivery network | en |
| dc.subject | Flow reliability | en |
| dc.subject | Maximum flow | en |
| dc.subject | Uncertain graph | en |
| dc.subject | QA75 Electronic computers. Computer science | en |
| dc.subject | Control and Systems Engineering | en |
| dc.subject | Theoretical Computer Science | en |
| dc.subject | General Computer Science | en |
| dc.subject.lcc | QA75 | en |
| dc.title | Algorithms to calculate the most reliable maximum flow in content delivery network | en |
| dc.type | Journal article | en |
Files
Original bundle
1 - 1 of 1
- Name:
- Zhang_Algorithims_to_calculate_Computer_Systems_vor.pdf
- Size:
- 393.72 KB
- Format:
- Adobe Portable Document Format
