<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Zhou, Tao</dc:creator>
  <dc:date>2007</dc:date>
  <dc:description xmlns:ns0="xml" ns0:lang="en">The nodes with the largest degree are very susceptible to traffic congestion, thus an effective way to improve traffic and control congestion can be redistributing traffic load in hub nodes to others. We proposed an efficient routing strategy, which can remarkably enhance the network throughput. In addition, by using detrended fluctuation analysis, we found that the traffic rate fluctuation near the critical point exhibits the 1/f scalingin the power spectrum, which is in accordance with the empirical data.</dc:description>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>https://folia.unifr.ch/global/documents/301050</dc:identifier>
  <dc:identifier>https://folia.unifr.ch/documents/301050/files/zhou_ers.pdf</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1142/S0217979207045232</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>License undefined</dc:rights>
  <dc:source>International Journal of Modern Physics B. - 2007, vol. 21, no. 23-24, p. 4071-4075</dc:source>
  <dc:subject>info:eu-repo/classification/udc/53</dc:subject>
  <dc:title xmlns:ns1="xml" ns1:lang="en">Efficient routing on scale-free networks</dc:title>
  <dc:type>http://purl.org/coar/resource_type/c_6501</dc:type>
</oai_dc:dc>