Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Data networks
A comparison of receiver-initiated and sender-initiated adaptive load sharing
Performance Evaluation
Managing server load in global memory systems
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Implementing cooperative prefetching and caching in a globally-managed memory system
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Analysis of educational media server workloads
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
GISMO: a Generator of Internet Streaming Media Objects and workloads
ACM SIGMETRICS Performance Evaluation Review
Distributing streaming media content using cooperative networking
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Flash crowds and denial of service attacks: characterization and implications for CDNs and web sites
Proceedings of the 11th international conference on World Wide Web
YouServ: a web-hosting and content sharing tool for the masses
Proceedings of the 11th international conference on World Wide Web
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
Peer-to-Peer Caching Schemes to Address Flash Crowds
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Measurement and analysis of a streaming-media workload
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Cooperative caching: using remote client memory to improve file system performance
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Performance Analysis of Server Sharing Collectives for Content Distribution
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Demand for content served by a provider can fluctuate with time, complicating the task of provisioning serving resources so that requests for its content are not rejected. One way to address this problem is to have providers form a collective in which they pool together their serving resources to assist in servicing requests for one another's content. In this paper, we determine the conditions under which a provider's participation in a collective reduces the rejection rate of requests for its content - a property that is necessary for the provider to justify participating in the collective. We show that all request rejection rates are reduced when the collective is formed from a homogeneous set of providers, but that some rates can increase within heterogeneous sets of collectives. We also show that asymptotically, growing the size of the collective will sometimes, but not always resolve this problem. We explore the use of thresholding techniques, where each collective participant sets aside a portion of its serving resources to serve only requests for its own content. We show that thresholding allows a more diverse set of providers to benefit from the collective model, making collectives a more viable option for content delivery services.