17-19 October 2012
National Library of Serbia
Europe/Belgrade timezone

Numerical Simulations of the Structure and Transport Properties of the Complex Networks

18 Oct 2012, 14:15
30m
National Library of Serbia

National Library of Serbia

Skerliceva 1 11000 Belgrade Serbia
Oral presentation Computational Physics Computational Physics Session 2

Speaker

Dr Igor Stankovic (Scientfic Computing Laboratory, Institute of Physics Belgrade, University of Belgrade)

Description

In this talk we review our recent numerical study of various complex networks. First, we will introduce results of Monte Carlo simulations of the percolation and conductivity of two-dimensional random stick systems. Based on the renormalisation group considerations, generalized scaling function is introduced to describe the scaling behaviour of the percolation distribution moments, i.e., average percolation density and percolation density variance [1]. We show that the prefactors in the generalized scaling function depend on the system aspect ratio. The definite parity of the prefactors in the generalized scaling function for the first two moments is a generic feature of whole class of percolating systems. The conductivity of the random stick systems is investigated from the percolation up to ten times percolation density. An analytic model is proposed describing transition from the conductivity determined by the structure of a percolating cluster to the conductivity of the dense random stick networks. The derived model for conductivity should be broadly applicable to the random networks of the rodlike particles [2]. In the second part of the talk, we will present paths for optimization of the transport capacity of the complex networks without changing average connectivity or total network capacity. The focus is on efficient routing [3]. The routing strategies are compared using two generic models, i.e., Barabási-Albert scale-free network and scale-free network on lattice, and academic router networks of the Netherlands and France. The nodes without buffers are considered, so, if congestion occurs, packets will be dropped. We propose a dynamic routing algorithm which automatically extends path of the packet before it arrives at congested node. Simulation results indicate that proposed routing strategy can further reduce number of dropped packets in a combination with the efficient path routing proposed by Yan et al. [4]. [1] M. Zezelj, I. Stankovic and A. Belic, "Finite-size Scaling in Asymmetric Systems of Percolating Sticks", Phys. Rev. E 85, 021101 (2012). [2] M. Zezelj, I. Stankovic, “From percolating to dense random stick networks: conductivity model investigation”, submitted. [3] Jelena Smiljanic, Milan Zezelj, and Igor Stankovic, “Study of routing strategies in the small complex networks”, Telekomunikacije 9, to appear. [4] G. Yan, T. Zhou, B. Hu, Z.-Q. Fu, and B.-H. Wang, “Efficient Routing on Complex Networks”, Phys. Rev. E 73, 046108 (2006).

Primary author

Dr Igor Stankovic (Scientfic Computing Laboratory, Institute of Physics Belgrade, University of Belgrade)

Co-authors

Ms Jelena Smiljanic (Scientfic Computing Laboratory, Institute of Physics Belgrade, University of Belgrade) Mr Milan Zezelj (Scientfic Computing Laboratory, Institute of Physics Belgrade, University of Belgrade)

Presentation Materials