Abstract
The architecture of overlay networks should support high-performance and high-scalability at low 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 a multicast based architecture and address the optimal allocation and replication of dynamic objects that are both consumed and updated. Our model network includes consumers which are served using multicast or unicast transmissions and media sources (that may be also consumers) which update the objects using multicast communication. General costs are associated with distribution (download) and update traffic as well as the storage of objects in the servers. Optimal object allocation algorithms for tree networks are presented with complexities of O(N) and O(N 2) in case of multicast and unicast distribution respectively. To our knowledge, the model of multicast distribution combined with multicast updates has not been analytically dealt before, despite its popularity in the industry.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Akamai, http://www.akamai.com/
A. Billionnet and M.-C. Costa, “Solving the uncapacited plant location problem on trees,” Discrete Applied Mathematics 49(1–3), 1994, 51–59.
I. Cidon, S. Kutten, and R. Sofer, “Optimal allocation of electronic content,” in Proceedings of IEEE Infocom, Anchorage, AK, April 22–26, 2001.
Cisco, http://www.cisco.com/
Digital Fountain, http://www.digitalfountain.com/
L. W. Dowdy and D. V. Foster, “Comparative models of the file assignment problem,” ACM Computing Surveys 14(2), 1982, 287–313.
P. Francis, “Yoid: Extending the Internet multicast architecture,” April 2000.
S. Jamin, C. Jin, A. R. Kurc, D. Raz, and Y. Shavitt, “Constrained mirror placement on the Internet,” in Proc. of IEEE INFOCOM, 2001.
K. Kalpakis, K. Dasgupta, and O. Wolfson, “Optimal placement of replicas in trees with read, write, and storage costs,” IEEE Transactions on Parallel and Distributed Systems 12(6), 2001, 628–637.
J. Kangasharju, J. Roberts, and K. Ross, “Object replication strategies in content distribution networks,” in Proceedings of WCW’01: Web Caching and Content Distribution Workshop, Boston, MA, June 2001.
A. Kolen, “Solving covering problems and the uncapacited plant location problem on trees,” European Journal of Operational Research 12, 1983, 266–278.
C. Krick, H. Räcke, and M. Westermann, “Approximation algorithms for data management in networks,” in Proc. of the Symposium on Parallel Algorithms and Architecture, July 2001, pp. 237–246.
P. B. Mirchandani and R. L. Francis, Discrete Location Theory, Wiley, 1990.
L. Qiu, V. N. Padmanabham, and G. M. Voelker, “On the placement of web server replicas,” in Proc. 20th IEEE INFOCOM, 2001.
Scale8, http://www.scale8.com/
S. Shi and J. Turner, Routing in overlay multicast networks, in Proc. of IEEE INFOCOM, June 2002.
WebDAV, http://www.webdav.org/
O. Wolfson and A. Milo, “The multicast policy and its relationship of replicated data placement,” ACM Transactions on Database Systems 16(1), 1991, 181–205.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Unger, O., Cidon, I. Optimal Content Location in Multicast Based Overlay Networks with Content Updates. World Wide Web 7, 315–336 (2004). https://doi.org/10.1023/B:WWWJ.0000028183.20015.be
Issue Date:
DOI: https://doi.org/10.1023/B:WWWJ.0000028183.20015.be