摘要
最小费用半光路问题是指在给定的全光WDM网络条件下,在源节点和目的节点之间找一条费用最小的半光路由,与一般的最小路问题不同的是网络在节点上还有与链路相关的费用函数.对Chlamtac等人的SPAWG算法,给出了一种修正的SPAWG算法.
The optimal semilightpath problem is to find a semilightpath from the source to the destination under the given WDM optical network conditions, such that the path cost is minimized. Since there is a cost function on the nodes related to the links, it is different from the usual minimum cost problem. We analyze the SPAWG algorithm which gived by Chlamatc et. al and propose a modified SPAWG algorithm.
出处
《辽宁师范大学学报(自然科学版)》
CAS
2004年第3期264-266,共3页
Journal of Liaoning Normal University:Natural Science Edition