整饰因子为6的波分多路圈同步光纤网络的设备最少化(英文)  

Minimizing AMDs in unidirectional WDM rings with grooming factor 6

作　　者：徐允庆[1] 常彦勋[2] 

机构地区：[1]宁波大学数学系,浙江宁波315211 [2]北京交通大学数学系,北京100044

出　　处：《信阳师范学院学报（自然科学版）》2005年第1期1-8,共8页Journal of Xinyang Normal University(Natural Science Edition)

基　　金：Research supported by SRFDP grant( 2 0 0 1 0 0 0 40 0 1 )

摘　　要：在波分多路技术的无向圈光网络中 ,通讯流的整饰就是要将多个低速率的信号压缩为一个波长下的高速率信号流 .整饰方式的选择决定着光网络中用于光电转换的多路器的使用个数 .选择适当的整饰方式使多路器的使用数达到最少等价于一个图设计问题 ,即 :寻找 n(网络结点数 )个点的完全图 (Kn)的一个边划分 ,使之分为一些有不多于 C条边的子图 ,并使这些子图的顶点个数的和达到最小 .对 C=5 ,这个问题已得到解决 .本文我们给出当 C=6,n≡ 1 (mod 3) (n≠ 1 9)时 ,使得光网络中使用多路器达到最少 。In wavelength division multiplexing for unidirectional rings,traffic grooming is used to pack low rate signals into higher rate streams to share a wavelength.The grooming chosen determines the number of add-drop multiplexers used for the optical-to-electric conversion.The determination of groomings to use the fewest multiplexers is equivalent to a graph design problem:find a partition of the edges of the complete graph on n vertices (K_n) into subgraphs having at most C edges and in which the total number of vertices has to be minimized.It has been solved when up to C=5.In this paper,we deal with the case of n≡1 (mod 3) and C=6 with minimum drop cost and minimum number of wavelengths when n≠19.

关 键 词：通讯流整饰 图 设计理论 波分多路圈 

分 类 号：O157.2[理学—数学] O157.5[理学—基础数学]