BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Numerical Simulations of the Structure and Transport Properties of
  the Complex Networks
DTSTART;VALUE=DATE-TIME:20121018T121500Z
DTEND;VALUE=DATE-TIME:20121018T124500Z
DTSTAMP;VALUE=DATE-TIME:20261011T115750Z
UID:indico-contribution-190@indico.ipb.ac.rs
DESCRIPTION:Speakers: Igor Stankovic (Scientfic Computing Laboratory\, Ins
 titute of Physics Belgrade\, University of Belgrade)\nIn this talk we revi
 ew our recent numerical study of various complex networks.  First\, we wil
 l introduce results of Monte Carlo simulations of the percolation and cond
 uctivity of two-dimensional random stick systems.  Based on the renormalis
 ation 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]. W
 e show that the prefactors in the generalized scaling function depend on t
 he system aspect ratio. The definite parity of the prefactors in the gener
 alized 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 d
 ensity. An analytic model is proposed describing transition from the condu
 ctivity determined by the structure of a percolating cluster to the conduc
 tivity of the dense random stick networks. The derived model for conductiv
 ity should be broadly applicable to the random networks of the rodlike par
 ticles [2].\n\nIn the second part of the talk\, we will present paths for 
 optimization of the transport capacity of the complex networks without cha
 nging average connectivity or total network capacity. The focus is on effi
 cient routing [3]. The routing strategies are compared using two generic m
 odels\, i.e.\, Barabási-Albert scale-free network and scale-free network 
 on lattice\, and academic router networks of the Netherlands and France. T
 he nodes without buffers are considered\, so\, if congestion occurs\, pack
 ets will be dropped. We propose a dynamic routing algorithm which automati
 cally extends path of the packet before it arrives at congested node. Simu
 lation 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].\n\n[1] M. Zezelj\, I. Stankovic and A. Belic\
 , "Finite-size Scaling in Asymmetric Systems of Percolating Sticks"\, Phys
 . Rev. E 85\, 021101 (2012).\n[2] M. Zezelj\, I. Stankovic\, “From perco
 lating to dense random stick networks: conductivity model investigation”
 \, submitted.\n[3] Jelena Smiljanic\, Milan Zezelj\, and Igor Stankovic\, 
  “Study of routing strategies in the small complex networks”\, Telekom
 unikacije 9\, to appear.\n[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).\n\nhttps://events.saifa.rs/event/291/contributions/190/
LOCATION:National Library of Serbia
URL:https://events.saifa.rs/event/291/contributions/190/
END:VEVENT
END:VCALENDAR