PATH CALCULATION METHOD AND APPARATUS BASED ON CONTENT DISTRIBUTION NETWORK

The present application discloses a path calculation method and apparatus based on a content distribution network. A directed graph is constructed by means of all parent nodes between an initial node and a source station address and by means of a path value between any two adjacent nodes, and a backtracking point in the entire path solving process is controlled by combining a depth-first traversal algorithm, a path threshold and a hop count threshold, which is conducive to converging the amount of calculation, and can well support the calculation of a plurality of optimal paths in the scenario where a great many nodes detect each other in pairs; and additionally, a min heap data structure is introduced, such that a high speed is achieved and less space is used, thereby efficiently solving the sorting problem of calculating the plurality of optimal paths, and improving overall efficiency. La présente demande divulgue un procédé et un appareil de calcul de trajet basés sur un réseau de distribution de contenu.