检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孙士国[1] SUN Shi-guo(Department of Basic Curriculum,North China Institute of Science and Technology,Sanhe 065201,China)
出 处:《沈阳工业大学学报》2018年第6期687-691,共5页Journal of Shenyang University of Technology
基 金:河北省科技厅科技攻关项目(112135107)
摘 要:针对λ网络中的高性能传输问题,提出了一种分布式速率分配算法.该算法基于离散时间系统模型对λ网络进行建模,得到其速率分配问题的数学依赖关系,根据最大-最小公平准则,利用本地信息来分配每个源端和目的端之间的容量,以确保较低期望速率会话的速率最大化,并把剩余容量均匀地分配给全部会话,直至网络被充分利用.结果表明,所提出的分布式速率分配算法能快速收敛到一个最大-最小公平速率分配方式,而且还能实现自适应期望速率的快速变化.Aiming at the problem of high performance transmission inλ-networks,a distributed rate allocation algorithm was proposed.The modeling forλ-networks was carried out with the proposed algorithm based on the discrete time system model,and the mathematical dependence relationship of rate allocation problem was obtained.Based on the max-min fairness criterion,the capacity between each source end and destination end was allocated with the local information to ensure the maximization of session rates for the sessions with the lower desired rates,and the remaining capacity was evenly assigned to all the sessions until the network was fully utilized.The results show that the proposed distributed rate allocation algorithm can quickly converge to a max-min fairness rate allocation mode,but also can adapt to the fast change of desired rate.
关 键 词:λ网络 分布式算法 容量 速率分配 最大最小公平准则 自适应 收敛 平衡点
分 类 号:TN915.6[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.141.35.52