Abstract
A major challenge for organizations and application service providers (ASP) is to provide high quality network services to geographically dispersed consumers at a reasonable cost. Such providers employ content delivery networks (CDNs) and overlay networks to bring content and applications closer to their service consumers with better quality.
Overlay networks architecture should support high-performance and high-scalability at a low cost. For that end, in addition to the traditional unicast communication, multicast methodologies can be used to deliver content from regional servers to end users. Another important architectural problem is the efficient allocation of objects to servers to minimize storage and distribution costs.
In this work, we suggest a novel hybrid multicast/unicast based architecture and address the optimal allocation and replication of objects. Our model network includes application servers which are potential storage points connected in the overlay network and consumers which are served using multicast and/or unicast traffic. General costs are associated with distribution (download) traffic as well as the storage of objects in the servers.
An optimal object allocation algorithm for tree networks is presented with computational complexity of O(N 2). The algorithm automatically selects, for each user, between multicast and unicast distribution. An approximation algorithm for general networks is also suggested. The model and algorithms can be easily extended to the cases where content is updated from multiple locations.
Chapter PDF
Similar content being viewed by others
Keywords
References
Cisco, http://www.cisco.com/
Akamai, http://www.akamai.com/
Digital Fountain, http://www.digitalfountain.com/
O. Unger and I. Cidon, Content location in multicast based overlay networks with content updates, CCIT Report #432, Technion Press, June 2003.
S. Shi and J. Turner. Routing in Overlay Multicast Networks. In Proc. of IEEE INFOCOM, June 2002.
P. Francis. “Yoid: Extending the Internet multicast architecture”, April 2000.
D. Helder and S. Jamin. Banana tree protocol, an end-host multicast protocol. Technical Report CSE-TR-429-00, University of Michigan, 2000.
J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek and J. O’Toole. Overcast: Reliable multicasting with an overlay network. In Proceedings of the Fourth Symposium on Operating Systems Design and Implementation, pp. 197–212, October 2000.
I. Cidon and O. Unger, Optimal content location in IP multicast based overlay networks, In Proceedings of the 23rd ICDCS workshops, May 2003.
L. W. Dowdy and D. V. Foster. Comparative Models of the File Assignment Problem. ACM Computing Surveys, 14(2) pp. 287–313, 1982.
Pitu B. Mirchandani, Richard L. Francis. Discrete Location Theory, John Wiley & Sons, Inc. 1990.
Kolen A., “Solving covering problems and the uncapacited plant location problem on trees”, European Journal of Operational Research, Vol. 12, pp. 266–278, 1983.
Alain Billionnet, Marie-Christine Costa, “Solving the Uncapacited Plant Location Problem on Trees”, Discrete Applied Mathematics, Vol. 49(1–3), pp. 51–59, 1994.
I. Cidon, S. Kutten, and R. Sofer. Optimal allocation of electronic content. In Proceedings of IEEE Infocom, Anchorage, AK, April 22–26, 2001.
L. Qiu, V. N. Padmanabham, and G. M. Voelker. On the placement of web server replicas. In Proc. 20th IEEE INFOCOM, 2001.
Sugih Jamin, Cheng Jin, Anthony R. Kurc, Danny Raz and Yuval Shavitt. Constrained Mirror Placement on the Internet, IEEE Infocom 2001.
J. Kangasharju and 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.
S. L. Hakimi. Steiner’s problem in graphs and its implications. Networks, Vol. 1 (1971), pp. 113–133.
M. R. Garey, R. L. Graham and D.S. Johnson. The complexity of computing Steiner minimal trees. SIAM J. Appl. Math., 32 (1977) pp. 835–859.
A. Z. Zelikovsky. The 11/6-approximation algorithm for the Steiner problem on networks. Algorithmica 9 (1993) 463–470.
Ellen W. Zegura, Ken Calvert and S. Bhattacharjee. How to Model an Internetwork. Proceedings of IEEE Infocom’ 96, San Francisco, CA.
GT-ITM: Georgia Tech Internetwork Topology Models, http://www.cc.gatech.edu/fac/Ellen.Zegural/gt-itm/gt-itm.tar.gz
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Unger, O., Cidon, I. (2005). Content Location and Distribution in Converged Overlay Networks. In: Gaïti, D., Galmés, S., Puigjaner, R. (eds) Network Control and Engineering for QoS, Security and Mobility, III. NetCon 2004. IFIP International Federation for Information Processing, vol 165. Springer, Boston, MA. https://doi.org/10.1007/0-387-23198-6_8
Download citation
DOI: https://doi.org/10.1007/0-387-23198-6_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23197-6
Online ISBN: 978-0-387-23198-3
eBook Packages: Computer ScienceComputer Science (R0)