Bandwidth allocation strategy for traffic systems of scale-free network

Abstract

In this paper, the bandwidth resource allocation strategy is considered for traffic systems of complex networks. with a finite resource of bandwidth, an allocation strategy with preference parameter α is proposed considering the links importance. The performance of bandwidth allocation strategy is studied for the local routing protocol and the shortest path protocol. When important links are slightly favored in the bandwidth allocation, the system can achieve the optimal traffic performance for the two routing protocols. For the shortest path protocol, we also give a method to estimate the network traffic capacity theoretically.

Distributed flow optimization and cascading effects in weighted complex networks

“…Whether these systems are tuned for optimal throughput or robustness is an open question, although there have been some indications of biological systems operating in a near-optimal regime [56,57]. Analogous weighting schemes have been proven to be efficient for optimizing flow in RW [11][12][13] and shortest path routing [5,13,35], and also for optimizing spreading [58].…”

Models of Link Capacity Distribution in Isp's Router-Level Topology

“…Moreover, many researchers have discussed about capacity distribution in power-law topologies [14][15][16]. Zhang et al mentioned that node capacity distribution based on node betweenness centrality is appropriate to enhance network capacity [14].…”

Effective hybrid link-adding strategy to enhance network transport efficiency for scale-free networks

“…Therefore, lots of resource allocation strategies have been proposed for solving the network congestion and proven to be valid. [28][29][30][31] Another kind of strategy to improve the transport capacity is to modify the network topology structure. However, reconstructing the network usually results in signi¯cant cost, and removing, rewiring and adding links are much easier to implement at low cost.…”