Optimal content location in IP multicast based overlay networks

The architecture of overlay networks should encourage high-performance, high-scalability and reduced costs. This becomes more crucial when communication, storage costs as well as service latencies grow with the exploding amounts of data exchanged and with the size and span of the overlay network. For that end, multicast methodologies can be used to deliver content from regional servers to end users, as well as for the timely and economical synchronization of content among the distributed servers. Another important architectural problem is the efficient allocation of objects to servers to minimize storage, delivery and update costs. In this work, we suggest an IP multicast based architecture and address the optimal allocation and replication of objects that are both consumed and updated Our model network includes consumers which are served using IP multicast and media sources (that may be also consumers) which update the objects within the servers using multicast. General costs are associated with distribution (download) and update traffic as well as the storage of objects in the servers. An optimal object allocation algorithm for tree networks is presented with complexity of O(N). To our knowledge, the model of storage costs and multicast distribution combined with multicast updates has not been analytically dealt before, despite its popularity in the industry.