Earticle

초록

영어

We proposed the information traffic dynamics on scale-free networks considering the heterogeneous delivering capacity. In the previous researches, the delivering capacity is the same for all nodes in the system, which obviously contradicts the real observations. In this paper, a heuristic algorithm for the optimization of transport is proposed to enhance traffic efficiency in complex networks, where each node's capacity is set as ci = ki and ki is the degree of node i. Our algorithm balances traffic on a scale-free network by minimizing the maximum effective betweenness, which can avoid or reduce the overload in some busy nodes. The simulation result shows that the network capacity can reach a very high value, which is four times more than that of the efficient routing strategy. The distribution of traffic load is also studied and it is found that our optimal routing strategy can make a good balance between hub nodes and non-hub nodes, resulting in high network capacity.

목차

Abstract
 1. Introduction
 2. Network Traffic Model
 3. Simulation Results
 4. Conclusion
 References

키워드

저자

• Zou Yamei [ Chengdu Aeronautic Vocational and Technical College Chengdu, China, The Innovation Base of School-Enterprise Cooperation Aviation Electronic Technology in Sichuan ]
• Li Zuoming [ Northest Air Traffic Management Bureau of CAAC Shenyang, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605