互联网络数据包传输的一种简单元胞自动机模型

提出了一种描述计算机互联网络数据包传输的简单元胞自动机模型,并研究了沿着网络固定路径中路由节点数据包队列长度和传输时间的统计特性.计算机仿真结果表明,根据数据包输入速率和路由节点平均最大传输速率的不同,系统存在自由流和拥塞两种相态.在自由流状态,路由节点数据包排队长度和传输时间都呈现幂律特性;在拥塞状态,路由节点数据包排队长度呈现白噪声特征,而传输时间在低频段为幂律、高频段为白噪声特征.仿真结果和已有文献和经验数据得到的结论一致. 关键词： 元胞自动机 1//f噪声 幂律 计算机网络     

复杂网络的一种加权路由策略研究

复杂网络的传输能力是其功能正常运转的重要保障,提高网络的吞吐量有着重要意义.提出一种新的高效路由策略,以提高复杂网络的传输能力,称之为加权路由策略.即对网络的每一条边加权,权值与该边的两端节点的度相关,然后数据包按照这个加权网络的最短路径路由.这样的路径可以更均匀地经过各个节点,发挥它们的传输能力,极大地提高网络的吞吐量.可以避免数据包集中地通过个别度大的节点,在这些节点发生拥塞.仿真显示,该策略比传统的最短路径策略优越,对很多结构的网络,可以提高几十倍的吞吐量. 关键词： 复杂网络 路由策略 吞吐量 拥塞     

基于最短路径长度的空间网络路由

以通信网、电力网、交通网为代表的很多复杂网络以传输负载为基本功能.在这些网络中,网络的吞吐量是衡量网络传输性能的重要指标,如何提升网络的吞吐量是研究热点之一.不少研究人员提出了不同的路由算法,通过调节传输路径来提高网络吞吐量.但之前的研究很少考虑网络中节点的空间位置.本文针对空间网络提出了一种高效的路由策略,通过节点位置得到路径长度;采用该算法,负载从源节点沿着最短长度的路径传输到目标节点.为了检验算法的有效性,采用网络从自由流状态转变成拥塞状态的相变点Rc来衡量网络的吞吐量.在匀质和异质空间网络上的仿真表明,与传统的最少跳数路由策略相比,本文提出的基于最短路径长度的路由算法能有效提高空间网络的吞吐量.     

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

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

无标度网络中基于能量的混合路由策略

针对节点能量受限的静态无标度网络,提出了一种基于能量和最短路径相结合的路由策略.该策略综合考虑邻居节点的能量水平和其到目的节点的最短路径长度,利用控制参数β调节二者的权重.仿真结果表明,存在最佳的β值使得网络生存时间和数据包到达数达到最大值.最后,基于提出的路由策略研究了网络结构特征与网络生存时间之间的关系.     

计算机网络的长程相关特性

针对一种计算机网络模型，利用节点排队长度累计量的均方涨落函数，研究了网络节点在时间上的长程相关特性.结果表明，随着负载的增加，网络节点数据包排队长度在时间上由自由流状态的不相关或短程相关逐渐演变为临界和拥塞时的长程相关，关联范围逐渐增大，长程关联特性开始显现.在自由流状态时，节点的不相关或短程相关，并且有一致的数值为0.5的幂指数这一典型特征.而在临界状态时，节点数据包排队长度长程相关，有大于0.5的幂指数为特征.并且随网络规模的增大，节点间的群体作用逐渐显著，幂指数呈下降趋势. 关键词： 计算机网络 相变 长程相关 幂律     

基于耦合强度的双层网络数据传输能力

为了降低网络拥塞,提升网络传输性能,对双层网络之间的耦合机理进行研究,层间关系依据度度相关性分成三种耦合方式:随机耦合、异配耦合、同配耦合.在基于最短路径路由策略和基于度的权重路由策略条件下,分析网络数据包的传输过程,并研究双层网络的耦合方式及其适合的路由策略对网络传输容量的影响.采用双层无标度网络进行仿真实验,分析在路由策略约束下传输容量和耦合方式之间的关系,依据双层网络之间耦合方式的特点,找出适合每一种路由策略的最佳耦合方式以提升网络的传输容量.经过仿真发现,采用最短路径路由策略时,异配耦合方式最佳;采用基于度的静态权重路由策略时,同配耦合方式最佳.路由策略在匹配的耦合方式下使得网络流量分配均匀,有利于网络传输容量的提升.本研究为实际网络设计和传输性能优化提供了理论基础.     

基于引力约束的复杂网络拥塞问题研究

