• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2005.11a
• /
• pp.306-309
• /
• 2005

We consider the multi-objective optimization of a multi-service arrayed-waveguide grating-based single-hop metro WDM network with the two conflicting objectives of maximizing throughput while minimizing delay. We develop and evaluate a genetic algorithm based methodology for finding the optimal throughput-delay tradeoff curve, the so-called Pareto-optimal frontier. Our methodology provides the network architecture and the Medium Access Control protocol parameters that achieve the Pareto-optima in a computationally efficient manner. The numerical results obtained with our methodology provide the Pareto-optimal network planning and operation solution for a wide range of traffic scenarios. The presented methodology is applicable to other networks with a similar throughput-delay tradeoff.

• 한국정보통신설비학회:학술대회논문집
• /
• 2003.08a
• /
• pp.159-162
• /
• 2003

This paper presents a novel heuristic mechanism, Dynamic-network Adapted Cost selection (DAC-selection), which has higher backup path sharing rate, lower number of blocked channel requests and number of used wavelengths fer reservation of working path and backup path by using unique cost function than that of widely used random selection (R-selection) mechanism and Combined Min-cost selection (CMC-selection) mechanism proposed by Lo, while maintaining 100% restoration capability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.956-965
• /
• 2000

In this paper, we propose an efficient traffic grooming algorithm to minimize to number of SONET ADMs which is the dominant cost of system in high speed optical ring networks. It is an optimal traffic grooming algorithm to be applied to both unidirectional ring and bi-directional ring under both uniform traffic and nonuniform traffic. The proposed traffic grooming algorithm consists of two subalgorithms : one is the algorithm to construct full connection-rings as many as possible to minimize gaps by cutting the connections and using redirection method, and the other is the algorithm to groom connection-rings into a wavelength to maximize the number of shared nodes. The simulation results show that the proposed algorithm is superior to conventional algorithm under various network conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1247-1253
• /
• 2000

To fully utilize the capabilities of a SONET/ADM network, traffic grooming is needed to multiplex a number of lower-rate traffic streams into a higher-rate stream, and vice versa. Although the capacity of a SONET ring network can be upgraded by operating it over multiple wavelengths, the corresponding network design may be costly if it employs a large number of ADMs. A cost-effective design attempts to minimize the total number of ADMs used in the network while carrying the offered traffic. We introduce and evaluate the performance characteristics of a new traffic-grooming approach for WDM ring networks, called multihop. The multihop implementation places an ADM at each node based on the requested traffic in the traffic-demand matrix then, it tries to groom the wavelengths which can be groomed. We select one of the nodes to be the "hub" node which has an ADM for each wavelength. The hub node, therefore, can "bridge" traffic between all of the wavelengths. The algorithm is specified and illustrated by a simple example. Our results demonstrate that it is beneficial to use a single-hop approach, but for a large grooming ratio and node number, we advocate the use of the multihop approach.e multihop approach.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.677-682
• /
• 2004

In the present paper routing and wavelength assignment (RWA) in optical WDM networks is considered. Previous techniques based on the combination of integer linear programming and graph coloring are complex and require extensive use of heuristics. Such methods are mostly slow and sometimes impossible to get results due to infeasibility. An alternative approach applied to RWA employs on the greedy algorithm for obtaining the maximum edge disjoint paths. Even though this approach is fast, it produces a solution for any connection request, which is very far from the optimal utilization of wavelengths. We propose a novel algorithm, which is based on the maximum flow technique to obtain the maximum quantity of edge, disjoint paths. Here we compare the offered method with previous maximum edge disjoint paths algorithms ap plied to the RWA.

• Journal of Digital Convergence
• /
• v.20 no.3
• /
• pp.377-388
• /
• 2022

Various researches are actively studied to satisfy exponentially increasing the usage of the Internet as well as the diverse service demands. Especially the Optical Internet that delivers several Tbps through a single optical fiber requires the intelligence to satisfy the various types of survivability requirements. In the paper, a novel recovery scheme that satisfies the various restoration demands in IP over WDM networks is proposed. The scheme classifies the restoration services into three classes and applies dedicated protection and shared restoration scheme with different priorities for each class. Also, a configuration scheme for information database to support the scheme is proposed. This scheme satisfies the different degree of restoration demands in terms of restoration time, blocking rate and resource usage. With the scheme, medical data can be transmitted without loss.

• Proceedings of the Optical Society of Korea Conference
• /
• 2001.08a
• /
• pp.294-295
• /
• 2001

• Journal of the Optical Society of Korea
• /
• v.19 no.2
• /
• pp.206-206
• /
• 2015

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.3
• /
• pp.350-362
• /
• 1999

본 논문은 WDM(wavelength division multiplexing) 수동 성형망(passive star network)에서의 클라이언트/서버 트래픽을 위한 효율적인 TDM(time division multiplexing )스케쥴링을 제시한다. 클라이언트/서버 트래픽은 서버 노드의 소, 수신 트래픽 양이 클라이언트 노드간의 트래픽양에 비해 상대적으로 크다. 이러한 트래픽 특성 때문에 , TT-FR 시스템의 TDM 스케쥴링 방법을 적용할 때에 TDM 프레임 길이가 길어지게 된다. 본 논문에서 제시하는 TDM 스케쥴링은 TT-TR 시스템 알고리즘이다. 제시하는 스케쥴링에서는 서버 노드의 송신 및 수신에 각각 하나씩의 파장을 먼저 할당한다. 따라서 각 클라이언트 노드는 송, 수신 모두를 위해 파장 조정이 요구된다. 이러한 새로운 TDM 스케쥴링은 클라이언트/서버 트래픽에 적합하고 기존의 방법보다 짧은 프레임 길이를 제공하며, 또한 TDM 프레임길이의 하한을 새로이 제공한다. 제시한는 TT-TR 시스템 기반의 TDM 스케쥴링 알고리즘의 수행도 평가를 위해 다양한 시뮬레이션 분석을 수행하였다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.124-127
• /
• 2001

We consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it based on column generation technique and variable fixing. We devise a branch-and-price algorithm to solve the column generation problem. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.