Show simple item record

dc.contributor.authorZhang, Baili
dc.contributor.authorLing, Keke
dc.contributor.authorZhang, Pei
dc.contributor.authorZhang, Zhao
dc.contributor.authorZhong, Mingjun
dc.date.accessioned2021-12-07T14:00:00Z
dc.date.available2021-12-07T14:00:00Z
dc.date.issued2022-01-01
dc.identifier.citationZhang , 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.020193en
dc.identifier.issn0267-6192
dc.identifier.otherPURE: 209763385
dc.identifier.otherPURE UUID: 04dd92f8-4419-49f1-8ce5-64aabca04794
dc.identifier.otherScopus: 85119015453
dc.identifier.otherORCID: /0000-0002-1525-1270/work/104426114
dc.identifier.urihttps://hdl.handle.net/2164/17634
dc.descriptionFunding 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.format.extent17
dc.language.isoeng
dc.relation.ispartofComputer Systems Science and Engineeringen
dc.rightsThis work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited https://creativecommons.org/licenses/by/4.0/en
dc.subjectContent delivery networken
dc.subjectFlow reliabilityen
dc.subjectMaximum flowen
dc.subjectUncertain graphen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectControl and Systems Engineeringen
dc.subjectTheoretical Computer Scienceen
dc.subjectComputer Science(all)en
dc.subject.lccQA75en
dc.titleAlgorithms to calculate the most reliable maximum flow in content delivery networken
dc.typeJournal articleen
dc.contributor.institutionUniversity of Aberdeen.Computing Scienceen
dc.description.statusPeer revieweden
dc.description.versionPublisher PDFen
dc.identifier.doihttps://doi.org/10.32604/csse.2022.020193
dc.identifier.urlhttp://www.scopus.com/inward/record.url?scp=85119015453&partnerID=8YFLogxKen
dc.identifier.vol41en
dc.identifier.iss2en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record