scispace - formally typeset
Open AccessJournal ArticleDOI

Efficient routing on complex networks.

TLDR
A generalized routing algorithm is given to find the so-called efficient path, which considers the possible congestion in the nodes along actual paths, to improve the transportation efficiency on complex networks.
Abstract
We propose a routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called efficient path, which considers the possible congestion in the nodes along actual paths. Since the nodes with the largest degree are very susceptible to traffic congestion, an effective way to improve traffic and control congestion, as our strategy, can be redistributing traffic load in central nodes to other noncentral nodes. Simulation results indicate that the network capability in processing traffic is improved more than 10 times by optimizing the efficient path, which is in good agreement with the analysis.

read more

Citations
More filters
Journal ArticleDOI

Link prediction in complex networks: A survey

TL;DR: Recent progress about link prediction algorithms is summarized, emphasizing on the contributions from physical perspectives and approaches, such as the random-walk-based methods and the maximum likelihood methods.
Journal ArticleDOI

Vital nodes identification in complex networks

TL;DR: In this paper, the state-of-the-art algorithms for vital node identification in real networks are reviewed and compared, and extensive empirical analyses are provided to compare well-known methods on disparate real networks.
Journal ArticleDOI

Identifying influential nodes in complex networks

TL;DR: Simulations on four real networks show that the proposed semi-local centrality measure can well identify influential nodes and is a tradeoff between the low-relevant degree centrality and other time-consuming measures.
Journal ArticleDOI

Vital nodes identification in complex networks

TL;DR: This review clarifies the concepts and metrics, classify the problems and methods, as well as review the important progresses and describe the state of the art, and provides extensive empirical analyses to compare well-known methods on disparate real networks and highlight the future directions.
Journal ArticleDOI

The H-index of a network node and its relation to degree and coreness

TL;DR: A family of H-indices are obtained that can be used to measure a node's importance and it is proved that the convergence to coreness can be guaranteed even under an asynchronous updating process, allowing a decentralized local method of calculating a nodes' coreness in large-scale evolving networks.
References
More filters
MonographDOI

Evolution and Structure of the Internet: A Statistical Physics Approach

TL;DR: Viewed in this analysis from a statistical physics perspective, the Internet is perceived as a developing system that evolves through the addition and removal of nodes and links, allowing the authors to outline the dynamical theory that can appropriately describe the Internet's macroscopic evolution.
Related Papers (5)