WDM網狀網中的基于平面構造的業(yè)務量疏導算法
A Traffic Grooming Algorithm Based on Plane Construction in WDM Mesh Networks
-
摘要: 將多個低于一個波長帶寬的低速業(yè)務流復用到一個波長上傳輸的業(yè)務量疏導已經得到越來越多 的研究。WDM/SDH環(huán)網中的業(yè)務量疏導已得到大量研究，WDM網狀網中的業(yè)務流疏導問題研究相對較少。該文研究靜態(tài)環(huán)境下波長數目受限的業(yè)務量疏導問題，提出了一種基于平面構造的啟發(fā)式業(yè)務量疏導算法。仿真結果表明該算法比已知的算法具有更好的性能。Abstract: Traffic grooming, which can multiplex many low-rate traffic streams into one wavelength, has been received much research attention. Much work related to traffic grooming has been done in WDM/SDH rings, and the work is relatively less in WDM mesh networks. In this paper, under static traffic environment, an effective heuristic traffic grooming algorithm based on plane-construction is proposed. Simulation results show that the algorithm performs better than other previously proposed algorithms.
-
計量
- 文章訪問數: 1998
- HTML全文瀏覽量: 82
- PDF下載量: 475
- 被引次數: 0
下載:
