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

• Current Optics and Photonics
• /
• v.1 no.4
• /
• pp.315-324
• /
• 2017

In recent years, multicast services such as high-definition television (HDTV), video conferencing, interactive distance learning, and distributed games have increased exponentially, and wavelength-division multiplexing (WDM) networks are considered to be a promising technology due to their support for multicast applications. Multicast survivability in WDM networks has been the focus of extensive attention since a single-link failure in an optical network may result in a massive loss of data. But the improvement of network survivability increases energy consumption due to more resource allocation for protection. In this paper, an energy-efficient multicast algorithm (EEMA) is proposed to reduce energy consumption in WDM networks. Two cost functions are defined based on the link state to determine both working and protection paths for a multicast request in WDM networks. To increase the number of sleeping links, the link cost function of the working path aims to integrate new working path into the links with more working paths. Sleeping links indicate the links in sleep mode, which do not have any working path. To increase bandwidth utilization by sharing spare capacity, the cost function of the protection path is defined to use sleeping fibers for establishing new protection paths. Finally, the performance of the proposed algorithm is evaluated in terms of energy consumption, and also the blocking probability is evaluated under various traffic environments through OPNET. Simulation results show that our algorithm reduces energy consumption while maintaining the quality of service.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.15-18
• /
• 2008

WDM is an incredibly promising technique in which multiple channels are operated along a single fiber, providing the facilities of terabit per second bandwidth. Thus, the survivability of WDM networks becomes critical for the success of the next generation internet architecture. Despite the fact that the path-based proactive restoration scheme guarantees 100% restoration as it computes a backup light path while the primary light path is being set up, this method results in additional capacity consumption. In this paper, an ideal technique is proposed that modifies the active multi-backup paths method and results in a better restoration scheme. Based on a theoretical analysis, a new method is shown to reduce the number of hopes as well as the restoration time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.1064-1074
• /
• 1997

In this paper we propose an every-other-row-connecting bilayered ShuffkeNet for optical WDM(wavelength division multiplexing) multihop networks. We calculate the diameter and the average number of hops of the proposed every-other-row-connecting bilayered ShuffleNet. Using the result, we also calcuate throughputs and delays of the proposed topology, which show higher efficiencies compared to the conventional ShuffleNet, the bilayered ShuffleNet and asymmetric bilayered ShuffleNet.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1371-1374
• /
• 2002

This paper compares four network con-figurations for using as the logical topology in multi- hop wavelength division multiplexing (WDM) networks. The regular network configurations studied in this paper axe ShuffleNet, de Bruijn graph, hypercube, and Man-hattan street network. Instead of using the weight mean hop distance of node placement problem for comparing optimum logical topology, we introduce a new objective function that includes h and the network cost. It can be seen that the network cost strongly depends on the logical topology selected for the implementation of the network. The objective of this paper is to find an optimum logical topology for WDM networks that gives low as well as low network cost.

• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.147-155
• /
• 2004

In this paper, we propose an efficient sequencing technique, namely minimum Row time scheduling (MFTS), to manage variable-Iength message transmissions for single-hop passive starcoupled WDM optical networks. By considering not only the message length but also the state of the receivers and the tuning latency, the proposed protocol can reduce the average delay of the network greatly. This paper also introduces a new channel assignment technique latency minimizing scheduling (LMS), which aims to reduce the scheduling latency. We evaluate the proposed algorithm, using extensive discrete-event simulations, by comparing its performance with shortest job first (SJF) algorithm. We find that significant improvement in average delay could be achieved by MFTS algorithm. By combining the proposed message sequencing technique with the channel selection technique, the performance of the optical network could be further improved.

• ETRI Journal
• /
• v.24 no.2
• /
• pp.131-141
• /
• 2002

This paper considers a routing and wavelength assignment problem (RWAP) for the implementation of efficient Wavelength Division Multiplexing all-optical mesh networks without wavelength conversion. For a given physical network and required connections, the solution to the RWAP consists in how to select a suitable path and wavelength among the many possible choices for each connection so that no two paths using the same wavelength pass through the same link, while minimizing the number of required wavelengths. We introduce an integer programming formulation of the RWAP, which has an exponential number of variables, and propose an algorithm to solve it based on the column generation technique. The proposed algorithm can yield high quality solutions and tight lower bounds at the same time. Though the proposed algorithm cannot guarantee optimal solutions, computational results show that the algorithm yields provably good solutions within a reasonable time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4B
• /
• pp.351-360
• /
• 2003

All-optical network provede unlimited for bandwidth, the very low bit error rate, and the transparency to IP. Optical networks promise to be the next generation networks that can meet the higher bandwidth demands. However, the number of wavelengths is often not large enough to help a large amount of nodes. The blocking by wavelength contention can be reduced by wavelength conversion, which can't perfectly resolve all situations. Because of that, a lot of groups have proposed unique wavelength assingment algorithms and protocols. Most schemes don't support the priority concepts. This paper describes the unique priority scheme based on the throughput. In this paper, we apply our priority scheme to SWAP(Simple Wavelength Assignment Protocol) and show the performance of the proposed priority scheme. Our proposed priority scheme can be a better solution to solve an important problem about the blocking by wavelength contention into WDM optical networks.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.7
• /
• pp.507-517
• /
• 2003

A single fiber failure in mesh-based WDM networks may result in the loss of a large number of data. To remedy this problem, an efficient restoration algorithm for a single fiber failure in the mesh- based WDM network is necessary. We propose a new algorithm for restoration scheme in WDM networks and compare it with previous schemes. Path restoration and link restoration are two representative restoration schemes which deal with only a single link failure. In this paper, we propose two kinds of efficient restoration scheme. In the proposed schemes the restoration path for each link failure is not secured. The mesh network is decomposed into a number of small loops. In one algorithm, any link failure in a certain loop is regarded as the failure of the loop and the restoration lightpath is selected by detouring the failed loop. In another scheme any link failure in a certain loop is restored within the loop. We compare performance of the proposed schemes with conventional path restoration scheme and link restoration scheme. Simulation results show that CPU time in the proposed schemes decreases compared with that in path restoration scheme and link restoration scheme, although total wavelength mileage usage increases by 10% to 50%.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.8
• /
• pp.51-57
• /
• 2004

We have analyzed the effect of out-band dispersion in the cascaded fiber Bragg Elating(FBG) based optical add-drop multiplexers(OADM) when bypassed wavelengths contain SCM signals. In order to compute this impairment the dispersion characteristics of FBG have been analytically calculated by solving their coupled wave equations, and the Fourier method is applied to IMD analysis. The out-band dispersion effects over WDM/SCM signals are analyzed under different and common system situations as: ITU channel spacing(100, 50, 25 GHz), channel density parameter, frequency extension of the SCM plan, modulation characteristics, FBG length, etc. From this results, the transport of WDM/SCM signals in future DWDM transport networks could be limited by this effect which has to be taken into account for designing future networks.