计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (5): 128-130.

• 网络、通信与安全 • 上一篇    下一篇

一种基于时延差异目标迭代的变尺度优化方法

秦 勇1,叶建锋1,2,赵成贵3   

  1. 1.茂名学院 信息与网络中心,广东 茂名 525000
    2.太原理工大学 计算机与软件学院,太原 030024
    3.云南财经大学 信息学院,昆明 650221
  • 收稿日期:2007-09-27 修回日期:2007-12-17 出版日期:2008-02-11 发布日期:2008-02-11
  • 通讯作者: 秦 勇

Scheme for scaleable optimization based on Iterating for delay variation

QIN Yong1,YE Jian-feng1,2,ZHAO Cheng-gui3   

  1. 1.Center of Computer Network & Information,Maoming University,Maoming,Guangdong 525000,China
    2.College of Computer and Software,Taiyuan University of Technology,Taiyuan 030024,China
    3.School of Statistic Information Technology,Yunnan University of Finance and Economics,Kunming 650221,China
  • Received:2007-09-27 Revised:2007-12-17 Online:2008-02-11 Published:2008-02-11
  • Contact: QIN Yong

摘要: N元非合作性路由切割调度的简单约束条件,每个路由表项的碎片映射到链路上都会引起至少两条链路上的平均时延变化,碎片越大,映射所引起的两条链路的时延变化的概率也就越大,时延波动幅度的概率也就越大,为了在原始的切割调度样本中更精确地二次调整碎片的大小和数量,使得网络在N个链路之间保持一个比较平衡的时延差异,提出一种基于时延差异目标迭代的变尺度求解优化方法。

关键词: 切割调度, 负载平衡, 时延差异

Abstract: 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 probability.In 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 be a balance state on delay variation.A scheme for scaleable optimization based on Iterating for delay variation would be proposed in this paper.

Key words: splitting scheduling, load balancing, delay variation