ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Networks
Volume 49, Issue 4, 15 November 2005, Pages 492-511
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (524 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comnet.2005.01.015    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2005 Elsevier B.V. All rights reserved.

Hybrid cooperative schemes for scalable and stable performance of Web content delivery

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Riccardo LancellottiE-mail The Corresponding Author, Francesca MazzoniE-mail The Corresponding Author and Michele ColajanniCorresponding Author Contact Information, E-mail The Corresponding Author

Dipartimento di Ingegneria dell’Informazione, Università di Modena e Reggio Emilia, 41100 Modena, MO, Italy


Received 27 April 2004; 
revised 28 October 2004; 
accepted 14 January 2005. 
Responsible Editor: E. Cohen. 
Available online 7 March 2005.

Abstract

Systems consisting of multiple edge servers are a popular solution to deal with performance and network resource utilization problems related to the growth of the Web. After a first period of prevalent enthusiasm towards cooperating edge servers, the research community is exploring in a more systematic way the real benefits and limitations of cooperative caching. Hierarchical cooperation has clearly shown its limits. We show that the “pure” protocols (e.g., directory-based, query-based) applied to a flat cooperation topology do not scale as well. For increasing numbers of cooperating edge servers, the amount of exchanged data necessary for cooperation augments exponentially, or the cache hit rates fall down, or both events occur. We propose and evaluate two hybrid cooperation schemes for document discovery and delivery. They are based on a semi-flat architecture that organizes the edge servers in groups and combines directory-based and query-based cooperation protocols. A large set of experimental results confirms that the combination of directory-based and query-based schemes increases the scalability of flat architectures based on “pure” protocols, guarantees more stable performance and tends to reduce pathologically long response times.

Keywords: Internet caching architecture; Geographically distributed systems; Cooperation protocols; Document discovery; Performance evaluation

Article Outline

1. Introduction
2. Limits of pure cooperation schemes
3. Two-tier architectures for resource discovery
3.1. Two-tier topologies
3.2. Cooperation protocols for two-tier topologies
4. Two-tier cooperation protocols
4.1. InterQ–IntraS cooperation protocol
4.1.1. A variant of the InterQ–IntraS protocol
4.2. InterS–IntraQ cooperation protocol
4.2.1. A variant of the InterS–IntraQ cooperation protocol
5. Workload models for performance evaluation
6. Performance evaluation of hybrid cooperation schemes
6.1. Scalability of the cooperation protocols
6.2. Sensitivity analysis on cache capacity
6.3. Experiments on a geographic testbed
6.4. Summary of the experimental results
7. Related work
8. Conclusions
Acknowledgements
References
Vitae










Corresponding Author Contact InformationCorresponding author. Tel./fax: +39 059 205 6137/6129.

Computer Networks
Volume 49, Issue 4, 15 November 2005, Pages 492-511
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.