摘要
To determine CDN cache servers'placement reasonably,an idea that using graph partitioning to solve the problem was put forward through theoretical analysis and the specific algorithm of partitioning was researched. The concept of graph partitioning for CDN was defined. The conditions of graph partitioning for CDN were demonstrated: the sum of the weights of the nodes in each subarea is as close as possible; edge cut between the subareas is as large as possible; internal nodes in each subarea are connected as far as possible. By reference to light vertex matching algorithm of graph partitioning for network simulation,a multilevel k-way algorithm of graph partitioning for CDN was proposed. The maximized edge cut k-way KL refinement algorithm was discussed. Graph partitioning is a feasible way to solve the problem of CDN servers'placement. Multilevel k-way algorithm is a feasible algorithm for CDN graph partitioning.
To determine CDN cache servers＇ placement reasonably, an idea that using graph partitioning to solve the problem was put forward through theoretical analysis and the specific algorithm of partitioning was researched. The concept of graph partitioning for CDN was defined. The conditions of graph partitioning for CDN were demonstrated ： the sum of the weights of the nodes in each subarea is as close as possible ; edge eut between the subareas is as large as possible; internal nodes in each subarea are connected as far as possible. By reference to light vertex matching algorithm of graph partitioning for network simulation, a multilevel k-way algorithm of graph partitioning for CDN was proposed. The maximized edge cut k-way KL refinement algorithm was discussed. Graph partitioning is a feasible way to solve the problem of CDN servers＇ placement. Multilevel k-way algorithm is a feasible algorithm for CDN graph partitioning.
基金
Sponsored by the National Natural Science Foundation of China(Grant No.60973027)
Science Projects of China National Ministry of Information Industry(Grant No.01XK230009)
