• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7B
• /
• pp.417-426
• /
• 2005

Routing and wavelength assignment problem is one of the most important issues in optical transport networks based on wavelength division multiplexing(WDM) technique. In this paper, we propose a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths. And then we compare the performance of the proposed algorithm with that of bounded greedy approach for EDP(BGAforEDP). The proposed one outperforms up to about 20$\%$ in the fixed traditional topology(NSFNET) and about 32$\%$ in random topologies over the BGA for EDP algorithm.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.368-376
• /
• 2007

The large potential bandwidth available in wavelength-division multiplexed optical networks makes this technology of crucial importance for satisfying the ever increasing capacity requirements of the next-generation Internet. In this scenario, the routing and wavelength assignment(RWA) problem that concerns determining the optical paths and wavelengths to be used for connection establishment in a wavelength-routed network, is still one of the most important open issues. In this paper we propose a new online dynamic grooming-capable RWA heuristic scheme working on wavelength division multiplexing(WDM) networks as a multistage selection process. The proposed algorithm is transparent with respect to the presence of wavelength converters, achieves very low connection rejection ratios with minimal computational complexity and is appropriate for the modern multilayer optical circuit and wavelength switched networks with sparse wavelength conversion capability.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1405-1412
• /
• 2000

In this paper, we propose an efficient dynamic wavelength assignment algorithm in distributed WDM (Wavelength-Division Multiplexing) networks without wavelength conversion. The algorithm tries to assign a locally-most-used wavelength distributedly on a fixed routing path. We first formulate our algorithm by using the concept of a sample space which consists of optical fibers connected to nodes on a routing path of a lightpath to be assigned a wavelength. In particular, we analyze the blocking performance mathematically as compared with that of the most-used (MU) wavelength assignment algorithm previously proposed for WDM networks under centralized control. We also obtain numerical results by simulation on the blocking performance of other centralized/distributed wavelength assignment algorithms as well as our algorithm using the M/M/c/c dynamic traffic model. Consequently, we show that analytical results match simulation results and that our algorithm is efficient in distributed WDM networks in terms of blocking performance, control traffic overhead and computation complexity.

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

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.686-688
• /
• 2000

본 논문에서는 광 네트워크에서 파장(Wavelength)의 라우팅(Routing)문제와 파장할당 (Wavelength Assignment)문제 해결에 필요한 파장의 개수를 찾아내는데 있어서 Ants System의 적용이 기존의 다른 방법과 유사하거나 일부 더 좋은 결과를 나타냄을 보인다. 또한, 광 네트워크에서 각 링크가 균등하게 사용되도록 함으로써 광경로(lightpath)의 개수를 최소화하여, 주어진 네트워크에서의 파장의 최소 개수를 찾아내는데 Ants System이 효과적으로 적용될 수 있음을 보인다.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.286-296
• /
• 2009

A major challenge in next generation optical Internet (NGOI) networks based on dense-wavelength division multiplexing (DWDM) is the provision of guaranteed quality-of-service (QoS) for a wide variety of multimedia applications. One of the critical issues in NGOI is the routing and wavelength assignment problem that is embossed as very important and plays a key role in improving the global efficiency for capacity utilization. But the previous researches had the delay problem, and the path routed by higher priority nodes may be congested and interfere with potential future multicast session requests. To overcome these problems, in this research we suggest a Priority-based Minimum Interference Path Multicast Routing (PMIPMR) algorithm, a new routing algorithm which finds alternative routes based on node priorities and Virtual Source (VS) nodes that has both splitting and wavelength conversion, and then chooses a path that does not interfere with potential future multicast session requests when congestions occur in the network. The PMIPMR algorithm reduces blocking rate significantly and increases the wavelength utilization by avoiding congestion in future multicast session requests.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.1
• /
• pp.33-44
• /
• 2001

In this paper, we address a problem of traffic grooming and wavelength routing in all optical WDM ring networks. Given a traffic demand for each node pair, we should aggregate the traffic onto lightpaths between pairs of nodes to transport the demand, and set up the routing path for each lightpath with minimum number of wavelengths to be assigned to lightpaths. In this paper, we formulate our problem as a mixed Integer Programming model. Owing to the problem complexity, it is hard to find an optimal solution for our problem. hence, we develop a heuristic algorithm to solve our problem efficiently. From the computational experiments, we can find the proposed heuristic is very satisfactory in both the computation time and the solution quality generated.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.105-108
• /
• 2003

In the next generation backbone networks based on dense-wavelength division multiplexing (DWDM), the routing and wavelength assignment with quality-of-service (QoS) recovery is essentially needed to support a wide range of communication-intensive and real-time multimedia services. This paper proposes a new dpmic routing method called as MW-MIPR (MultiWavelength-Minimum Interference Path Routing), which chooses a route that does not interfere too much with many potential future connection requests. This paper also proposes a differentiated RWA mechanisms combined with MW-MIPR algorithm to provide QoS recovery for various multimedia applications in the next generation backbone networks based on DWDM.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.83-88
• /
• 2012

This paper studies the effects of wavelength conversion on self-healing optical networks. We examined the effects of wavelength conversion capability on the backup routing and the spare wavelength utilization. The efficiency of spare wavelength utilization is proportionally increased as the wavelength conversion capability increases, different from the call blocking probability for which about 30% of wavelength conversion capability shows nearly the same performance as full wavelength conversion capability. The spare resource utilization efficiency can be improved by using alternate routing and wavelength assignment algorithms.