Baili Zhang1, Keke Ling1,*, Pei Zhang2,3, Zhao Zhang2,3, Mingjun Zhong4
Computer Systems Science and Engineering, Vol.41, No.2, pp. 699-715, 2022, DOI:10.32604/csse.2022.020193
Abstract Calculating the most reliable maximum flow (MRMF) from the edge cache node to the requesting node can provide an important reference for selecting the best edge cache node in a content delivery network (CDN). However, SDBA, as the current state-of-the-art MRMF algorithm, is too complex to meet real-time computing needs. This paper proposes a set of MRMF algorithms: NWCD (Negative Weight Community Deletion), SCPDAT (Single-Cycle Preference Deletion Approximation algorithm with Time constraint) and SCPDAP (Single-Cycle Preference Deletion Approximation algorithm with Probability constraint). NWCD draws on the “flow-shifting” algorithm of minimum cost and maximum flow, and further defines the concept of… More >
Login
Register
