Abstract
To evaluate peer-to-peer systems through discrete-event simulation, one needs to be able to generate sufficiently large networks of nodes that exhibit the desired properties, such as the scale-free nature of the connectivity graph. In applications such as the web of trust or analysis of hyperlink structures, the direction of the arcs between two nodes is relevant and one therefore generates directed graphs. In this paper we introduce a model to generate directed scale free graphs without multiple arcs between the same pair of nodes and loops. This model is based on existing models that allows multiple arcs and loops, but considerably more challenging to implement in an efficient manner. We therefore design and implement a set of algorithms and compare them with respect to CPU and memory use, in terms of both theoretical complexity analysis and experimental results. We will show through experiments that with the fastest algorithms networks with a million or more nodes can be generated in mere seconds.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: ICS 2002: Proceedings of the 16th International Conference on Supercomputing, pp. 84–95. ACM Press, New York (2002)
Ribeiro de Mello, E., van Moorsel, A.P.A., da Silva Fraga, J.: Evaluation of P2P search algorithms for discovering trust paths. In: European Performance Engineering Workshop, pp. 112–124 (2007)
Zhang, H., van Moorsel, A.P.A.: Evaluation of P2P algorithms for probabilistic trust inference in a web of trust. In: Thomas, N., Juiz, C. (eds.) EPEW 2008. LNCS, vol. 5261, pp. 242–256. Springer, Heidelberg (2008)
Newman, M.E.J.: Power laws, Pareto+ distributions and Zipf’s law. Contemporary Physics 46(323) (2005)
Caldarelli, G.: Scale-Free Networks: Complex Webs in Nature and Technology. Oxford University Press, Oxford (2007)
Albert, R., Barabási, A.: Statistical mechanics of complex networks. Reviews of Modern Physics 74 (2002)
Bollobás, B., Borgs, C., Chayes, J., Riordan, O.: Directed scale-free graphs. In: SODA 2003: Proceedings of the Fourteenth Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 132–139 (2003)
Krapivsky, P.L., Rodgers, G.J., Redner, S.: Degree distributions of growing networks. Physical Review Letters 86, 5401 (2001)
Efraimidis, P.S., Spirakis, P.G.: Weighted random sampling with a reservoir. Inf. Process. Lett., 181–185 (2006)
Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509 (1999)
Jesi, G.P.: Peersim: A peer-to-peer simulator (2004), http://peersim.sourceforge.net
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the web. Comput. Netw. 33(1-6), 309–320 (2000)
jimt: Efficiently selecting a random, weighted element, http://www.perlmonks.org/?node_id=577433
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, H., van Moorsel, A. (2009). Fast Generation of Scale Free Networks with Directed Arcs. In: Bradley, J.T. (eds) Computer Performance Engineering. EPEW 2009. Lecture Notes in Computer Science, vol 5652. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02924-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-02924-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02923-3
Online ISBN: 978-3-642-02924-0
eBook Packages: Computer ScienceComputer Science (R0)