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

Computer Engineering and Applic (J1íons 计篝机工程与应用 。问络、通信~安全。 一种基于时延差异目标迭代的变尺度优化方法 勇 1. 叶建锋 lJ ，赵成贵 3 1 l 3 QIN Yong ? YE Jian…feng ,2. ZHAO Cheng…gui 1，茂名学院信息与网络中心，广东茂名 525000 2. 太原理工大学计算机与软件学院，太原 030024 3 ，云南财经大学倍息学院，昆明 650221 I.Center of Computer Network Informalion , Maoming University. Maoming , Guangdong 525000, China 2.College of Computf r and Software. Taiyuan Univer咽 ity of Technology , Taiyuan 030024, China 3.S 们 hool ()f Statistic Information Technology ,Yunnan University of Finance and Econom?cs ,Kunm?ng 650221 ,China E甲 mail: jianfengye@yahoo.eom. 川1 QIN Yong. YE Jian-feng.ZHAO Cheng-gui.Scheme for scaleable optimization based on Iterating for delay variation. Computer Engineering and Applications. 2008. 44( 5 ): 128-130. Abstract: Simple constraint将 of N non-cooperatíve routing cuttíng sehedule: each routing table ítems of debr划。 n the map of the link will lead 10 at least Iwo of the link ehanges in the average d 俨 lay ， the greater the debris.Mapping caused by the delay of two link (hanges in tht号 prohabílity it i 钩， the volatility of the delay Ihe greater probability.ln order 10 more a川urat e1 y aehieve tbe size and the amount of Ih肝 (hip向 ín Ihe se(ond adjusting among the sampl制 of the original splitting 时 heduling.and keep the links of Ihp nptworks Ilt a halanee stale on dt hl\ variation.A seh俨 me for s(alfahle optimization based on Iterating for delay vari- 、 ation would be proposf d in this paper. Key words: splitting sehedulíng;load halancing;delay variation 捎 蜒 :N 元非合作性旦在由切割调度的简单约米条件，每个旦在由农项的碎片映射到钝路上都会引起至少两各链路上的平均时~变 化，碎片越大，映射所引起的两条链路的时~变化的概率也就越大，时~波动幅度的概率也就越大，为了在原始的切事IJ 调度样本中 更精确地二次调靠在碎片的大小和数素，使得网络在 N 个链路之间保持一个