检索结果-南通市图书馆

Generalized minimum information path routing strategy on scale-free networks

在线全文

学校读者我要写书评

暂无评论

Chinese Physics B 2011年第8期20卷 77-84页

作者：周思源王开张毅锋裴文江濮存来李微 School of Information Science and Engineering Southeast University School of Computer Science and Engineering Southeast University

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.

关键词： scale-free networks routing strategy minimum information path

Optimized routing strategy for complex network with multiple priorities

在线全文

学校读者我要写书评

暂无评论

Chinese Physics B 2016年第8期25卷 490-496页

作者：李世宝孙宗星刘建航陈海华 School of Computer and Communication Engineering China University of Petroleum

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.

关键词： complex network optimized algorithm routing strategy multiple priorities

routing strategy Based on Static and Dynamic Information

在线全文

学校读者我要写书评

暂无评论

Routing Strategy Based on Static and Dynamic Information

Mixed routing strategy in Scale-free Networks

2011 Chinese Control and Decision Conference（CCDC）

作者： Dan Wang is with the Key Laboratory of Manufacturing Industrial Integrated Automation,Shenyang University,Shenyang,China.Xiaolong Qian is with the School of Information Science and Engineering,Northeastern University,Shenyang,China.Yanping Li is with the Key Laboratory of Manufacturing Industrial Integrated Automation,Shenyang University,Shenyang,China.Yuanwei Jing is with the School of Information Science and Engineering,Northeastern University,Shenyang,China.

Two kinds of routing strategies are proposed respectively based on local topological and dynamic information for enhancing the efficiency of traffic delivery on scale-free networks.The two strategies are governed separately by a single parameter.Simulation results show that the capacity of maximum traffic flow is greatly enhanced by the optimal controlled parameter of new routing strategy.Moreover,a simulation is performed in a model of scale-free network with different clustering coefficient by adopting the local topological routing strategy with the optimal parameter,and the results revealed that the more clustered network,the less efficient the packet delivery process.Finally,it would be worth noticing at this point that,the proposed strategies are easily implemented,since local topological and dynamic information can be both straightly obtained.

关键词： routing strategy Scale-free Networks Preferential Attachment Triangle Formation

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Mixed Routing Strategy in Scale-free Networks

Effects of node buffer and capacity on network traffic

第25届中国控制与决策会议

作者： Dan Wang Key Laboratory of Manufacturing Industrial Integrated Automation Shenyang University

ISBN: (纸本)9781467355339

In order to improve the network transportation efficiency, we propose a new routing method called mixed routing strategy by considering packet generation rate is varied with time. The mixed routing strategy consists of two parts. When the packet generation rate is small, the shortest paths are used to deliver the packets, while the packet generation rate is large, we use the local routing strategy. Numerical results shown that with proper design on the shifting instances between the two routing methods according to the traffic dynamic behavior, the mixed routing has better network performance than the shortest path routing and the local routing strategy.

关键词： Scale-free networks routing strategy

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Chinese Physics B 2012年第9期21卷 601-606页

作者：凌翔胡茂彬丁建勋 School of Transportation Engineering Hefei University of Technology School of Engineering Science University of Science and Technology of China

In this paper, we study the optimization of network traffic by considering the effects of node buffer ability and capacity. Two node buffer settings are considered. The node capacity is considered to be proportional to its buffer ability. The node effects on network traffic systems are studied with the shortest path protocol and an extension of the optimal routing [Phys. Rev. E 74 046106 （2006）]. In the diagrams of flux-density relationships, it is shown that a nodes buffer ability and capacity have profound effects on the network traffic.

关键词： scale-free network small-world network routing strategy flux density relation

Analysis of network traffic flow dynamics based on gravitational field theory

在线全文

学校读者我要写书评

暂无评论

Chinese Physics B 2013年第6期22卷 670-680页

作者：刘刚李永树张喜平 Faculty of Geosciences and Environmental Engineering Southwest Jiaotong University

For further research on the gravity mechanism of the routing protocol in complex networks, we introduce the concept of routing awareness depth, which is represented by p. On this basis, we define the calculation formula of the gravity of the transmission route for the packet, and propose a routing strategy based on the gravitational field of the node and the routing awareness depth. In order to characterize the efficiency of the method, we introduce an order parameter, η, to measure the throughput of the network by the critical value of phase transition from free flow to congestion, and use the node betweenness centrality, B, to test the transmission efficiency of the network and congestion distribution. We simulate the network transmission performance under different values of the routing awareness depth, ρ. Simulation results show that if the value of the routing awareness depth p is too small, then the gravity of the route is composed of the attraction of very few nodes on the route, which cannot improve the capacity of the network effectively. If the value of the routing awareness depth ρ is greater than the network＇s average distance （l）, then the capacity of the network may be improved greatly and no longer change with the sustainable increment of routing awareness depth p, and the routing strategy performance enters into a constant state. Moreover, whatever the value of the routing awareness depth p, our algorithm always effectively balances the distribution of the betweenness centrality and realizes equal distribution of the network load.

关键词： routing strategy congestion gravitation field complex networks

Traffic dynamics on multilayer networks

在线全文

学校读者我要写书评

暂无评论

Digital Communications and Networks 2020年第1期6卷 58-63页

作者： Jiexin Wu Cunlai Pu Lunbo Li Guo Cao School of Computer Science and Engineering Nanjing University of Science and TechnologyNanjing210094China

Many real-world networks are demonstrated to either have layered network structures in themselves or interconnect with other networks,forming multilayer network structures.In this survey,we give a brief review of recent progress in traffic dynamics on multilayer networks.First,we introduce several typical multilayer network models.Then,we present some mainstream performance indicators,such as network capacity,average transmission time,etc.Moreover,we discuss some optimization strategies for improving the transmission performance.Finally,we provide some open issues that could be further explored in the future.

关键词： Multilayer network Traffic dynamics Network model routing strategy

Content Centric Networking: A New Approach to Big Data Distribution

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

ZTE Communications 2013年第2期11卷 3-10页

作者： Yi Zhu Zhengkun Mi Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications School of Computer Science and Telecommunication Engineering University of Jiangsu

In this paper, we explore network architecture anal key technologies for content-centric networking （CCN）, an emerging networking technology in the big-data era. We descrihe the structure anti operation mechanism of tl CCN node. Then we discuss mobility management, routing strategy, and caching policy in CCN. For better network performance, we propose a probability cache replacement policy that is based on cotent popularity. We also propose and evaluate a probability cache with evicted copy-up decision policy.

关键词： big data content-centric networking caching policy, mobility management routing strategy

Application of Wireless Sensor Network in Dam Safety Monitoring System Design

在线全文

学校读者我要写书评

暂无评论

Application of Wireless Sensor Network in Dam Safety Monitor...