• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3B
• /
• pp.200-208
• /
• 2003

In this paper, we propose an enhanced p-cycles (preconfigured protection cycles) scheme for fast restoration in WDM (Wavelength Division Multiplexing) optical mesh network with limited wavelength conversion for fast restoration. We enhanced the p-cycles to accommodate uni-directional connections to be used in uni-directional multicasting or asymmetric broadband multimedia communications with bi-directional connectivity. We applied it to WDM network with limited wavelength conversion and analyzed the result. The analysis results show that the enhanced p-cycle algorithm provides better performance in WDM optical networks with limited wavelength converter.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.3
• /
• pp.219-225
• /
• 2006

We consider a routing and wavelength assignment (RWA) for the efficient operation of WDM networks. For a given physical network, a set of selected pairs of nodes, the number of required connections for each selected pair of nodes, and a set of available wavelengths, the RWA is to realize as many connections as possible without wavelength collision. We give an integer programming formulation and an algorithm based on column generation. Though the proposed algorithm does not guarantee optimal solutions, test results show that the algorithm gives probably good solutions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.17-35
• /
• 1997

This paper considers the efficient design of routing path and wavelength assignment in the single-hop WDM optical transport networks. The connection demands between node-pairs are given and a connection between a pair of nodes must be made by only one lightpath. It is assumed that no wavelength conversion is allowed and the physical topology of the network and the number of available wavelengths of a physical link are also given. This paper proposes the method to route a path and assign a wavelength to the path, which guarantees fairness to every node pair. In order to guarantee fairness and maximize connections, an optimization model is established, which successively maximizes minimum connection ratio to the demand of each node pair. A heuristic algorithm with polynomial iterations is developed for the problem since the problem is NP-hard. The heuristic algorithm is implemented and applied to the networks with real problem sizes. The results of the application are compared with GAMS/OSL.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.466-469
• /
• 2003

This paper presents the routing and wavelength and timeslot assignment problems for a circuit-switched time division multiplexed (TDM) wavelength-routed networks. In this paper, we propose an efficient distributed control protocol for establishing lightpath dynamically. The protocol uses backward reservation to reduce the chance of blocking. we use aggressive reservation method with usable multiple channels and select only one in multiple channel. We show through simulation that the proposed protocol improves the success rate in TDM -based lightpath establishment.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.50-58
• /
• 1996

This paper proposes the channel-access protocol suitable to a very high speed photonic WDM network with star configuration, which can provide a high channel utilization and insensitivity to the propagation delay. The proposed protocol employs a control channel and a simple status table to deal with the propagation delay which has been a major limiting factor in the performance of the very high speed optical communication networks. The control channel transmits control information in order to reserve access on data channels, and each node constitutes a status table after the reception of control pckets which holds information about the availbility of destination node and data channel. The proposed protocol is insensitive to the propagation delay time by removing necessity of the retransmission and by allowing parallel transmission of control packet and data packets. It is proved in analysis and discrete event simulation that the proposed protocol is superior in throughput and mean delay, especially at the high load conditions compared to the existing high speed channel-access protocols.

• Journal of the Optical Society of Korea
• /
• v.10 no.4
• /
• pp.174-177
• /
• 2006

We propose a new technique to minimize gain-transient time of wavelength-division-multiplexing (WDM) signals in erbium-doped fiber amplifiers (EDFA) in channel add/drop networks. We have dramatically reduced the gain-transient time to less than $3{\mu}sec$ by applying, for the first time to our knowledge, a disturbance observer with a proportional/integral/differential (PID) controller to the control of EDFA gain. The $3{\mu}sec$ gain-transient time is the fastest one ever reported and it is approximately less than 1.5% of $200{\mu}sec$ gain-transient time of commercially available EDFAs for WDM networks. We have demonstrated the superiority of the new technique by performing the simulation with a numerical modeling software package such as the $Optsim^{TM}$.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.397-401
• /
• 2002

We consider a routing and wavelength assignment (RWA) problem on wavelength division multiplexing (WDM) ring networks, which is to maximize the established connections between nodes, given a set of usable wavelengths. We propose two new mathematical formulations of it and efficient algorithms based on branch-and-price method. Computational experiments on random instances show that cue of the proposed formulations yields optimal solutions in much shorter time on the average than the previous formulation due to Lee (1998).

• Electronics and Telecommunications Trends
• /
• v.39 no.1
• /
• pp.48-61
• /
• 2024

The integration of high-capacity terrestrial networks with non-terrestrial communication using satellites has become essential to support seamless low-latency services based on artificial intelligence and big data. Tunable light sources have been instrumental in resolving the complexity of channel management in wavelength division multiplexing (WDM) systems, contributing to increased network flexibility and serving as optical sources for long-distance coherent systems. Recently, these light sources have been applied to beam-steering devices in laser communication and sensing applications across ground, aerial, and satellite transport. We examine the utilization and requirements of tunable lasers in WDM networks and describe the relevant development status. In addition, performance requirements and development directions for tunable lasers used in optical interference systems and beam-steering devices are reviewed.

• 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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.1-15
• /
• 2005

In this paper, we deal with a mesh network design problem arising from the deployment of WDM for the optical internet. The mesh network consists of mesh topology for satisfying traffic demand while minimizing the cost of WDM, OXC, and fiber cables. The problem seeks to find an optimal routing of traffic demands in the network such that the total cost is minimized. We formulate the problem as a mixed-integer programming model and devise a tabu search heuristic procedure. Also we develop an optical internet design system that implements the proposed tabu search heuristic procedure. We demonstrate the computational efficacy of the proposed algorithm, compared with CPLEX 8.0.