如何在保证网络传输效率的同时提高网络的吞吐量是目前研究的主要问题. 通过研究节点对数据包传递过程的引力作用,提出了一种具有引力约束的路由算法. 为检验算法的有效性,通过引入一个状态参数H, 利用由稳态到拥塞状态的指标流量相变值来度量网络的吞吐量, 同时利用数据包的最大传输时间〈T_max〉 与平均传输时间 〈T_avg〉来分析网络的传输效率. 针对算法在不同引力约束条件下的路由情况进行了仿真.仿真结果表明, 若数据传递过程只考虑路径长度最短,则会导致网络吞吐量较低且流量分布极不均匀; 若只顾及等待时间最短,会导致传输路径过度迂回且大部分节点都会陷入拥塞状态; 同时考虑路径长度和等待时间的引力作用并选取适当引力的节点进行传递, 可以显著提高网络吞吐量并缓解网络的拥塞程度.     

无标度复杂网络负载传输优化策略

提出了一种能够显著提高无标度复杂网络负载传输性能的优化路由策略.实现了负载在核心节点与边缘节点间的合理分配.分析表明该策略使得网络的负载处理能力正比于网络规模的平方,而与单个节点的度值无关.实验结果显示优化路由策略在保持了最短路由策略小世界效应的同时,成倍地提升了网络的负载传输能力,且随着网络平均节点度的增加其优势越趋显著.此外,与有效路由策略的比较进一步验证了优化路由策略的优异性能. 关键词： 优化路由策略 复杂网络 负载传输 网络阻塞     

无标度网络上队列资源分配研究

研究了节点队列资源有限的条件下,无标度网络上的信息流动力学过程,发现了网络由自由流通到拥塞的相变现象,提出了一种基于节点度的队列资源分配模型.模型的核心是使节点i的队列长度与kβi成正比(ki为节点i的度,β为分配参数).仿真结果表明,在网络使用最短路径算法进行信息包传送的条件下,β近似等于1.25时队列资源分配最合理,网络容量最大,且该最佳值与队列总资源多少以及网络的规模无关.     

基于节点相关性的网络不动点理论研究

现代复杂的通信网络内部存在着广泛的幂律现象，网络节点之间存在相关特性. 根据这种相关特性，提出了网络不动点理论. 将Banach不动点理论引入网络模型，证明了网络不动点理论的正确有效性. 证明过程是把通信网络看作由路径预测算法产生的似马尔可夫链的路由节点迭代序列形成的网络空间. 由节点相关性可知，此空间中的节点序列相对越长就越能折射出搜索的目标所在，预测准确率也会逐步增加，可以更好地进行目标定位、数据挖掘等. 通过某种路由准则的算子从源节点最终映射到的目的节点与Banach空间的不动点相对应，即为网络空间的不动点. 当网络发展到能为用户提供真正的无处不在的连接时，网络不动点理论的物理特性将非常明显. 因为网络规模越大，节点间的群体作用越显著，就越能显现网络不动点理论的物理特性. 关键词： 计算机网络 长程相关 不动点 幂律     

Efficient packet routing strategy in complex networks

We investigate a new efficient packet routing strategy which mitigates traffic congestion on complex networks. In order to avoid congestion, we minimize the maximum betweenness, which is a measure for concentration of routing paths passing through a node in the network. Danila et al. propose a packet routing strategy in which, instead of shortest paths, they used efficient paths, which are the paths with the minimum total summations of weights assigned to nodes in the respective paths. They use a heuristic algorithm in which the weights are updated step by step by using the information of betweenness of each node in every step and the respective total summations of weights for paths through the nodes with large degrees become comparatively large. Thus passage through such nodes, where congestion almost occurs, is likely to be avoided in their algorithm. The convergence time by their algorithm is, however, quite long. In this paper, we propose a new efficient heuristic algorithm which balances traffic on networks by achieving minimization of the maximum betweenness in the much smaller number of iteration steps for convergence than that by the algorithm of Danila et al.     

Adaptive local routing strategy on a scale-free network

Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load (packet queue length) and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated (whose queue lengths are longer than their critical queue lengths), more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies.     

Efficient routing on small complex networks without buffers

In this paper, we are exploring strategies for the reduction of the congestion in the complex networks. The nodes without buffers are considered, so, if the congestion occurs, the information packets will be dropped. The focus is on the efficient routing. The routing strategies are compared using two generic models, i.e., Barabàsi–Albert scale-free network and scale-free network on lattice, and the academic router networks of the Netherlands and France. We propose a dynamic deflection routing algorithm which automatically extends path of the packet before it arrives at congested node. The simulation results indicate that the dynamic routing strategy can further reduce the number of dropped packets in a combination with the efficient path routing proposed by Yan et al. [5].     

