WDM网络中静态流量的最少费用疏导策略
doi: 10.3724/SP.J.1146.2007.00206
Minimizing Cost Grooming Policy for Static Traffic in WDM Networks
-
摘要: 为了解决WDM网状网络中的静态流量疏导问题，基于收发器节约辅助图模型，该文提出了一种最少费用疏导策略。它同时考虑收发器和波长链路两种网络资源的费用，为每条流量计算出一条费用最少的路径，以获得网络总费用最少的解决方案。根据两种资源费用的比值关系，给辅助图中的每条边分配不同的权值，使得路径的总权值最小代表了该路径的费用最少，从而就能够轻易地实现该策略。仿真结果证明，不管两种资源的费用比值如何变化，该策略的网络总费用始终是最少的。Abstract: To solve the static traffic grooming problem in WDM mesh networks, a minimizing cost grooming policy is proposed based on the transceiver saving auxiliary graph model. The policy considers the costs of both two network resources of transceivers and wavelength links. It searches a least-cost path for each traffic request in order to get the optimized solution with the lease network cost. It assigns different values to edges of the auxiliary graph according to the cost ratio of the two resources. Minimizing the weight of a path means minimizing the resource cost of this path, and then the policy is easily achieved. Simulation results show that the network cost of the policy is always the least despite different cost ratios of the two resources.
-
[1] Dutta R and Rouskas G N. Traffic grooming in WDMnetworks: past and future[J].IEEE Network.2002, 16(6):46-56 [2] Chiu A L and Modiano E H. Traffic grooming algorithms forreducing electronic multiplexing costs in WDM ring networks[J].IEEE/OSA J. Lightwave Technol.2000, 18(1):2-12 [3] Zhu Keyao and Mukherjee B. Traffic grooming in an opticalWDM mesh network[J].IEEE J. Selected Areas inCommunications.2002, 20(1):122-133 [4] Zhu Hongyue, Zang Hui, Zhu Keyao, and Mukherjee B. Anovel generic graph model for traffic grooming inheterogeneous WDM mesh networks[J].IEEE/ACM Trans. onNetworking.2003, 11(2):285-299 [5] Yao Wang and Ramamurthy B. A link bundled auxiliarygraph model for constrained dynamic traffic grooming inWDM mesh networks[J].IEEE J. Selected Areas inCommunications.2005, 23(8):1542-1555 [6] Yao Huaxiong, Yang Zongkai, and Ou Liang, et al.. Atransceiver saving auxiliary graph model for dynamic trafficgrooming in WDM mesh networks. in the 31th IEEEConference on Local Computer Networks (LCN), Florida, US,Nov. 2006: 319-326. [7] Cerutti I and Fumagalli A. Traffic grooming in staticwavelength-division multiplexing networks. IEEECommunications Magazine, 2005, 43(1): 101-107. -
计量
- 文章访问数: 2940
- HTML全文浏览量: 103
- PDF下载量: 747
- 被引次数: 0
下载:
