首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 181 毫秒
1.
Xiao-Gai Tang 《Physica A》2009,388(22):4797-4802
We study the information traffic in scale-free networks where the information generation rate varies with time as a periodic function. We observe that when the fluctuation in packet generation rate increases, the average transit time increases and network performance degrades. In order to improve the transportation efficiency in this situation, we propose a new routing method called mixed routing. It operates in two modes: (1) when the packet generation rate is small, the shortest paths are used to deliver the packets to the destination; (2) when the packet generation rate is large, the traffic loads in central nodes are redistributed to other non-central nodes, using the so-called efficient routing method. We find that the time shifting between the two modes is very critical for the routing performance. Consequently, we provide an efficient method to determine the critical times to shift the routing modes for achieving good network performance.  相似文献   

2.
Many real communication networks, such as oceanic monitoring network and land environment observation network,can be described as space stereo multi-layer structure, and the traffic in these networks is concurrent. Understanding how traffic dynamics depend on these real communication networks and finding an effective routing strategy that can fit the circumstance of traffic concurrency and enhance the network performance are necessary. In this light, we propose a traffic model for space stereo multi-layer complex network and introduce two kinds of global forward-predicting dynamic routing strategies, global forward-predicting hybrid minimum queue(HMQ) routing strategy and global forward-predicting hybrid minimum degree and queue(HMDQ) routing strategy, for traffic concurrency space stereo multi-layer scale-free networks. By applying forward-predicting strategy, the proposed routing strategies achieve better performances in traffic concurrency space stereo multi-layer scale-free networks. Compared with the efficient routing strategy and global dynamic routing strategy, HMDQ and HMQ routing strategies can optimize the traffic distribution, alleviate the number of congested packets effectively and reach much higher network capacity.  相似文献   

3.
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 Qic. When the networktraffic is lower and the queue length of each node i is shorter than itscritical queue length Qic, 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.  相似文献   

4.
周思源  王开  张毅锋  裴文江  濮存来  李微 《中国物理 B》2011,20(8):80501-080501
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.  相似文献   

5.
The dynamics of information traffic over scale-free networks has been investigated systematically. A series of routing strategies of data packets have been proposed, including the local routing strategy, the next-nearest-neighbour routing strategy, and the mixed routing strategy based on local static and dynamic information. The capacity of the network can be quantified by the phase transition from free flow state to congestion state. The optimal parameter values of each model leading to the highest efficiency of scale-free networked traffic systems have been found. Moreover, we have found hysteretic loop in networked traffic systems with finite packets delivering ability. Such hysteretic loop indicates the existence of the bi-stable state in the traffic dynamics over scale-free networks.   相似文献   

6.
一种基于分层的量子分组传输方案及性能分析   总被引:1,自引:0,他引:1       下载免费PDF全文
王林飞  聂敏  杨光  张美玲  裴昌幸 《物理学报》2016,65(13):130302-130302
大规模量子通信网络中,采用量子分组传输技术能有效提升发送节点的吞吐量,提高网络中链路的利用率,增强通信的抗干扰性能.然而量子分组的快速传输与路由器性能息息相关.路由器性能瓶颈将严重影响网络的可扩展性和链路的传输效率.本文提出一种量子通信网络分层结构,并根据量子密集编码和量子隐形传态理论,给出一种基于分层的量子分组信息传输方案,实现端到端的量子信息传输.该方案先将量子分组按照目的地址进行聚类,再按聚类后的地址进行传输.仿真结果表明,基于分层的量子分组信息传输方案能够有效减少量子分组信息在量子通信网络中的传输时间,并且所减少的时间与量子路由器性能与发送的量子分组数量有关.因此,本文提出的量子分组信息传输方案适用于大规模量子通信网络的构建.  相似文献   

7.
刘锋  赵寒  李明  任丰原  朱衍波 《中国物理 B》2010,19(4):40513-040513
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.  相似文献   

8.
We propose a novel routing algorithm to optimize traffic performance on complex networks. It combines static structural properties and dynamic traffic conditions together and therefore can balance the traffic between hubs and peripheral nodes more effectively. Simulation results show that the network capacity can be enhanced considerably, and the average traveling time is also shortened sharply, compared with the other two recently-proposed routing algorithms. The effect of the timescale over which the routing information is updated is also investigated. Moreover, a counter-intuitive and beneficial phenomenon about the average traveling time emerges when the packet generation rate is relatively high.  相似文献   

9.
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].  相似文献   

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

