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

Jiang et al., 2013 - Google Patents

Optimal dynamic bandwidth allocation for complex networks

Jiang et al., 2013

Document ID
17278313358753119443
Author
Jiang Z
Liang M
Li Q
Guo D
Publication year
Publication venue
Physica A: Statistical Mechanics and its Applications

External Links

Snippet

Traffic capacity of one network strongly depends on the link's bandwidth allocation strategy. In previous bandwidth allocation mechanisms, once one link's bandwidth is allocated, it will be fixed throughout the overall traffic transmission process. However, the traffic load of every …
Continue reading at www.sciencedirect.com (other versions)

Classifications

    • 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
    • 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/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • H04L12/5693—Queue scheduling in packet switching networks
    • 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
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/10—Flow control or congestion control
    • H04L47/22—Traffic shaping
    • 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/21—Flow control or congestion control using leaky bucket
    • H04L47/215—Token bucket
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—General aspects
    • 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/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
    • H04L49/00—Packet switching elements
    • H04L49/90—Queuing arrangements
    • 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
    • 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
    • H04L43/00—Arrangements for monitoring or testing packet switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Application independent communication protocol aspects or techniques in packet data networks

Similar Documents

Publication Publication Date Title
Jiang et al. Optimal dynamic bandwidth allocation for complex networks
Jiang et al. Incremental routing strategy on scale-free networks
Ma et al. Traffic dynamics on two-layer complex networks with limited delivering capacity
Riley Large-scale network simulations with GTNetS
Ling et al. Traffic resource allocation for complex networks
Kuo et al. Optimal approximation algorithm of virtual machine placement for data latency minimization in cloud systems
Jiang et al. Enhancing traffic capacity of scale-free networks by employing hybrid routing strategy
Jiang et al. Improving network transport efficiency by edge rewiring
Hua et al. Scheduling heterogeneous flows with delay-aware deduplication for avionics applications
Ma et al. Improved efficient routing strategy on two-layer complex networks
Ling et al. Bandwidth allocation strategy for traffic systems of scale-free network
Jiang et al. An efficient bandwidth allocation strategy for scale-free networks
Zhang et al. Queue resource reallocation strategy for traffic systems in scale-free network
Ma et al. A link-adding strategy for transport efficiency of complex networks
Hu et al. Efficient traffic-aware routing strategy on multilayer networks
Jiang et al. An efficient weighted routing strategy for scale-free networks
Hong Effective usage of global dynamic information for network traffic
Ma et al. Optimal resource allocation strategy for two-layer complex networks
JP2006287919A (en) Communication network, content distribution node, tree construction method, and content distribution control program
Jiang An incremental optimal routing strategy for scale-free networks
He et al. Efficient packet transportation on complex networks with nonuniform node capacity distribution
Yang et al. Simultaneous improvement of multiple transportation performances on link-coupled networks by global dynamic routing
Zhang On cost-effective communication network designing
Lee et al. High-performance distribution of limited resources via a dynamical reallocation scheme
Ma et al. Improved efficient queue resource reallocation strategy for traffic dynamics on scale-free networks