Controlling congestion on complex networks: fairness, efficiency and network structure

Abstract

We consider two elementary (max-flow and uniform-flow) and two realistic (max-min fairness and proportional fairness) congestion control schemes, and analyse how the algorithms and network structure affect throughput, the fairness of flow allocation, and the location of bottleneck edges. The more realistic proportional fairness and max-min fairness algorithms have similar throughput, but path flow allocations are more unequal in scale-free than in random regular networks. Scale-free networks have lower throughput than their random regular counterparts in the uniform-flow algorithm, which is favoured in the complex networks literature. We show, however, that this relation is reversed on all other congestion control algorithms for a region of the parameter space given by the degree exponent γ and average degree 〈k〉. Moreover, the uniform-flow algorithm severely underestimates the network throughput of congested networks, and a rich phenomenology of path flow allocations is only present in the more realistic α-fair family of algorithms. Finally, we show that the number of paths passing through an edge characterises the location of a wide range of bottleneck edges in these algorithms. Such identification of bottlenecks could provide a bridge between the two fields of complex networks and congestion control.

EpiRank: Modeling Bidirectional Disease Spread in Asymmetric Commuting Networks

“…Previous researchers have used networks to capture topological structures underlying disease diffusion 44–47 or to model different disease control strategies and consider their potential outcomes 30,31 . Network structures have also been used to analyze inter-city movement and transportation networks 14,40 , multi-layer interactions between cities 48,49 , surface street congestion problems 15,50,51 , airline flight patterns 52–54 , and maritime movement 53,55,56 . Our proposed algorithm offers a novel perspective for these and other networks.…”

Optimal and near-optimal alpha-fair resource allocation algorithms based on traffic demand predictions for optical network planning

“…), the α-fairness measure-and its associated social elasticity welfare functionis the one that has gained attention in the networking research community. Specifically, α-fair resource allocation schemes have been previously examined in wireless networks [29], SDN IP networks [30], and Transmission Control Protocol (TCP) networks [3,4,31]. It should be noted though that α-fair resource allocation schemes have not been previously considered for optical networks.…”

“…Constraint (27) ensures that the no-frequency overlap constraint is met for all network links by considering also the SAs implemented for the 1 , ... , c −1 agent sets, while constraints (28)- (30) ensure that each connection is assigned contiguous FSs on all links of its route. Finally, constraints (31) and (32) ensure that CUP and COP, respectively, of all the agents in 1 , ... , c sets are less than or equal to the CUP and COP of the agents in 1 , ... , c sets derived for the previous value of α (i.e., α ). A small deviation from the previous COP and CUP is acceptable, depending on the σ (α) value.…”

Early prediction of macrocrack location in concrete, rocks and other granular composite materials

“…First it lends well to proven tools for modeling and characterization of transmission dynamics germane to capacitated complex networks (e.g., power grid, telecommunication and road networks etc.) 21,22 . In such networks, each component (e.g., link) has a finite capacity for flow, and the most vulnerable part of the network to cascading failure is the so-called bottleneck where congestion occurs.…”

“…Heterogeneity in transmission pathways has major implications for the spread of failure in a broad range of networked systems 21,22 . In quasibrittle granular composites, this was recently investigated with respect to the coupled evolution of force and damage propagation in the framework of network flow theory 16 .…”