Optimal traffic networks topology: A complex networks perspective

We investigate and analyse an optimal traffic network structure for resisting traffic congestion with different volumes of traffic. For this aim, we introduce a cost function and user-equilibrium assignment (UE) which ensures the flow balance on traffic systems. Our finding is that an optimal network is strongly dependent on the total system flow. And the random network is most desirable when the system flow is small. But for the larger volume of traffic, the network with power-law degree distribution is the optimal one. Further study indicates, for scale-free networks, that the degree distribution exponent has large effects on the congestion of traffic network. Therefore, the volume of traffic and characteristic of network determine the optimal network structure so as to minimize the side-effect produced by traffic congestion.     

Optimal structure of complex networks for minimizing traffic congestion

To design complex networks to minimize traffic congestion, it is necessary to understand how traffic flow depends on network structure. We study data packet flow on complex networks, where the packet delivery capacity of each node is not fixed. The optimal configuration of capacities to minimize traffic congestion is derived and the critical packet generating rate is determined, below which the network is at a free flow state but above which congestion occurs. Our analysis reveals a direct relation between network topology and traffic flow. Optimal network structure, free of traffic congestion, should have two features: uniform distribution of load over all nodes and small network diameter. This finding is confirmed by numerical simulations. Our analysis also makes it possible to theoretically compare the congestion conditions for different types of complex networks. In particular, we find that network with low critical generating rate is more susceptible to congestion. The comparison has been made on the following complex-network topologies: random, scale-free, and regular.     

复杂交通运输网络上的拥挤与效率问题研究

本文研究复杂交通运输网络上的拥挤与效率问题. 在无标度网络、随机网络以及小世界网络等不同拓扑结构中, 探讨了不同的能力分配方式和不同的OD (Origin-Destination) 交通需求分布对网络拥挤度和效率的影响. 随着平均交通需求的增加, 分析无标度网络、随机网络以及小世界网络从自由流状态到交通拥堵状态的变化规律. 为便于比较, 本文侧重研究网络拥挤度的倒数, 并将其定义为通畅度. 研究发现网络中的通畅度与效率之间存在线性相关关系, 并且不同网络中的线性比例系数 (或斜率)是不同的, 从而体现了不同网络具有不同的运输性能. 关键词： 复杂网络 拥挤 效率     

Deterministic weighted scale-free small-world networks

We propose a deterministic weighted scale-free small-world model for considering pseudofractal web with the co-evolution of topology and weight. Considering the fluctuations in traffic flow constitute a main reason for congestion of packet delivery and poor performance of communication networks, we suggest a recursive algorithm to generate the network, which restricts the traffic fluctuations on it effectively during the evolutionary process. We provide a relatively complete view of topological structure and weight dynamics characteristics of the networks such as weight and strength distribution, degree correlations, average clustering coefficient and degree-cluster correlations as well as the diameter.     

基于感知流量算法的复杂网络拥塞问题研究

研究了在具有感知流量的路由策略下,复杂网络的拓扑结构对网络中传输流量的影响.为了描述数据包传输过程的有效性,通过引入一个状态参数,利用由稳态到拥塞的指标流量相变值来刻画网络的吞吐量.基于每个节点的数据包处理能力与该节点的度或介数成比例提出两种模型并进行仿真.仿真结果表明,平均度相同的情况下,模型Ⅰ中,WS小世界网络比ER随机网络和BA无标度网络更容易产生拥塞;模型Ⅱ中,所有网络容量都得到较大的提高,尤其是WS小世界网络.但当网络的基本连接参数改变时,哪种模型更利于网络的流量传输,还要依据网络本身的结构特性 关键词： 复杂网络 无标度网络 感知流量 拥塞     

Properties of Bottleneck on Complex Networks

The traffic bottleneck plays a key role in most of the natural and artificial network. Here we present a simply model for bottleneck dynamical characteristics consideration the reliability on the complex network by taking into account the network topology characteristics and system size. We find that there is a critical rate of flow generation below which the network traffic is free but above which traffic congestion occurs. Also, it is found that random networks have larger critical flow generating rate than scale free ones. Analytical results may be practically useful for designing networks, especially for the urban traffic network.     

Phase transition in evolution of traffic flow with scale-free property

This paper investigates the behaviour of traffic flow in traffic systems with a new model based on the NaSch model and cluster approximation of mean-field theory. The proposed model aims at constructing a mapping relationship between the microcosmic behaviour and the macroscopic property of traffic flow. Results demonstrate that scale-free phenomenon of the evolution network becomes obvious when the density value of traffic flow reaches at the critical point of phase transition from free flow to traffic congestion, and jamming is limited in this scale-free structure.     

On synchronizability and heterogeneity in unweighted networks

