skip to main content
10.1145/1516360.1516410acmotherconferencesArticle/Chapter ViewAbstractPublication PagesedbtConference Proceedingsconference-collections
research-article
Free access

Flower-CDN: a hybrid P2P overlay for efficient query processing in CDN

Published: 24 March 2009 Publication History

Abstract

Many websites with a large user base, e.g., websites of nonprofit organizations, do not have the financial means to install large web-servers or use specialized content distribution networks such as Akamai. For those websites, we have developed Flower-CDN, a locality-aware P2P based content-distribution network (CDN) in which the users that are interested in a website support the distribution of its content. The idea is that peers keep the content they retrieve and later serve it to other peers that are close to them in locality. Our architecture is a hybrid between structured and unstructured networks. When a new client requests some content from a website, a locality-aware DHT quickly finds a peer in its neighborhood that has the content available. Additionally, all peers in a given locality that maintain content of a particular website build an unstructured content overlay. Within this overlay, peers gossip information about their content allowing the system to maintain accurate information despite churn. In our performance evaluation, we compare Flower-CDN with an existing P2P-CDN strictly based on DHT and not locality aware. Flower-CDN reduces lookup latency by a factor of 9 and transfer distance by a factor of 2. We also show that Flower-CDN's gossip has low overhead and can be adjusted according to hit ratio requirements and bandwidth availability.

References

[1]
Akamai. http://www.akamai.com.
[2]
Brite. http://www.cs.bu.edu/brite/.
[3]
Peersim p2p simulator. http://www.peersim.sourceforge.net.
[4]
L. Breslau, Pei Cao, Li Fan, G. Phillips, and S. Shenker. Web Caching and Zipf-like Distributions: Evidence and Implications. In INFOCOM, 1999.
[5]
F. Dabek, B. Zhao, P. Druschel, and J. Kubiatowiczet. Towards a common api for structured P2P overlays. In IPTPS, 2003.
[6]
A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In PODC, 1987.
[7]
M. El Dick, V. Martins, and E. Pacitti. A topology-aware approach for distributed data reconciliation in P2P networks. In Euro-Par, 2007.
[8]
P. T. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulieacute. Epidemic information dissemination in distributed systems. IEEE Computer, 37(5), 2004.
[9]
Li Fan, Pei Cao, J. Almeida, and A. Z. Broder. Summary cache: A scalable wide-area web cache sharing protocol. In SIGCOMM, 1998.
[10]
S. Iyer, A. I. T. Rowstron, and P. Druschel. Squirrel: a decentralized P2P web cache. In PODC, 2002.
[11]
M. Jelasity, R. Guerraoui, A.-M. Kermarrec, and M. van Steen. The peer sampling service: experimental evaluation of unstructured gossip-based implementations. In Middleware, 2004.
[12]
N. Ntarmos and P. Triantafillou. Aesop: Altruism-endowed self-organizing peers. In DBISP2P, 2004.
[13]
V. N. Padmanabhan and K. Sripanidkulchai. The case for cooperative networking. In IPTPS, 2002.
[14]
W. Rao, Lei Chen, Ada Wai-Chee Fu, and YingYi Bu. Optimal proactive caching in P2P network: analysis and application. In CIKM, 2007.
[15]
S. Ratnasamy, M. Handley, R. M. Karp, and S. Shenker. Topologically-aware overlay construction and server selection. In INFOCOM, 2002.
[16]
A. I. T. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale P2P systems. In Middleware, 2001.
[17]
Y.-S. Ryu and S.-B. Yang. An effective P2P web caching system under dynamic participation of peers. IEICE Transactions, 88-B(4), 2005.
[18]
T. Stading, P. Maniatis, and M. Baker. P2P caching schemes to address flash crowds. In IPTPS, 2002.
[19]
A. Stavrou, D. Rubenstein, and S. Sahu. A lightweight, robust P2P system to handle flash crowds. In ICNP, 2002.
[20]
I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable P2P lookup service for internet applications. In SIGCOMM, 2001.
[21]
S. Voulgaris, D. Gavidia, and M. van Steen. Cyclon: Inexpensive membership management for unstructured P2P overlays. J. Network Syst. Manage., 13(2), 2005.

Cited By

View all
  • (2018)A Tree-Based Approach to Locate Object Replicas in a Fog Storage Infrastructure2018 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2018.8647470(1-6)Online publication date: Dec-2018
  • (2017)NoCDNProceedings of the fifth ACM/IEEE Workshop on Hot Topics in Web Systems and Technologies10.1145/3132465.3132476(1-6)Online publication date: 14-Oct-2017
  • (2016)Mignon: A Fast Decentralized Content Consumption Estimation in Large-Scale Distributed SystemsDistributed Applications and Interoperable Systems10.1007/978-3-319-39577-7_3(32-46)Online publication date: 24-May-2016
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
EDBT '09: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
March 2009
1180 pages
ISBN:9781605584225
DOI:10.1145/1516360
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 March 2009

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Conference

EDBT/ICDT '09
EDBT/ICDT '09: EDBT/ICDT '09 joint conference
March 24 - 26, 2009
Saint Petersburg, Russia

Acceptance Rates

Overall Acceptance Rate 7 of 10 submissions, 70%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)87
  • Downloads (Last 6 weeks)14
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2018)A Tree-Based Approach to Locate Object Replicas in a Fog Storage Infrastructure2018 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2018.8647470(1-6)Online publication date: Dec-2018
  • (2017)NoCDNProceedings of the fifth ACM/IEEE Workshop on Hot Topics in Web Systems and Technologies10.1145/3132465.3132476(1-6)Online publication date: 14-Oct-2017
  • (2016)Mignon: A Fast Decentralized Content Consumption Estimation in Large-Scale Distributed SystemsDistributed Applications and Interoperable Systems10.1007/978-3-319-39577-7_3(32-46)Online publication date: 24-May-2016
  • (2016)CyCLaDEsProceedings of the 13th International Conference on The Semantic Web. Latest Advances and New Domains - Volume 967810.1007/978-3-319-34129-3_28(455-469)Online publication date: 29-May-2016
  • (2015)WebCDNProceedings of the 9th Asia-Pacific Services Computing Conference on Advances in Services Computing - Volume 946410.1007/978-3-319-26979-5_17(235-243)Online publication date: 7-Dec-2015
  • (2014)A hierarchical approach to resource awareness in DHTs for mobile data managementPervasive and Mobile Computing10.1016/j.pmcj.2013.07.01715:C(113-127)Online publication date: 1-Dec-2014
  • (2014)BehaveProceedings of the 14th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems - Volume 846010.1007/978-3-662-43352-2_8(89-103)Online publication date: 3-Jun-2014
  • (2013)MayghProceedings of the 8th ACM European Conference on Computer Systems10.1145/2465351.2465379(281-294)Online publication date: 15-Apr-2013
  • (2012)P2P Techniques for Decentralized ApplicationsSynthesis Lectures on Data Management10.2200/S00414ED1V01Y201204DTM0254:3(1-104)Online publication date: 15-Apr-2012
  • (2012)Colluder Detection in Commercial P2P CDNs Using Reputation InformationProceedings of the 2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing10.1109/3PGCIC.2012.19(183-190)Online publication date: 12-Nov-2012
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media