This Article 
 Bibliographic References 
 Add to: 
Stochastic Graph Processes for Performance Evaluation of Content Delivery Applications in Overlay Networks
February 2008 (vol. 19 no. 2)
pp. 247-261
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network.Our methodology describes the distribution process as a constrained stochastic graph process (CSGP), where the constraints dictated by the content distribution protocol and the characteristics of the overlay network define the interaction among nodes. A CSGP is a semi-Markov process whose state is described by the graph itself. CSGPs offer a powerful description technique that can be exploited by Monte Carlo integration methods to compute in a very efficient way not only the mean but also the full distribution of metrics such as the file download times or number of hops from the source to the receiving nodes.We model several distribution architectures based on trees and meshes as CSGPs and solve them numerically. We are able to study scenarios with a very large number of nodes and we can precisely quantify the performance differences between the treeand mesh-based distribution architectures.

[1] Z. Ge, D.R. Figueiredo, S. Jaiswal, J. Kurose, and D. Towsley, “Modeling Peer-Peer File Sharing Systems,” Proc. IEEE INFOCOM, Mar. 2003.
[2] X. Yang and G. de Veciana, “Service Capacity of Peer-to-Peer Networks,” Proc. IEEE INFOCOM, 2004.
[3] F. Clevenot and P. Nain, “A Simple Fluid Model for the Analysis of the Squirrel Peer-to-Peer Caching System,” Proc. IEEE INFOCOM, Mar. 2004.
[4] D. Qiu and R. Srikant, “Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks,” Proc. ACM SIGCOMM '04, Sept. 2004.
[5] B. Cohen, “Incentives Build Robustness in BitTorrent,” Proc. First Workshop Economics of Peer-to-Peer Systems (P2P-Econ '03), June 2003.
[6] D. Pendarakis, S. Shi, D. Verma, and M. Waldvogel, “ALMI: An Application Level Multicast Infrastructure,” Proc. Third Usenix Symp. Internet Technologies and Systems (USITS '01), Mar. 2001.
[7] M. Castro, P. Druschel, A.M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, “SplitStream: Highbandwidth Multicast in a Cooperative Environment,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), Oct. 2003.
[8] E.W. Biersack, D. Carra, R. Lo Cigno, P. Rodriguez, and P. Felber, “Overlay Architectures for File Distribution: Fundamental Performance Analysis for Homogeneous and Heterogeneous Cases,” Computer Networks J., vol. 51, no. 3, pp. 901-917, Feb. 2007.
[9] F. Baccelli, A. Chaintreau, Z. Liu, A. Riabov, and S. Sahu, “Scalability of Reliable Group Communication Using Overlays,” Proc. IEEE INFOCOM, Mar. 2004.
[10] S. Nikoletseas, J. Reif, P. Spirakis, and M. Young, “Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time,” Proc. 22nd Int'l Colloquium Automata, Languages, and Programming (ICALP '95), pp. 159-170, 1995.
[11] P. Erdös and A. Renyi, “On Random Graphs,” Publicationes Mathematicae, vol. 6, pp. 290-297, 1959.
[12] D. Carra, R. Lo Cigno, and E.W. Biersack, “Content Delivery in Overlay Networks: A Stochastic Graph Processes Perspective,” Proc. 49th Ann. IEEE Global Telecomm. Conf. (GLOBECOM '06), 2006.
[13] D. Carra, “Performance Evaluation of Overlay Content Distribution Systems,” PhD dissertation, Univ. of Trento, Mar. 2007.
[14] D. Carra, R. Lo Cigno, and E.W. Biersack, “Fast Stochastic Exploration of P2P File Distribution Architectures,” Proc. 49th Ann. IEEE Global Telecomm. Conf. (GLOBECOM '06), 2006.
[15] S. Keshav, An Engineering Approach to Computer Networking. Addison-Wesley, 1997.
[16] C. Gkantsidis and P. Rodriguez, “Network Coding for Large-Scale Content Distribution,” Proc. IEEE INFOCOM, Mar. 2005.
[17] J. Honerkamp, Stochastic Dynamical Systems: Concepts, Numerical Methods, Data Analysis. Wiley-VCH, 1994.
[18] D.T. Gillespie, “Exact Stochastic Simulation of Coupled Chemical Reactions,” J. Physical Chemistry, vol. 63, no. 25, pp. 2340-2361, 1977.
[19] S.M. Ross, Introduction to Probability and Statistics for Engineers and Scientists, eighth ed. Academic Press, Dec. 2002.
[20] R. Gaeta, M. Gribaudo, D. Manini, and M. Sereno, “Analysis of Resource Transfer in Peer-to-Peer File Sharing Applications Using Fluid Models,” Performance Evaluation: An Int'l J. Peer-to-Peer Computing Systems, vol. 63, no. 3, pp. 147-264,
[21] D. Carra, R. Lo Cigno, and E.W. Biersack, “Graph Based Modeling of P2P Streaming Systems,” Proc. Sixth IFIP Int'l Conf. Networking (Networking '07), May 2007.
[22] GROOVER, /, Feb. 2007.
[23] PeerSim: A Peer-to-Peer Simulator, http:/peersim.sourceforge. net/, Feb. 2007.
[24] File Distribution Protocol in PeerSim, /, Feb. 2007.

Index Terms:
Modeling techniques, Performance attributes, Stochastic processes
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack, "Stochastic Graph Processes for Performance Evaluation of Content Delivery Applications in Overlay Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 2, pp. 247-261, Feb. 2008, doi:10.1109/TPDS.2007.1114
Usage of this product signifies your acceptance of the Terms of Use.