Algorithms to Calculate the Most Reliable Maximum Flow in Content Delivery Network | Zendy

Baili Zhang | Zendy; Keke Ling | Zendy; Pei Zhang | Zendy; Zhao Zhang | Zendy; Mingjun Zhong | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Algorithms to Calculate the Most Reliable Maximum Flow in Content Delivery Network

Author(s) -

Baili Zhang,

Keke Ling,

Pei Zhang,

Zhao Zhang,

Mingjun Zhong

Publication year - 2021

Publication title -

computer systems science and engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.19

H-Index - 26

ISSN - 0267-6192

DOI - 10.32604/csse.2022.020193

Subject(s) - maximum flow problem , cache , computer science , probabilistic logic , node (physics) , algorithm , pruning , reliability (semiconductor) , mathematical optimization , enhanced data rates for gsm evolution , constraint (computer aided design) , set (abstract data type) , flow network , residual , flow (mathematics) , minimum cost flow problem , mathematics , parallel computing , engineering , artificial intelligence , agronomy , power (physics) , physics , geometry , structural engineering , quantum mechanics , biology , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research