The delivery of large size les to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of the main requirements of communication networks. This requires...

The delivery of multimedia information over networks requires expensive high bandwidth capacity as well as fast and high storage servers. This motivates the multimedia providers to optimize the delivery distances, as well as, to optimize the electronic content allocation. In this paper we propose an algorithm for finding the optimal allocation of electronic content in a tree oriented distributed network (Such as, CATV-Tree). The proposed algorithm finds the optimal location of an electronic content over the distributed network, such that the cost of storage (storing electronic content in servers) plus the communication cost (transferring electronic content over the network to the end-users) is minimized. The algorithm is distributed, and each node requires a limited memory capacity and computation...