摘要
文章主要研究了网络中心与其它节点之间由两条光纤构成双向传输链路的情况 ,给出了均匀和随机两种业务条件下网络中所需波长数的理论下限范围 ,利用图着色理论构造启发式算法解决了星形网络中的波长分配问题 。
The case of bi directional links composed of two fibers between the network center and other nodes is researched in this paper. Firstly, the lower bound of wavelength number needed in network for both uniform and random service model are given, and then a novel heuristic wavelength algorithm based on graph theory is proposed. Finally the validity of algorithm is proved by wavelength allocation in star network.
出处
《光通信研究》
北大核心
2002年第3期11-14,共4页
Study on Optical Communications
关键词
星形网络
路由
波长分配
搜索算法
分配算法
star network
wavelength routed networks
wavelength allocation
Tabu search algorithm
