• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

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

Baili ZhangKeke LingPei ZhangZhao ZhangMingjun Zhong
Published in: Comput. Syst. Sci. Eng. (2022)
Keyphrases
  • maximum flow
  • content delivery
  • peer to peer
  • directed graph
  • push relabel
  • learning algorithm
  • communication networks
  • markov chain
  • network traffic
  • minimum cut