CAJ | 학술논문

在波分多路技术的无向圈光网络中,通讯流的整饰就是要将多个低速率的信号压缩为一个波长下的高速率信号流.整饰方式的选择决定着光网络中用于光电转换的多路器的使用个数.选择适当的整饰方式使多路器的使用数达到最少等价于一个图设计问题,即:寻找n(网络结点数)个点的完全图(Kn)的一个边划分,使之分为一些有不多于C条边的子图,并使这些子图的顶点个数的和达到最小.对C=5,这个问题已得到解决.本文我们给出当C=6,n≡1(mod 3)(n≠19)时,使得光网络中使用多路器达到最少,同时所使用的波长数也达到最少的整饰方法.
재파분다로기술적무향권광망락중,통신류적정식취시요장다개저속솔적신호압축위일개파장하적고속솔신호류.정식방식적선택결정착광망락중용우광전전환적다로기적사용개수.선택괄당적정식방식사다로기적사용수체도최소등개우일개도설계문제,즉:심조n(망락결점수)개점적완전도(Kn)적일개변화분,사지분위일사유불다우C조변적자도,병사저사자도적정점개수적화체도최소.대C=5,저개문제이득도해결.본문아문급출당C=6,n≡1(mod 3)(n≠19)시,사득광망락중사용다로기체도최소,동시소사용적파장수야체도최소적정식방법.
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 (Kn) 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.