arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0806.1845cs.NI
收藏

一种有效的无标度网络拥塞控制方法

An efficient approach of controlling traffic congestion in scale-free networks

Zonghua Liua, Weichuan Ma, Huan Zhang, Yin Sun, P. M. Hui

摘要:

我们提出并研究了一个通信网络中的业务模型。底层网络具有可在具有偏好连接的无标度增长网络和随机增长网络之间调节的结构。为了模拟网络中不同节点可能具有不同能力的实际情况,假设节点处的消息或分组创建和传递速率取决于节点的度。在具有无标度特性的网络中,节点的度越高,越容易发生自适应,因此,有选择地提高一小部分(如3%)节点的消息处理能力的有效方法与提高所有节点的消息处理能力的效果一样好.在确定网络中的非拥塞或拥塞流量的创建率和交付率之间的相互作用进行了研究,更多的数值和分析。

英文摘要:

We propose and study a model of traffic in communication networks. The underlying network has a structure that is tunable between a scale-free growing network with preferential attachments and a random growing network. To model realistic situations where different nodes in a network may have different capabilities, the message or packet creation and delivering rates at a node are assumed to depend on the degree of the node. Noting that congestions are more likely to take place at the nodes with high degrees in networks with scale-free character, an efficient approach of selectively enhancing the message-processing capability of a small fraction (e.g. 3%) of the nodes is shown to perform just as good as enhancing the capability of all nodes. The interplay between the creation rate and the delivering rate in determining non-congested or congested traffic in a network is studied more numerically and analytically.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