东篱科研大数据发现系统（DRDS）

位置：成果数据库 > 期刊 > 期刊详情页

A Dynamic Flow-Regulation Algorithm for Networks Overload Control

期刊名称：Wuhan University Journal of Natural Sciences
时间：2012.2.1
页码：103-108
分类：TP309[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术]
作者机构：[1]School of Computer, Wuhan University, Wuhan 430072,Hubei, China, [2]Key Laboratory of Aerospace Information Security andTrust Computing of Ministry of Education, Wuhan University,Wuhan 430072, Hubei, China, [3]GPS Engineering Research Center, Wuhan University,Wuhan 430072, Hubei, China
相关基金：Supported by the National Natural Science Foundation of China （60970114 , 41104010）; the National Natural Science Foundation of Hubei Province （ZRZ0041）; the Science and Technology Project of Wuhan City （201110921292）; the Open Fund of the Ministry of Public Security of the Information Network Security Key Laboratory （C10607）; the Independent Scientific Research Projects of the Wuhan University Graduate Student （201121102020002）
相关项目：基于移动定位服务的社会网络感知及安全协同关键技术研究

关键词：网络拥挤, 流动规定, 网络, survivability, network congestion flow-regulation network sur-vivability

中文摘要：

在这份报纸，一条动态流动规定面向算法的网络超载控制被建议。它能按比例散布在高度的节点和低度的节点之间的负担。根据理论分析，建议算法的网络传播表演在到高度的节点的用法率的反的比例。模拟证明新算法是更灵活的并且能与最短的路径路由算法相比在大多数情形提高网络能力。而且，有有效路由算法的比较也揭示新算法的突出的表演。

英文摘要：

In this paper,a dynamic flow-regulation algorithm-oriented network overload control is proposed.It can proportion-ally distribute the load between the high-degree nodes and the low-degree nodes.According to the theoretical analysis,the net-work transmission performance of the proposed algorithm is in inverse proportion to the usage rate of the high-degree nodes.Simulations show that the new algorithm is more flexible and can enhance the network capability in most circumstances compared with the shortest path routing algorithm.Moreover,the compari-son with the efficient routing algorism also reveals the prominent performance of the new algorithm.

同期刊论文项目