Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2013, Article ID 378083, 7 pages
http://dx.doi.org/10.1155/2013/378083
Research Article

Optimal Transport on Weighted Networks for Different Node Delivery Capability Schemes

1Jiangsu Information Analysis Engineering Laboratory, Jinling Institute of Technology, Nanjing 211169, China
2School of Information Technology, Jinling Institute of Technology, Nanjing 211169, China

Received 5 September 2013; Accepted 9 December 2013

Academic Editors: W. Sun, G. Zhang, and J. Zhou

Copyright © 2013 Fei Shao. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Many real networks can be best described by weighted networks with a diversity of interactions between nodes measured by the weights of the edges. It is of great importance to improve the overall capacity of these real-world networks. In this paper, the traffic capacity of weighted network is investigated based on three different node delivery capability schemes: the delivery capacity of each node is constant in the first scheme while in the second and third schemes it is proportional to its node degree and node strength. It is shown by simulations that the network transfer capacity depends strongly on the tunable parameter. And different tunable parameter is suitable for different node delivery capability.