共查询到20条相似文献,搜索用时 0 毫秒
1.
We propose a dynamic packet routing strategy by using neural networks on scale-free networks. In this strategy, in order to determine the nodes to which the packets should be transmitted, we use path lengths to the destinations of the packets, and adjust the connection weights of the neural networks attached to the nodes from local information and the path lengths. The performances of this strategy on scale-free networks which have the same degree distribution and different degree correlations are compared to one another. Our numerical simulations confirm that this routing strategy is more effective than the shortest path based strategy on scale-free networks with any degree correlations and that the performance of our strategy on assortative scale-free networks is better than that on disassortative and uncorrelated scale-free networks. 相似文献
2.
提出了一种能够显著提高无标度复杂网络负载传输性能的优化路由策略.实现了负载在核心节点与边缘节点间的合理分配.分析表明该策略使得网络的负载处理能力正比于网络规模的平方,而与单个节点的度值无关.实验结果显示优化路由策略在保持了最短路由策略小世界效应的同时,成倍地提升了网络的负载传输能力,且随着网络平均节点度的增加其优势越趋显著.此外,与有效路由策略的比较进一步验证了优化路由策略的优异性能.
关键词:
优化路由策略
复杂网络
负载传输
网络阻塞 相似文献
3.
复杂网络的传输能力是其功能正常运转的重要保障,提高网络的吞吐量有着重要意义.提出一种新的高效路由策略,以提高复杂网络的传输能力,称之为加权路由策略.即对网络的每一条边加权,权值与该边的两端节点的度相关,然后数据包按照这个加权网络的最短路径路由.这样的路径可以更均匀地经过各个节点,发挥它们的传输能力,极大地提高网络的吞吐量.可以避免数据包集中地通过个别度大的节点,在这些节点发生拥塞.仿真显示,该策略比传统的最短路径策略优越,对很多结构的网络,可以提高几十倍的吞吐量.
关键词:
复杂网络
路由策略
吞吐量
拥塞 相似文献
4.
This study proposes a probability routing strategy for improving traffic capability on scale-free networks. Compared with the shortest path routing strategy depending on central nodes largely and the efficient routing strategy avoiding hub routers as much as possible, the probability routing strategy makes use of hub routers more efficiently, transferring approximate average amount of packs of the whole network. Simulation results indicate that the probability routing strategy has the highest network capacity among the three routing strategies. This strategy provides network capacity that can be more than 30 times higher than that of the shortest path routing strategy and over 50% higher than that of the efficient routing strategy. In addition, the average routing path length of our proposed strategy is over 10% shorter than that of the efficient routing strategy and only about 10% longer than that of the shortest path routing strategy. 相似文献
5.
现有的复杂网络路由策略很多,改进算法也不断涌现,但是目前还没有一个统一的标准来衡量算法是否达到网络最佳传输效果.针对这一问题,本文提出一种适用于现有路由策略的普适优化算法.首先通过理论分析指出制约网络传输能力的关键因素是最大介数中心度,因而"最大介数中心度是否已经最低"成为评判路由策略是否最优的标准.在此基础上,采用"惩罚选择法"避开网络中介数中心度值比较大的节点,使网络介数中心度值分布更均匀,均衡网络中各个节点的传输负载.仿真结果显示,该优化算法针对现有路由策略均能降低最大介数中心度值,大幅度提高网络的传输能力. 相似文献
6.
在对随机行走过程的研究中发现:单个粒子通过某条特定路径的时间正比于该路径上所有节点度的连乘积.据此,文章提出基于随机行走机理的优化路由改进策略.该策略以节点度连乘积最小化为原则,通过调节可变参数,建立节点处理能力均匀分布的情况下最佳路由策略.通过分析比较不同路由策略条件下平均路由介数中心度,网络的临界负载量,平均路径长度以及平均搜索信息量等性能指标,研究结果表明,此改进路由策略在保证网络平均路径长度较少增加的前提下,使网络的传输能力获得最大幅度的提升.
关键词:
复杂网络
路由策略
负载传输 相似文献
7.
提出一种复杂网络上的局部路由策略,算法采用节点收缩法评估节点的重要度,发送节点根据邻居节点的重要度及网络的状态自适应地调整向邻居节点转发数据包的概率.在网络处于自由流通状态时充分发挥关键节点的优势,保证数据包快速到达目的地;在网络处于即将拥塞时分散业务,根据节点重要度准确识别网络中的关键节点,通过有效分流予以保护.仿真结果表明:在网络处于自由流通状态时,该局部路由策略能充分发挥网络中关键节点的枢纽作用,保持较低的传输时延;在网络部分关键节点出现拥塞时,该局部路由策略能有效避开拥挤严重的节点,将数据包均匀地分布在各个节点上,有效抑制网络拥塞,提高网络的容量. 相似文献
8.
Different loads in the network require distinct Qo S standard, while present routing strategies for complex networks ignored this fact. To solve this problem, we designed a routing strategy RS-MP with multiple priorities by which packets are classified into privileged-packets and common-packets. In RS-MP, privileged-packets route by the Shortest Path Algorithm, and do not need to queue up. Common-packets' routes are determined by a new factor BJmax of the network. The BJmax stands for the largest betweenness centrality. By minimizing BJmax, the throughout capacity of the network can be maximized. The simulation results show that RS-MP can guarantee privileged-packets with the shortest path length and smallest delay, and maximized throughout capacity for common packets in the no-congestion state. 相似文献
9.
The most important function of a network is for transporting traffic. Due to the low traffic capacity of network systems under the global shortest path routing, plenty of heuristic routing strategies are emerging. In this paper, we propose a heuristic routing strategy called the incremental routing algorithm to improve the traffic capacity of complex networks. We divide the routing process into N(the network size) steps and, at each step, we heuristically calculate all the routes for one source node considering both the dynamic efficient betweenness centrality and node degree information. We do extensive simulations on scale-free networks to confirm the effectiveness of the proposed incremental routing strategy. The simulation results show that the traffic capacity has been enhanced by a substantial factor at the expense of a slight lengthening in the average path. 相似文献
10.
利用引力场理论对网络传输过程中节点激发的引力场进行了描述,建立了节点的引力场方程,引入α和γ两个参数,用于调节数据传输对节点畅通程度、节点传输能力和路径长度的依赖程度.基于节点的引力场,提出了一种高效的路由选择算法,该算法下数据包将沿着所受路径引力最大的方向进行传递.为检验算法的有效性,引入有序状态参数卵,利用其由自由流到拥塞态的指标流量相变值度量网络的吞吐量,并通过节点的介中心值B分析网络的传输性能和拥塞分布.针对算法在不同α,γ取值条件下的路由情况进行了仿真.仿真结果显示,与传统最短路由算法相比,本文算法将网络传输能力提高了数倍,有效地均衡了节点的介中心值分布,传输路径平均长度(Lavg)随负载量R的增加表现出先增后减的变化趋势,而参数α与γ值的变化对网络传输能力几乎没有影响,说明本文路由算法的性能不依赖于α与γ,对于可行域内任意的α与γ算法都能保证网络传输能力近似相等. 相似文献
11.
12.
This paper presents a new routing strategy by introducing a tunable parameter into the minimum information path routing strategy we proposed previously.It is found that network transmission capacity can be considerably enhanced by adjusting the parameter with various allocations of node capability for packet delivery.Moreover,the proposed routing strategy provides a traffic load distribution which can better match the allocation of node capability than that of traditional efficient routing strategies,leading to a network with improved transmission performance.This routing strategy,without deviating from the shortest-path routing strategy in the length of paths too much,produces improved performance indexes such as critical generating rate,average length of paths and average search information. 相似文献
13.
The principal purpose of Ad-Hoc wireless networks is to increase service efficiency in terms of transmission scheduling and packet transfer rate. The approaches that assume frame unicity to satisfy a given set of packets minimize the end-to-end delay. However, they do not guarantee a maximum packet delivery rate due to the difficulty of establishing robust paths for packet transfer across nodes deployed in the network, especially in a three-dimensional (3D) environment. The objective is to minimize the end-to-end delay by ensuring the maximum delivery of packets to their destinations. Furthermore, the signal-to-interference-and-noise-ratio (SINR) model is considered to optimize transmission scheduling. In this paper, an optimal node coordinates optimization approach is proposed to extend two recently investigated schemes in the literature (S-RDSP and I-RDSP). The developed algorithms, named S-MPDR and I-MPDR, seek to reduce the end-to-end delay by delivering a collection of inserted packets over a 3D environment while also maximizing the delivery rate of these packets. Desirability functions are used to evaluate the network’s performance in various scenarios involving two different environments, Level 0 and Level 1. Numerical results demonstrate that the developed algorithms outperform both schemes in terms of end-to-end delay and packet delivery rate. In the Level 0 environment, the overall minimum delay and packet delivery rate scores provided by S-MPDR are increased by 28% and 88% compared to S-RDSP, respectively. In comparison, those provided by I-MPDR are increased by 24% and 16% compared to I-RDSP. Similarly, in the Level 1 environment, the scores provided by S-MPDR are increased by 25% and 100% compared to S-RDSP, respectively, while those provided by I-MPDR are increased by 23% and 25% compared to I-RDSP. 相似文献
14.
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]. 相似文献
15.
Network topological optimization for packet routing using multi-objective simulated annealing method
Wei Huang 《Physica A》2010,389(4):871-880
A new multi-objective simulated annealing (MOSA) algorithm is proposed for optimizing network topology. In this paper, the MOSA algorithm is used to perform two-objective simultaneous optimization. The two objectives examined in this paper are the critical packet generation rate, and average number of overall packet loads. Our results indicate that homogeneous networks can support a large critical packet generation rate under the congestion-free state, but the networks must be able to sustain relatively heavy packet load pressure if the same packet generation rate is assigned to a more heterogeneous network. At the same time, it is also found that heterogeneous networks can relieve packet load pressure, but the network is likely to become congested due to an abrupt increase of packet loads. We find that when the network size is large, lowering the average number of packet loads and raising the critical packet generation rate need not to be compromised too much. We also point out that networks can be more robust to abrupt increase of packet loads if networks are structured more homogeneously in the process of network size increment. 相似文献
16.
17.
In this paper, we propose a new routing strategy based on the minimum information path, named the optimal routing (OR) strategy, to improve the transportation capacity of scale-free networks. We define the average routing centrality degree of the node to analyze the traffic load on nodes of different degree. We analyze the transportation capacity by using the critical values of Rc, the average packet travel time, and the average path length. Both theoretical and experimental results show that the capacity of the network under our strategy will be maximized when the packet-delivery rate of the node is directly proportional to the degree. 相似文献
18.
Precisely quantifying the heterogeneity or disorder of network systems is important and desired in studies of behaviors and functions of network systems. Although various degree-based entropies have been available to measure the heterogeneity of real networks, heterogeneity implicated in the structures of networks can not be precisely quantified yet. Hence, we propose a new structure entropy based on automorphism partition. Analysis of extreme cases shows that entropy based on automorphism partition can quantify the structural heterogeneity of networks more precisely than degree-based entropies. We also summarized symmetry and heterogeneity statistics of many real networks, finding that real networks are more heterogeneous in the view of automorphism partition than what have been depicted under the measurement of degree-based entropies; and that structural heterogeneity is strongly negatively correlated to symmetry of real networks. 相似文献
19.
20.
Community structure is an important feature in many real-world networks. Many methods and algorithms for identifying communities have been proposed and have attracted great attention in recent years. In this paper, we present a new approach for discovering the community structure in networks. The novelty is that the algorithm uses the strength of the ties for sorting out nodes into communities. More specifically, we use the principle of weak ties hypothesis to determine to what community the node belongs. The advantages of this method are its simplicity, accuracy, and low computational cost. We demonstrate the effectiveness and efficiency of our algorithm both on real-world networks and on benchmark graphs. We also show that the distribution of link strength can give a general view of the basic structure information of graphs. 相似文献