摘要
N元非合作性路由切割调度的简单约束条件,每个路由表项的碎片映射到链路上都会引起至少两条链路上的平均时延变化,碎片越大,映射所引起的两条链路的时延变化的概率也就越大,时延波动幅度的概率也就越大,为了在原始的切割调度样本中更精确地二次调整碎片的大小和数量,使得网络在N个链路之间保持一个比较平衡的时延差异,提出一种基于时延差异目标迭代的变尺度求解优化方法。
Simple constraints of N non-cooperative routing cutting schedule：each routing table items of debris on the map of the link will lead to at least two of the link changes in the average delay,the greater the debris.Mapping caused by the delay of two link changes in the probability it is,the volatility of the delay the greater probabilily.ln order to more accurately achieve the size and the amount of the chips in the second adjusting among the samples of the original splitting scheduling,and keep the links of the networks he a balance state on delay variation.A scheme for sealeahle optimization based on Iterating for delay variation would be proposed in this paper.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第5期128-130,224,共4页
Computer Engineering and Applications
基金
广东省自然科学基金(the Natural Science Foundation of Guangdong Province of China under Grant No.05011896)
广东省教育厅自然科学研究项目(No.Z03080)
关键词
切割调度
负载平衡
时延差异
splitting scheduling
load balancing
delay variation
