Please use this identifier to cite or link to this item:
https://doi.org/10.1209/0295-5075/83/28001
DC Field | Value | |
---|---|---|
dc.title | Optimal resource allocation for efficient transport on complex networks | |
dc.contributor.author | Gong, X. | |
dc.contributor.author | Kun, L. | |
dc.contributor.author | Lai, C.-H. | |
dc.date.accessioned | 2014-05-19T02:53:51Z | |
dc.date.available | 2014-05-19T02:53:51Z | |
dc.date.issued | 2008-07-01 | |
dc.identifier.citation | Gong, X., Kun, L., Lai, C.-H. (2008-07-01). Optimal resource allocation for efficient transport on complex networks. EPL 83 (2) : -. ScholarBank@NUS Repository. https://doi.org/10.1209/0295-5075/83/28001 | |
dc.identifier.issn | 02955075 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/53072 | |
dc.description.abstract | The problem of efficient transport on a complex network is studied in this paper. We find that there exists an optimal way to allocate resources for information processing on each node to achieve the best transport capacity of the network, or the largest input information rate which does not cause jamming in network traffic, provided that the network structure and routing strategy are given. More interestingly, this achievable network capacity limit is closely related to the topological structure of the network, and is actually inversely proportional to the average distance of the network, measured according to the same routing rule. © Europhysics Letters Association. | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | PHYSICS | |
dc.contributor.department | TEMASEK LABORATORIES | |
dc.description.doi | 10.1209/0295-5075/83/28001 | |
dc.description.sourcetitle | EPL | |
dc.description.volume | 83 | |
dc.description.issue | 2 | |
dc.description.page | - | |
dc.identifier.isiut | 000259021200023 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.