Zhang et al., 2014 - Google Patents
Effective strategy of adding links for improving network transport efficiency on complex networksZhang et al., 2014
- Document ID
- 9161606467538429785
- Author
- Zhang S
- Liang M
- Jiang Z
- Wu J
- Publication year
- Publication venue
- International Journal of Modern Physics C
External Links
Snippet
In this paper, we propose an efficient strategy to enhance the network transport efficiency by adding links to the existing networks. In our proposed strategy, we consider both the node betweenness centrality (BC) and the shortest path length (L) as two important factors. The …
- 238000004088 simulation 0 abstract description 12
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
- H04L41/12—Arrangements for maintenance or administration or management of packet switching networks network topology discovery or management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/10—Flow control or congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing packet switching networks
- H04L43/08—Monitoring based on specific metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/745—Address table lookup or address filtering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
- H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
- H04L41/14—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Jiang et al. | Enhancing network performance by edge addition | |
Zhang et al. | Effective strategy of adding links for improving network transport efficiency on complex networks | |
Yan et al. | Efficient routing on complex networks | |
Zhao et al. | Onset of traffic congestion in complex networks | |
Zhang et al. | Enhancing the transmission efficiency by edge deletion in scale-free networks | |
Jiang et al. | Incremental routing strategy on scale-free networks | |
Ma et al. | Improved efficient routing strategy on two-layer complex networks | |
Zhang et al. | Method to enhance traffic capacity for two-layer complex networks | |
Jiang et al. | Improving network transport efficiency by edge rewiring | |
Ma et al. | A link-adding strategy for transport efficiency of complex networks | |
Ma et al. | Enhancing traffic capacity of scale-free networks by link-directed strategy | |
Zhang et al. | Improved efficient static weighted routing strategy on two-layer complex networks | |
Jiang et al. | An efficient bandwidth allocation strategy for scale-free networks | |
Yang et al. | Joint virtual switch deployment and routing for load balancing in SDNs | |
Bai et al. | Effective hybrid link-adding strategy to enhance network transport efficiency for scale-free networks | |
Zhang et al. | Queue resource reallocation strategy for traffic systems in scale-free network | |
Wang et al. | Traffic dynamics based on a traffic awareness routing strategy on scale-free networks | |
Guan et al. | An efficient routing strategy on spatial scale-free networks | |
Zhu et al. | Modeling and analyzing cascading dynamics of the Internet based on local congestion information | |
Jiang et al. | An efficient weighted routing strategy for scale-free networks | |
Ma et al. | Improved efficient queue resource reallocation strategy for traffic dynamics on scale-free networks | |
Ma et al. | Optimal resource allocation strategy for two-layer complex networks | |
Sangeetha et al. | A novel traffic dividing and scheduling mechanism for enhancing security and performance in the tor network | |
Bai et al. | Multi-priority routing algorithm based on source node importance in complex networks | |
Jiang | An incremental optimal routing strategy for scale-free networks |