Synchronization in classes of continuous-time dynamical unweighted networks with different topologies is investigated. A synchronization-optimal network model based on rewiring of links is proposed. Compared with other networks, it exhibits a stronger synchronizability. We presented link density and investigated the correlation of synchronizability, link density and heterogeneity in degree distribution. In this work, it will be shown that synchronizability of Type I networks is independent of heterogeneity in the degree distribution when the link density is smaller than 0.02. Synchronizability and link density are proportional. When the link density is larger than 0.025, heterogeneity decides the curve slope. The synchronizability of Type II networks is drastically enhanced by enhancing the link density when the link density is smaller than 0.025. However synchronizability increases weakly by enhancing the link density when the link density is larger than 0.025.     

Traffic dynamics on layered complex networks

To minimize traffic congestion, understanding how traffic dynamics depend on network structure is necessary. Many real-world complex systems can be described as multilayer structures. In this paper, we introduce the idea of layers to establish a traffic model of two-layer complex networks. By comparing different two-layer complex networks based on random and scale-free networks, we find that the physical layer is much more important to the network capacity of two-layer complex networks than the logical layer. Two-layer complex networks with a homogeneous physical topology are found to be more tolerant to congestion. Moreover, simulation results show that the heterogeneity of logical and physical topologies makes the packet-delivery process of two-layer networks more efficient in the free-flow state, without the occurrence of traffic congestion.     

Dynamics of traffic networks: From microscopic and macroscopic perspectives

Considering the microscopic characteristics (vehicle speed, road length etc.) of links and macroscopic behaviors of traffic systems, we derive the critical flow generation rate in scale-free networks. And the dynamics of traffic congestion is studied numerically in this paper. It is shown that the queue length increases with microscopic characteristics of links. Additionally, the critical flow generation rate decreases with increase of the network size N, maximum speed v_max and parameter τ. The significance of this finding is that, in order to improve the traffic environment, both the local information for the single link and behaviors of the whole network must be analyzed simultaneously in a traffic system design.     

Traffic dynamics based on a traffic awareness routing strategy on scale-free networks

By incorporating local traffic information into the shortest path routing strategy, we numerically investigate the effectiveness of the traffic awareness routing strategy for scale-free networks with different clustering. In order to characterize the efficiency of the packet-delivery process, we introduce an order parameter and an average transmission time that allow us to measure the network capacity by the critical value of phase transition from free flow to congestion. Compared with the shortest path routing protocol, the network capacity is greatly enhanced by the traffic awareness routing strategy. We also find that there exists an optimum value for the tunable parameter in the congestion awareness strategy. Moreover, simulation results show that the more clustered the network, the less efficient the packet-delivery process.     

结合可视图的多状态交通流时间序列特性分析

交通流时间序列的研究主要采用数据挖掘和机器学习的方法,这些"黑箱"挖掘方法很难直观反映序列特性.为增强交通流时间序列及其特征分析的可视化性,结合可视图理论来构建交通流时间序列的关联网络,从复杂网络角度实现交通流时间序列的特性分析.在网络构建的过程中,考虑到不同交通状态下交通流表征具有的差异性,首先利用交通流参量的相关性对交通流状态进行分类,然后构建不同交通状态下的时间序列复杂网络,并对这些网络的特征属性给出统计分析,如度分布、聚类系数、网络直径、模块化等.研究表明,可视图法可为交通流时间序列映射到网络提供有效途径,并且不同状态下交通流时间序列构建的复杂网络的模块化、聚类系数和度分布等统计特征呈现一定的变化规律,为交通流运行态势的研究提供了可视化的分析角度.     

Stochastic modelling and analysis of mobility models for intelligent software defined internet of vehicles

Data traffic forwarding and network optimization is essential to effective congestion management in software-defined vehicular networks, and it is necessary for software-defined vehicle networks (SDVN). SDVN is needed to optimize connection performance and network controls in dense and sparse networks to govern data flow between nodes as effectively as possible. Intelligent software-defined internet of vehicles (iSDIoVs) has recently emerged as a potential technology for future vehicular networks. It manages the vehicular ad hoc networks systematically. The link connection of moving vehicles from the central SDN controller may fail. It impacts the efficiency and communication performance because of the lack of connection between vehicles and infrastructure (V2I). The researchers have analyzed the network performance and mobility models in a dense and sparse network to maximize network performance by iSDIoVs. By integrating heterogeneous systems such as IEEE 802.11p and cellular networks into vehicular ad-hoc networks, it is possible to reduce buffer occupancy in iSDIoV and control the mobility and delay bound analysis in V2V communication. The SDN will provide flexibility and reliability to the vehicular networks. An SDN controller manages the data flow in the vehicular network and controls the flow matching rules in the control plane. The iSDIoV and queuing models improve the response time and resource utilization and enhance the network complexity analysis for traffic management services.     

面向成本-收益好的无标度耦合网络构建方法

