• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.406-408
• /
• 2005

A passive Optical Network (PON) is famous for the most cost-efficient solution among the optical networks. This is because there is no active device between a central office and subscribers. A wavelength division multiplexing (WDM) offers each subscriber to feel unlimited bandwidth. A WDM-PON, however, has a cost problem that WDM-PON is used commercially. To solve this trouble, it is surveyed that a Sub-Carrier Multiplexing (SCM) used in a WDM-PON increases the number of subscribers. The performance of WDM/SCM-PON varies with various noises. The several FEC Codes can reduce the effects of noise and improve the performance of the system. Thus, Choosing a suitable FEC code is important work. This paper describes that a Reed-Solomon (RS) code is the most suitable code for WDM/SCM-PON at the object of 100 Mbps and $10^{-9}$ BER

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.8
• /
• pp.12-20
• /
• 1998

All-optical networks(AON) are emerging as the next generation broadband networks for wide-area and local-area networks. Many optical switch architectures are currently proposed to realize AON. Specially, optical switches using WDM have a lot of advantages in point of the optical transparency and network topology for B-ISDN services in AON. In this paper, two kinds of Knockout Optical Switching Architectures(KOSA) are proposed for high speed optical ATM networks. We use WDM technologies for them to operate in all-optical area and they are called Architecture-Ⅰ, Architecture-Ⅱ respectively. Each one represents different characteristics according to the number of components and the kind of components, which make KOSA have different performance and system complextity. In order to verify and to compare the performance, these architectures were analyzed and simulated in terms of cell loss ratio, system complexity and buffering speed.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.419-427
• /
• 2007

In wavelength-division-multiplexing(WDM) networks a link failure may cause the failure of several high-bit-rate optical channels, thereby leading to large data loss. Recently, various protection and restoration mechanisms have been proposed to efficiently deal with this problem in mesh networks. Among them, dedicated path protection(DPP) is a promising candidate because of its ultra-fast restoration time and robustness. In this work we investigate the issue of planning and optimization of WDM networks with DPP. Integer linear programming(ILP), in particular, is one of the most common exact method to solve the design optimization problem for protected WDM networks. Traditional ILP formalizations to solve this problem rely on the classical flow or route formulation approaches, but both these approaches suffer from a excessively high computational burden. In this paper, we present a variable-aggregation method that has the ability of significantly reducing the complexity of the traditional flow formulation. We compare also the computational burden of flow formulation with variable aggregation both with the classical flow and route formulations. The comparison is carried out by applying the three alternative methods to the optimization of two case-study networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.3A
• /
• pp.443-450
• /
• 2000

Although designing a virtual topology for all-optical WDM wide-area networks has been extensively studied and several algorithms have been proposed, these algorithms assumed error-free communication between two nodes. However, noises from optical amplifiers and optical cross-connects can degraded the signal, resulting in a nonzero bit-error rate. In this paper, we investigate the effect of physical limitations on the virtual topology design. We show that for side-area all-optical networks where transmission distance is fairly long, virtual topology design algorithm that can determine the locations of opto-electronic(OE) and electro-optic(EO) conversions to set up a connection request with a high BER in a multihop manner.

• ETRI Journal
• /
• v.28 no.3
• /
• pp.329-336
• /
• 2006

This paper investigates the problem of protecting multicast sessions in mesh wavelength-division multiplexing (WDM) networks against single link failures, for example, a fiber cut in optical networks. First, we study the two characteristics of multicast sessions in mesh WDM networks with sparse light splitter configuration. Traditionally, a multicast tree does not contain any circles, and the first characteristic is that a multicast tree has better performance if it contains some circles. Note that a multicast tree has several branches. If a path is added between the leave nodes on different branches, the segment between them on the multicast tree is protected. Based the two characteristics, the survivable multicast sessions routing problem is formulated into an Integer Linear Programming (ILP). Then, a heuristic algorithm, named the adaptive shared segment protection (ASSP) algorithm, is proposed for multicast sessions. The ASSP algorithm need not previously identify the segments for a multicast tree. The segments are determined during the algorithm process. Comparisons are made between the ASSP and two other reported schemes, link disjoint trees (LDT) and shared disjoint paths (SDP), in terms of blocking probability and resource cost on CERNET and USNET topologies. Simulations show that the ASSP algorithm has better performance than other existing schemes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.741-742
• /
• 2013

Passive optical networks (PONs) are the emerging solution for access networks since PONs provide high bandwidth. TDM ((time-division multiplexing) PON cannot support sufficient bandwidth for new broadband services such as UHD (ultra high-definition) IP TV, and VOD (video on demand). The solution is TWDM PON which is a mixture of WDM (wavelength-division multiplexing) and TDM. This paper proposes a new MAC (media access control) protocol for TWDM PON.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.499-508
• /
• 2005

In this paper, we address the problem of efficient routing and wavelength assignment (RWA) in multi-fiber wavelength division multiplexing (WDM) networks without wavelength translation, under dynamic traffic. We couple Dijkstra's shortest path algorithm with a suitable weight function which chooses optical paths based both on wavelength availability and multi-fiber segments. We compare our approach with other RWA schemes both for regular and irregular WDM multi-fiber network topologies in terms of blocking probability and overall link utilization.

• Proceedings of the Optical Society of Korea Conference
• /
• 2003.02a
• /
• pp.316-317
• /
• 2003

오늘날 광 통신망이 지향하는 바는 ‘고속화’, ‘대용량화’, 그리고 ‘장거리화’의 3가지로 집약할 수 있다. 1990년대 후반에 본격적으로 도입된 WDM(Wavelength Division Multiplexing) 기술은 하나의 광섬유에 파장이 다른 다수의 광 채널 신호를 동시에 전송할 수 있는 기술로서, 별도의 광섬유를 포설하지 않고도 광통신망의 용량을 경제적으로 신속히 확장할 수 있기 때문에 대용량화를 위한 대표적인 기술로 자리 잡았다. (중략)

• Proceedings of the Optical Society of Korea Conference
• /
• 2000.08a
• /
• pp.4-8
• /
• 2000

최근 양방향 전송에 기반을 둔 양방향 파장 분할 다중 방식(WDM: wavelength division multiplexing) 광통신망$^{(1-3)}$ 이 제안되고 있다. 양방향 파장 분할 다중 방식 광통신망은 광섬유의 수나 광증폭기의 수 등 경제적 비용을 경감할 수 있고 비선형 현상을 줄일 수 있다는 장점을 갖는다. 그러나 이러한 양방향 광통신망에서는 Rayleigh 역산란이나 다중 광반사, 각종 소자의 누화에 의한 상대 강도 잡음(RIN: relative intensity noise)에 의해 시스템의 성능과 통신망의 확장성이 심각하게 저하될 수 있다$^{(4)}$ . 따라서 상대 강도 잡음을 억제하면서도 양방향 광통신망의 장점을 살릴 수 있는 광증폭기 및 애드/드롭 모듈의 설계가 필수적이다. (중략)

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.3
• /
• pp.194-197
• /
• 2002

This paper considers the problem of routing connections in a optical multi tree networks using WDM (Wavelength Division Multiplexing), where each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, so that connections whose paths share a common link in the network are assigned different wavelengths. The problem of optimal coloring of the paths on the optical multi-networks is NP-hard[1], but if that is the coloring of all paths, then there exists efficient polynomial time algorithm. In this paper, using a "divide & conquer" method, we give efficient algorithm to assign wavelengths to all the paths of a tree network based on the theory of [7]. Here, our time complexity is 0(n4log n).