Model of Optimum Placement of Servers and Web-Contents in Content Delivery Systems

A new model of optimum placement of servers and Web contents in a Content Delivery Network that is intended to minimize the cost of delivery of content to the ultimate users is proposed. The model also takes into account the structure of the network and the weight of each Web content in the network nodes. A mathematical formulation of the proposed model reduces to a problem of linear integer programming. In the present study synthesis of a neural network for the solution of a problem of linear integer programming is also described

Local utility aware content replication

Abstract. A commonly employed abstraction for studying the object placement problem for the purpose of Internet content distribution is that of a distributed replication group. In this work the initial model of distributed replication group of Leff, Wolf, and Yu (IEEE TPDS ’93) is extended to the case that individual nodes act selfishly, i.e., cater to the optimization of their individual local utilities. Our main contribution is the derivation of equilibrium object placement strategies that: (a) can guarantee improved local utilities for all nodes concurrently as compared to the corresponding local utilities under greedy local object placement; (b) do not suffer from potential mistreatment problems, inherent to centralized strategies that aim at optimizing the social utility; (c) do not require the existence of complete information at all nodes. We develop a baseline computationally efficient algorithm for obtaining the aforementioned equilibrium strategies and then extend it to improve its performance with respect to fairness. Both algorithms are realizable in practice through a distributed protocol that requires only limited exchange of information.