A greedy algorithm for capacity-constrained surrogate placement in CDNs. (Chinese. English summary) Zbl 1112.68301

Summary: A new surrogate placement strategy, CCSP (Capacity-Constrained Surrogate Placement), is proposed to enhance the performance for Content Distribution Networks (CDNs). CCSP aims to address surrogate placement in a manner that minimizes the communication cost while ensuring at the same time the maximization of system throughput. This work differs from the existing works on the resource allocation problem in communication networks, CCSP considers load distribution and processing capacity constraints on surrogates by modeling the underlying request-routing mechanism, thus guaranteeing a CDN to have minimum network resource consumption, maximum system throughput, and better load balancing among surrogates. An efficient greedy algorithm is developed for a simplified version of the CCSP problem in tree networks. The efficiency of the proposed algorithm is systematically analyzed through the experimental simulations.


68M10 Network design and communication in computer systems
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
68W05 Nonnumerical algorithms


load balancing