一种有效提高无标度网络负载容量的管理策略

现有研究表明明显的社团结构会显著降低网络的传输性能. 本文基于网络邻接矩阵的特征谱定义了链路对网络社团特性的贡献度, 提出一种通过逻辑关闭或删除对网络社团特性贡献度大的链路以提高网络传输性能的拓扑管理策略, 即社团弱化控制策略(CWCS 策略). 在具有社团结构的无标度网络上分别进行了基于全局最短路径路由和局部路由的仿真实验, 并与关闭连接度大的节点之间链路的HDF 策略进行了比较. 仿真实验结果显示, 在全局最短路径路由策略下, CWCS策略能更有效地提高网络负载容量, 并且网络的平均传输时间增加的幅度变小. 在局部路由策略下, 当调控参数0<α<2, 对网络负载容量的提升优于HDF策略. 关键词： 复杂网络 社团特性 负载容量 拓扑管理     

The Effect of Queueing Strategy on Network Traffic

In recent years, the transportation system has been faced by increasing challenge in congestion and inefficiency, and research in traffic network has become a significant area of interest. In this paper, we introduce a dynamic-information-based (DIB) queueing strategy into network traffic model under the efficient routing strategy. DIB makes a packet with higher priority to be delivered if there are less packets travelling along its path from the current node to the destination. It is found that, compared with the traditional first-in-first-out (FIFO) queueing strategy, DIB can effectively balance the traffic load of the system via delaying packets to be delivered to congested nodes. Although the network capacity has no obvious changes, some other indexes which reflect transportation efficiency are efficiently improved in the congestion state. Besides, extensive simulation results and discussions are provided to explain the phenomena. The results may provide novel insights for research on traffic systems.     

The Efect of Queueing Strategy on Network Trafc

In recent years,the transportation system has been faced by increasing challenge in congestion and inefciency,and research in trafc network has become a significant area of interest.In this paper,we introduce a dynamic-information-based(DIB)queueing strategy into network trafc model under the efcient routing strategy.DIB makes a packet with higher priority to be delivered if there are less packets travelling along its path from the current node to the destination.It is found that,compared with the traditional first-in-first-out(FIFO)queueing strategy,DIB can efectively balance the trafc load of the system via delaying packets to be delivered to congested nodes.Although the network capacity has no obvious changes,some other indexes which reflect transportation efciency are efciently improved in the congestion state.Besides,extensive simulation results and discussions are provided to explain the phenomena.The results may provide novel insights for research on trafc systems.     

A dynamic routing strategy with limited buffer on scale-free network

In this paper, we propose an integrated routing strategy based on global static topologyinformation and local dynamic data packet queue lengths to improve the transmissionefficiency of scale-free networks. The proposed routing strategy is a combination of aglobal static routing strategy (based on the shortest path algorithm) and local dynamicqueue length management, in which, instead of using an infinite buffer, the queue lengthof each node i in the proposed routing strategy is limited by acritical queue length Q_ic. When the networktraffic is lower and the queue length of each node i is shorter than itscritical queue length Q_ic, it forwardspackets according to the global routing table. With increasing network traffic, when thebuffers of the nodes with higher degree are full, they do not receive packets due to theirlimited buffers and the packets have to be delivered to the nodes with lower degree. Theglobal static routing strategy can shorten the transmission time that it takes a packet toreach its destination, and the local limited queue length can balance the network traffic.The optimal critical queue lengths of nodes have been analysed. Simulation results showthat the proposed routing strategy can get better performance than that of the globalstatic strategy based on topology, and almost the same performance as that of the globaldynamic routing strategy with less complexity.     

Optimization of transport protocols in complex networks

In this paper, an optimal routing strategy is proposed to enhance the traffic capacity of complex networks. In order to avoid nodes overloading, the new algorithm is derived on the basis of generalized betweenness centrality which gives an estimate of traffic handled by the node for a route set. Since the nodes with large betweenness centrality are more susceptible to traffic congestion, the traffic can be improved, as our strategy, by redistributing traffic load from nodes with large betweenness centrality to nodes with small betweenness centrality in the proceeding of computing collective routing table. Particularly, depending on a parameter that controls the optimization scale, the new routing can not only enlarge traffic capacity of networks more, but also enhance traffic efficiency with smaller average path length. Comparing results of previous routing strategies, it is shown that the present improved routing performs more effectively.