| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
 Digg
 Furl
 Spurl
 Blink
 Simpy
 Google
 Del.icio.us
 Y!MyWeb
| |
| | Search | |
| |
| |
| | |
Performance Analysis of Server Sharing Collectives for Content Distribution
December 2005 (vol. 16 no. 12)
pp. 1178-1189
Abstract—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.
[1] D. Eager , E. Lazowska , and J. Zahorjan , “A Comparison of Receiver-Initiated and Sender-Initiated Adaptive Load Sharing,” Performance Evaluation, vol. 16, May 1986.
[2] D. Eager , E. Lazowska , and J. Zahorjan , “Adaptive Load Sharing in Distributed Systems,” IEEE Trans. Software Eng., vol. 12, May 1986.
[3] M. Dahlin , R. Wang , T. Anderson , and D. Patterson , “Cooperative Caching: Using Remote Client Memory to Improve File System Performance,” Proc. Symp. Operating Systems Design and Implementation, 1994.
[4] G. Voelker , H. Jamrozik , M. Vernon , H. Levy , and E. Lazowska , “Managing Server Load in Global Memory Systems,” Proc. ACM Sigmetrics, June 1997.
[5] D. Villela and D. Rubenstein , “Performance Analysis of Server Sharing Collectives for Content Distribution,” Proc. Int'l Workshop Quality of Service, pp. 41-58, June 2003.
[6] G. Voelker , E. Anderson , T. Kimbrel , M. Feeley , J. Chase , A. Karlin , and H. Levy , “Implementing Cooperative Prefetching and Caching in a Global Memory System,” Proc. ACM Sigmetrics Conf., June 1998.
[7] M. Day , B. Cain , G. Tomlinson , and P. Rzemski , “A Model for Content Internetworking (CDI),” RFC 3466, IETF, Feb. 2003.
[8] J. Kangasharju , J.W. Roberts , and K.W. Ross , “Object Replication Strategies in Content Distribution Networks,” Proc. Sixth Int'l Workshop Web Caching and Content Delivery, June 2001.
[9] IBM Research , “Oceano Project,” http://www.research.ibm. comoceanoproject /, 2000.
[10] L. Golubchik and J.C.S. Lui , “Bounding of Performance Measures for Threshold-Based Systems: Theory and Application to Dynamic Resource Management in Video-on-Demand Servers,” IEEE Trans. Computers, vol. 74, no. 4, pp. 50-63, Apr. 1995.
[11] G.L. Choudhury , K.K. Leung , and W. Whitt , “Efficiently Providing Multiple Grades of Service with Protection against Overloads in Shared Resources” AT&T Technical J., pp. 353-372, Apr. 1995.
[12] J.S. Kaufman , “Blocking in a Shared Resource Environment,” Trans. Comm., vol. COM-29, pp. 1474-1481, Oct. 1981.
[13] J. Jung , B. Krishnamurthy , and M. Rabinovich , “Flash Crowds and Denial of Service Attacks: Characterization and Implications for CDNS and Web Sites,” Proc. WWW Conf., May 2002.
[14] V.N. Padmanabhan , H.J. Wang , P.A. Chou , and K. Sripanidkulchai , “Distributing Streaming Media Content Using Cooperative Networking,” Proc. Int'l Workshop Network and Operating Systems Support for Digital Audio and Video, May 2002.
[15] T. Stading , P. Maniatis , and M. Baker , “Peer-to-Peer Caching Schemes to Address Flash Crowds,” Proc. First Int'l Workshop Peer-to-Peer Systems, Mar. 2002.
[16] R.J. Bayardo, Jr. , A. Somani , D. Gruhl , and R. Agrawal , “Youserv: A Web Hosting and Content Sharing Tool for the Masses,” Proc. WWW-2002, 2002.
[17] S. Ross , Stochastic Processes. John Wiley & Sons, Inc., 1983.
[18] R.W. Wolff , Stochastic Modeling and the Theory of Queues, chapter 6, pp. 334-341. Prentice Hall, 1988.
[19] Real Networks, Inc., http:/www.realnetworks.com, 2004.
[20] K. Ross , Multiservice Loss Models for Broadband Telecommunications Networks, Springer, 1995.
[21] J. Byers , M. Luby , and M. Mitzenmacher , “Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed up Downloads,” Proc. IEEE INFOCOM, 1999.
[22] J.M. Almeida , J. Krueger , D.L. Eager , and M.K. Vernon , “Analysis of Educational Media Server Workloads,” Proc. Int'l Workshop Network and Operating SystemsSupport for Digital Audio and Video, pp. 21-30, June 2001.
[23] J. Padhye and J. Kurose , “An Empirical Study of Client Interactions with a Continuous-Media Courseware Server,” IEEE Internet Computing, Apr. 1999.
[24] M. Chesire , A. Wolman , G.M. Voelker , and H.M. Levy , “Measurement and Analysis of a Streaming-Media Workload,” Proc. Third USENIX Symp. Internet Technologies and Systems, Mar. 2001.
[25] S. Jin and A. Bestavros , “Gismo: Generator of Streaming Media Objects and Workloads,” Performance Evaluation Rev., 2001.
Index Terms:
Information services, network servers, modeling.
Citation:
Daniel Villela, Dan Rubenstein, "Performance Analysis of Server Sharing Collectives for Content Distribution," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 12, pp. 1178-1189, Dec. 2005, doi:10.1109/TPDS.2005.152
