【24h】

Improved congestion avoidance and resource allocation algorithm

机译:改进的拥塞避免和资源分配算法

获取原文
获取原文并翻译 | 示例

摘要

In the present study a congestion avoidance algorithm is proposed for multi-users, transmitting simultaneously on a single link. The present algorithm is based on the additive increase and multiplicative decrease feedback law. Equilibrium is reached at which all users shared equally at steady state and utilizes the whole link capacity. The resource allocation involves constraint on shared capacity and generates desired output within limited time period. The capacity of link is fully utilized and shared among the users in the set ratio, using the resource allocation algorithm. It represents a very simple, effective and more robust method for distribution of link capacity.
机译:在本研究中,针对多用户提出了一种拥塞避免算法,该算法在单个链路上同时进行传输。本算法基于加性增加和乘性减少反馈律。达到平衡,所有用户在稳态下均等地共享并利用整个链路容量。资源分配涉及共享容量的限制,并在有限的时间段内生成所需的输出。使用资源分配算法,可以按设置的比例充分利用链接的容量并在用户之间共享链接的容量。它代表了一种非常简单,有效且更可靠的链路容量分配方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号