较大平均路径长度的网络会带来较大的网络延迟, 难以支持时间敏感业务与应用. 通过增加连接可以降低源和目的节点之间的跳数, 进而降低网络平均延迟, 使得更加快速地传播信息, 但是增加连接的同时也增加了网络构建成本. 分层网络是研究网络耦合的一个有效方法, 但目前网络构建过程中将每层网络分别处理并认为每层网络之间没有强相关性. 本文提出了一种面向成本-收益的无标度网络动态构建方法. 此方法将网络分为多层, 基于连续论在高层网络中添加连接, 使得网络演化为无标度网络. 此连续过程包括节点度增加过程和局部网络半径增长两个连续过程, 在增加连接的过程中引入表征网络构建成本和收益的成本-收益指标. 模拟结果表明引入成本-收益指标的无标度耦合网络构建方法能够在合理范围内有效降低网络平均路径长度, 提升网络性能, 并且本文给出了耦合网络的动态业务性能, 通过调整高层网络避免网络拥塞.     

Hopf bifurcation and uncontrolled stochastic traffic- induced chaos in an RED-AQM congestion control system

We study the Hopf bifurcation and the chaos phenomena in a random early detection-based active queue management (RED-AQM) congestion control system with a communication delay. We prove that there is a critical value of the communication delay for the stability of the RED-AQM control system. Furthermore, we show that the system will lose its stability and Hopf bifurcations will occur when the delay exceeds the critical value. When the delay is close to its critical value, we demonstrate that typical chaos patterns may be induced by the uncontrolled stochastic traffic in the RED-AQM control system even if the system is still stable, which reveals a new route to the chaos besides the bifurcation in the network congestion control system. Numerical simulations are given to illustrate the theoretical results.     

Impact of the Next-Nearest-Neighbor Interaction on Traffic Flow of Highway with Slopes

In this paper,we study the motion course of traffic flow on the slopes of a highway by applying a microscopic traffic model,which takes into account the next-nearest-neighbor interaction in an intelligent transportation system environment.Three common gradients of the highway,which are sag terrain,uphill terrain,and downhill terrain on a single-lane roadway,are selected to clarify the impact on the traffic flow by the next-nearest-neighbor interaction in relative velocity.We obtain the current-density relation for traffic flow on the sag,the uphill and the downhill under the next-nearest-neighbor interaction strategy.It is observed that the current saturates when the density is greater than a critical value and the current decreases when the density is greater than another critical value.When the density falls into the intermediate range between the two critical densities it is also found that the oscillatory jam,easily leads to traffic accidents,often appears in the downhill stage,and the next-nearest-neighbor interaction in relative velocity has a strong suppressing effect on this kind of dangerous congestion.A theoretical analysis is also presented to explain this important conclusion.     

Complex propagation on directed small world networks

The effect of directionality on the information propagation in a contagion model with complex propagation, i.e., that takes into account the need for simultaneous exposure to multiple activation sources, is studied. While it is known that complex propagation is blocked with increasing network randomness, here it is shown that network directionality affects such a result, leading to several different behaviors depending on the preservation of the in-degree or out-degree. The critical points for the occurrence of complex propagation in 1D directed small world networks are determined. It is shown that these points only depend on the number of outgoing links.     

The effect of TTL on the information traffic

In real communication protocols, the information packets have a finite Time-to-Live (TTL) to avoid the waste of network resources, such as infinite loop induced by routing error or too long transferring time. In this paper, we introduce TTL into the information traffic model on Barabási-Albert scale-free networks under local routing strategy and focus on its effect on the network capacity measured by the critical point (R_c) of phase transition from free flow to congestion. Simulations show that the network capacity and the communication velocity are improved. However, some packets are dropped before they arrived at destinations. It is found that the share of successfully arrived packets monotonously increases with the increment of TTL and it is considerably acceptable if TTL is not very small. We also examine the effect of TTL on the positive-feedback preference (PFP) internet model and the results are alike. Our work may be helpful in quantifying the effect of packet lifetime in real communication networks and in routing strategy designing.     

有业务量疏导能力的WDM网格网阻塞性能分析

提出一个新分析模型来计算有业务量疏导能力的波分复用(WDM)网格网的呼叫阻塞概率,WDM网络中的业务量疏导定义为复用、解复用和交换低速率业务量到高容量光路的行为.该模型首先把原始网络分解为单个子系统,然后再对这些子系统进行独立分析,最后对这些子系统的结果进行适当组合得到整个网络的解.同时,模型考虑了链路负载和链路阻塞事件之间的相关性.仿真结果表明该模型给出的结果较准确.     

Road traffic: A case study of flow and path-dependency in weighted directed networks

How much can we tell about flows through networks just from their topological properties? Whereas flow distributions of river basins, trees or cardiovascular systems come naturally to mind, more complex topologies are not so immediate, especially if the network is large and heterogeneously directed. Our study is motivated by the question of how the distribution of path-dependent trails in directed networks is correlated to the distribution of network flows. As an example we have studied the path-dependencies in closed trails in four metropolitan areas in England and the USA and computed their global and spatial correlations with measured traffic flows. We have found that the heterogeneous distribution of traffic intensity is mirrored by the distribution of agglomerate path-dependency and that high traffic roads are packed along corridors at short-to-medium trail lengths from the ensemble of nodes.