Please use this identifier to cite or link to this item: https://doi.org/10.1209/0295-5075/83/28001
DC FieldValue
dc.titleOptimal resource allocation for efficient transport on complex networks
dc.contributor.authorGong, X.
dc.contributor.authorKun, L.
dc.contributor.authorLai, C.-H.
dc.date.accessioned2014-05-19T02:53:51Z
dc.date.available2014-05-19T02:53:51Z
dc.date.issued2008-07-01
dc.identifier.citationGong, 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.issn02955075
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/53072
dc.description.abstractThe 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.sourceScopus
dc.typeArticle
dc.contributor.departmentPHYSICS
dc.contributor.departmentTEMASEK LABORATORIES
dc.description.doi10.1209/0295-5075/83/28001
dc.description.sourcetitleEPL
dc.description.volume83
dc.description.issue2
dc.description.page-
dc.identifier.isiut000259021200023
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.