[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Jiang et al., 2014 - Google Patents

Effects of efficient edge rewiring strategies on network transport efficiency

Jiang et al., 2014

Document ID
11315227370361738392
Author
Jiang Z
Liang M
An W
Publication year
Publication venue
Physica A: Statistical Mechanics and its Applications

External Links

Snippet

The transport efficiency of a network strongly depends on the underlying structure. The traffic capacity of one real network may be actually very small due to the heterogeneous degree distribution of the network under the global shortest path routing strategy. For the purpose of …
Continue reading at www.sciencedirect.com (other versions)

Classifications

    • 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
    • H04L67/104—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network for peer-to-peer [P2P] networking; Functionalities or architectural details of P2P networks
    • H04L67/1074—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network for peer-to-peer [P2P] networking; Functionalities or architectural details of P2P networks for supporting resource transmission mechanisms
    • 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
    • H04L47/12—Congestion avoidance or recovery
    • 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
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/10—Flow control or congestion control
    • H04L47/24—Flow control or congestion control depending on the type of traffic, e.g. priority or quality of service [QoS]
    • H04L47/2441—Flow classification
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations contains provisionally no documents
    • H04L12/18—Arrangements for providing special services to substations contains provisionally no documents for broadcast or conference, e.g. multicast
    • H04L12/1886—Arrangements for providing special services to substations contains provisionally no documents for broadcast or conference, e.g. multicast with traffic restrictions for efficiency improvement, e.g. involving subnets or subdomains
    • 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/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/16—Multipoint routing
    • 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/24—Multipath
    • H04L45/245—Link aggregation, e.g. trunking
    • 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
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/70—Admission control or resource allocation
    • 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

Similar Documents

Publication Publication Date Title
Jiang et al. Effects of efficient edge rewiring strategies on network transport efficiency
Huang et al. Effective strategy of adding nodes and links for maximizing the traffic capacity of scale-free network
Ma et al. Traffic dynamics on two-layer complex networks with limited delivering capacity
Jiang et al. Incremental routing strategy on scale-free networks
Pu et al. Efficient and robust routing on scale-free networks
Ling et al. Traffic resource allocation for complex networks
Kuo et al. Service chain embedding with maximum flow in software defined network and application to the next-generation cellular network architecture
Jiang et al. Improving network transport efficiency by edge rewiring
Lu et al. A genetic algorithm for finding a path subject to two constraints
Tan et al. Hybrid routing on scale-free networks
Ma et al. Enhancing traffic capacity of scale-free networks by link-directed strategy
Zhang et al. Effective strategy of adding links for improving network transport efficiency on complex networks
Ma et al. A link-adding strategy for transport efficiency of complex networks
Jiang et al. An efficient bandwidth allocation strategy for scale-free networks
Wang et al. Traffic dynamics based on a traffic awareness routing strategy on scale-free networks
Zhang et al. Queue resource reallocation strategy for traffic systems in scale-free network
Jiang et al. Enhancing traffic capacity of two-Layer complex networks
Haddou et al. Implantation of the global dynamic routing scheme in scale-free networks under the shortest path strategy
Hu et al. Efficient traffic-aware routing strategy on multilayer networks
Mumey et al. Parity balancing path flow decomposition and routing
Zhang et al. The effect of queueing strategy on network traffic
Du et al. A dynamic allocation mechanism of delivering capacity in coupled networks
Lee et al. High-performance distribution of limited resources via a dynamical reallocation scheme
Chen et al. A congestion awareness routing strategy for scale-free networks with tunable clustering
Ma et al. Improved efficient queue resource reallocation strategy for traffic dynamics on scale-free networks