Issue No.12 - December (2005 vol.16)
Daniel Villela , IEEE
Dan Rubenstein , IEEE
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2005.152
<p><b>Abstract</b>—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 such a provider to justify its participation within 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. 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. </p>
Information services, network servers, modeling.
Daniel Villela, Dan Rubenstein, "Performance Analysis of Server Sharing Collectives for Content Distribution", IEEE Transactions on Parallel & Distributed Systems, vol.16, no. 12, pp. 1178-1189, December 2005, doi:10.1109/TPDS.2005.152