• DocumentCode
    2779170
  • Title

    Traffic dynamics based on the shortest path routing strategy

  • Author

    Wang, Dan ; Zhang, Bo ; Jiang, Nan ; Jing, Yuanwei ; Zhang, Siying

  • Author_Institution
    Inst. of Inf. Sci. & Eng., Northeastern Univ., Shenyang, China
  • fYear
    2009
  • fDate
    17-19 June 2009
  • Firstpage
    1106
  • Lastpage
    1109
  • Abstract
    We numerically investigate the influence of the structural properties of small-world network on the traffic delivery, by adopting the shortest path routing policy. We focus on the network capacity that can be measured by the critical value of phase transition from free flow to congestion. Here we address influence of the topology on the dynamics of traffic delivery for small-world networks, taking into account the average degree, the average clustering coefficient, and the information-processing capacity of individual nodes. Simulation results show that the critical value is obviously different for different small world network structures, and the critical value increases as the average degree increases. Moreover, compared to the influence of the average degree on traffic delivery, the influence of the average clustering coefficient on traffic delivery is less important role.
  • Keywords
    graph theory; network theory (graphs); network capacity; shortest path routing strategy; small-world network; traffic delivery; traffic dynamics; Communication system traffic control; Control engineering; Electronic mail; Information science; Lattices; Network topology; Power system reliability; Routing; Telecommunication traffic; Traffic control; Clustering Coefficient; Congestion; Degree; Small-world Network;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control and Decision Conference, 2009. CCDC '09. Chinese
  • Conference_Location
    Guilin
  • Print_ISBN
    978-1-4244-2722-2
  • Electronic_ISBN
    978-1-4244-2723-9
  • Type

    conf

  • DOI
    10.1109/CCDC.2009.5191738
  • Filename
    5191738