11.
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 NN(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.  相似文献   

12.
A non-blocking optical Ethernet switching architecture with liquid crystal on a silicon-based beam-steering switch and optical output buffer strategies are proposed. For preserving service packet sequencing and fairness of routing sequence, priority and round-robin algorithms are adopted at the optical output buffer in this research. Four methods were used to implement tunable fiber delay modules for the optical output buffers to handle Ethernet packets with variable bit-rates. The results reported are based on the simulations performed to evaluate the proposed switching architecture with traffic analysis under a traffic model captured from a real-core network.  相似文献   

13.
Cai-Long Chen  Wen-Bo Du 《Physica A》2010,389(21):4571-3988
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 (Rc) 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.  相似文献   

14.
We explore packet traffic dynamics in a data network model near phase transition point from free flow to congestion. The model of data network is an abstraction of the Network Layer of the OSI (Open Systems Interconnect) Reference Model of packet switching networks. The Network Layer is responsible for routing packets across the network from their sources to their destinations and for control of congestion in data networks. Using the model we investigate spatio-temporal packets traffic dynamics near the phase transition point for various network connection topologies, and static and adaptive routing algorithms. We present selected simulation results and analyze them.  相似文献   

15.
In this paper we systematically investigate the impact of community structure on traffic dynamics in scale-free networks based on local routing strategy. A growth model is introduced to construct scale-free networks with tunable strength of community structure, and a packet routing strategy with a parameter α is used to deal with the navigation and transportation of packets simultaneously. Simulations show that the maximal network capacity stands at α=−1 in the case of identical vertex capacity and monotonously decreases with the strength of community structure which suggests that the networks with fuzzy community structure (i.e., community strength is weak) are more efficient in delivering packets than those with pronounced community structure. To explain these results, the distribution of packets of each vertex is carefully studied. Our results indicate that the moderate strength of community structure is more convenient for the information transfer of real complex systems.  相似文献   

16.
In this paper, we study the information traffic flow in communication networks with scale-free topology. We consider the situation arising when packets are delivered to non-homogeneously selected destinations. It is found that the network capacity Rc increases with the increase of 〈k〉 (average degree of destination nodes) under local routing strategy. In contrast, Rc is essentially independent of 〈k〉 under shortest path strategy. Based on this finding, an integrated routing strategy that can enhance network capacity is proposed by combining the two strategies.  相似文献   

17.
Uma Rathore Bhatt  Sanjiv Tokekar 《Optik》2011,122(16):1466-1469
In this paper dynamic routing and wavelength assignment strategies have been proposed for multiclass WDM optical networks. Multiclass optical networks provide multiple classes of services to the subscriber according to the requirement, which in turn increase operational profitability. Each class of service could be characterized by parameters like number of wavelengths, expected call holding time and average arrival rate of request. The proposed strategies have been analyzed and compared with existing strategies on the basis of blocking probabilities for multiclass traffic scenarios. Simulation results on different network topologies demonstrate that the performance of proposed strategies “Fixed shortest/alternate shortest path routing with wavelength reservation (FSASWR)” and “Fixed alternate shortest path routing with least priority wavelength assignment (FASPL)” are much better as compared to existing strategies. Proposed strategies minimize blocking probability of the multiclass network using limited number of wavelengths.  相似文献   

18.
In this paper, we propose an efficient strategy to enhance traffic capacity via the process of nodes and links increment. We show that by adding shortcut links to the existing networks, packets are avoided flowing through hub nodes. We investigate the performances of our proposed strategy under the shortest path routing strategy and the local routing strategy. Our obtained results show that using the proposed strategy, the traffic capacity can be effectively enhanced under the shortest path routing strategy. Under the local routing strategy, the obtained results show that the proposed strategy is efficient only when packets are more likely to be forwarded to low-degree nodes in their routing paths. Compared with other strategies, the obtained results indicate that our proposed strategy of adding nodes and links is the most effective in enhancing the traffic capacity, i.e., the traffic capacity can be maximally enhanced with the least number of additional nodes and links.  相似文献   

19.
We investigate the similarities and differences among three queue rules, the first-in-first-out(FIFO) rule, last-in-firstout(LIFO) rule and random-in-random-out(RIRO) rule, on dynamical networks with limited buffer size. In our network model, nodes move at each time step. Packets are transmitted by an adaptive routing strategy, combining Euclidean distance and node load by a tunable parameter. Because of this routing strategy, at the initial stage of increasing buffer size, the network density will increase, and the packet loss rate will decrease. Packet loss and traffic congestion occur by these three rules, but nodes keep unblocked and lose no packet in a larger buffer size range on the RIRO rule networks. If packets are lost and traffic congestion occurs, different dynamic characteristics are shown by these three queue rules. Moreover, a phenomenon similar to Braess' paradox is also found by the LIFO rule and the RIRO rule.  相似文献   

20.
WDM网状网中动态域间流量疏导策略   总被引:1,自引:1,他引:0  
对波分复用(Wavelength Division Multiplexing,WDM)网状网中的动态域间流量疏导问题进行了深入研究.在源路由模式下,提出了一种基于固定备选路由方式的动态域间流量疏导算法,并在其基础上提出了只考虑波长均衡和同时考虑波长均衡与业务均衡的改进方法.该算法可以有效地避免路由环,得到较低的阻塞率,节省全网的收发器数目和波长资源.仿真结果表明,这种算法可以有效地改善网络性能.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号