本文選題：多源光組播 + 編碼鏈路��； 參考：《北京郵電大學(xué)學(xué)報(bào)》2017年05期

【摘要】：網(wǎng)絡(luò)編碼提高波分復(fù)用網(wǎng)絡(luò)多源光組播帶寬利用率時(shí),導(dǎo)致光域中存儲(chǔ)和運(yùn)算開銷增加,為此,設(shè)計(jì)了一種改進(jìn)的自適應(yīng)遺傳算法可最少化光組播的網(wǎng)絡(luò)編碼光纖鏈路數(shù)目.該算法設(shè)計(jì)了自適應(yīng)調(diào)整的交叉概率和差異最大化交叉操作,保證種群多樣性,避免陷入局部最優(yōu);通過自適應(yīng)調(diào)整交叉概率,保證種群在開始階段可以很快實(shí)現(xiàn)多樣性,使種群中的較優(yōu)個(gè)體保持穩(wěn)定.仿真結(jié)果表明,所提算法與對(duì)比算法相比收斂速度更快,可以用更短時(shí)間找到編碼鏈路數(shù)目最少的方案.
[Abstract]:When network coding improves bandwidth utilization of multi-source optical multicast in wavelength division multiplexing (WDM) network, the storage and computing overhead in optical domain increases. Therefore, an improved adaptive genetic algorithm is designed to minimize the number of optical network coded optical links of optical multicast. The algorithm designs the crossover probability of adaptive adjustment and maximizes the crossover operation of difference to ensure the diversity of population and avoid falling into local optimum. By adjusting the crossover probability adaptively, the diversity of population can be realized quickly in the initial stage. Keep the better individuals in the population stable. Simulation results show that the proposed algorithm converges faster than the contrast algorithm and can find the scheme with the least number of coding links in a shorter time.
【作者單位】： 重慶郵電大學(xué)通信與信息工程學(xué)院;
【基金】：國家自然科學(xué)基金項(xiàng)目(61275077) 重慶市科委前沿與應(yīng)用基礎(chǔ)研究項(xiàng)目(2015jcyj A40024)
【分類號(hào)】：TN929.1
，

本文編號(hào)：2050509