• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.925-933
• /
• 2003

Network is expected to be developed into optical Internet network collected IP layer and optical layer, but GMPLS is risen at the transitional evolution stage because of the present technology level. GMPLS that MPLS is extended and generalized is able to support not only the packet switching device but also the devices which perform switching in time, wavelength, and space domain. To implement the common control plane to these various switching types, GMPLS extends the existing MPLS signaling and routing protocol. In this paper, we describe the overview of GMPLS technology, and then we will refer to the OSPF(Open Shortest Path First), which was used to exchange the status information of link, as the plan of routing extension to exchange the information of various link type, bandwidth, link protection type etc. And also, we describe the definition of new protocol, so called, LMP that is a signaling protocol for solving complex problem which manages hundreds and thousands of links between two nodes. And we will examine and analyze the plan of signaling protocol extension to apply signaling protocol RSVP-TE(Resource Reservation Protocol) for traffic engineering in MPLS to network, and the message objects and formats associated with modified RSVP.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12A
• /
• pp.1285-1290
• /
• 2004

In this paper, a new algorithm for contention resolution in optical burst switched network is proposed and simulated. The proposed algorithm is made from the all mixing of wavelength conversion, deflection routing, segmentation, and optical fiber delay line buffering. We analysis the performance of the proposed contention resolution algorithm by using ns-2. The application of the algorithm into Korea backbone network shows the superior performance of a low burst loss probability.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.734-740
• /
• 2003

링 루팅 및 파장할당 문제는 최근 활발하게 구축되는 있는 WDM 링의 설계 및 운용에 있어서 매우 중요한 문제이다. 이 문제는 링 상의 노드 쌍간에 단위수요가 주어졌을 때, 각 수요들을 링 상의 두 가지 가능한 경로 중 하나로 보내기 위한 광경로의 설정과 설정된 광경로에 파장을 할당하는 두 가지 의사결정을 동시에 결정하여야 하는 매우 복잡한 문제이다. 또한 파장할당시에 동일한 링크를 공유하는 광경로에는 동일한 파장을 할당할 수 없다는 제악이 있으면서, 목적함수는 할당하는 파장의 수를 죄소화하는 것이 된다. 본 연구에서는 링 루팅 및 파장할당 문제에 대매 평행루팅을 만족하는 최적해가 항상 존재한다는 것을 보이고, 최적해의 다양한 특성들을 규명하기로 한다. 또한 새로운 하한을 제시하고 이 하한이 기존의 하한에 비해서 매우 효과적임을 보이도록 한다.

• Journal of KIISE:Information Networking
• /
• v.28 no.1
• /
• pp.1-10
• /
• 2001

파장경로주가 통신망은 근원지에서 목적지까지 정보가 빛의 형태로 전달되는 전광 통신망이다. 정보는 빛의 길을 통해 전달되어 지는데 이는 광 채널들을 교환 연결방식을 이용하여 연결함으로써 만들어진다. 링크간의 연결이 복수개의 광섬유로 이루어진 파장 경로주기 통신망에서는 광섬유간의 교환능력을 통해 더욱 효율적으로 채널들을 이용할 수 있다. 이논문에서는 주어진 연결 요구들을 충족시키는 오프라인 채널 지정문제를 통하여 링이나 트리 구조를 갖는 통신망에서 광섬유간의 교환 능력이 미치는 영향을 조사해 보았다. 주어진 연결 요구들은 하나의 변수인 부하로 나타내 진다. 링의 형태를 갖는 통신망에서 부하를 교환기의 크기에 대한 함수로 나타냄으로써 교환기의 크기가 미치는 영향을 수량화했고 트리의 형태를 가는 통신망에서는 일반적으로 부하가 L일 때 하나의 링크에 L개의 채널을 사용하여 채널 지정을 얻기에는 광섬유간의 교환이 충분하지 않다는 반증을 보였다.

• Proceedings of the Optical Society of Korea Conference
• /
• 2000.08a
• /
• pp.30-31
• /
• 2000

파장 분할 다중 방식을 사용하는 모든 전광 통신망은 파장 재사용과 routing를 위해 반드시 파장 변환기를 필요로 한다. 본 논문에서는 반도체 광 증폭기와 반도체 레이저를 수평 결합시킨 새로운 구조를 제안함으로써 기존의 파장 변환기가 가졌던 문제점들을[1][2][3] 해결하고자 한다. 두개의 모드가 약하게 결합되었을 때는 그 파의 크기나 전파상수는 서로 영향을 미치게 된다. 예를 들면 수평결합 파장가변 LD[4]나 방향성 결합 파장 변환기[5]는 이 특성을 이용한 소자이다. 본 논문에서 제안된 소자도 이러한 결합모드 특성을 이용하였다. (중략)

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

A series of papers in recent literature on logical topology design for wavelength routed optical networks have proposed mathematical models and solution methods unifying logical topology design wavelength assignment and traffic routing. The most recent one is by Krishnaswamy and Sivarajan which is more unifying and complete than the previous models. Especially the mathematical formulation is an integer linear program and hence regarded in readiness for an efficient solution method compared to the previous nonlinear programming models. The solution method in [7] is however elementary one relying on the rounding of linear program relaxation. When the rounding happens to be successful it tends to produce near-optimal solutions. In general there is no such guarantee so that the obtained solution may not satisfy the essential constraints such as logical -path hop-count and even wavelength number constraints. Also the computational efforts for linear program relaxation seems to be too excessive. In this paper we propose an improved and unifying solution method based on the same to be too excessive. In this paper we propose an improved and unifying solution method based on the same model. First its computation is considerably smaller. Second it guarantees the solution satisfies all the constraints. Finally applied the same instances the quality of solution is fairly competitive to the previous near optimal solution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.11
• /
• pp.1689-1700
• /
• 1993

WDM(Wavelength Division Multiplexing) based-on fixed wavelengths is a new means of utilizing the bandwidth of optical fibers. In this Paper, an improved virtual topology called "(a, $\beta$,${\gamma}$) ShuffleNet " is introdced for designing large-scale WDM switches. The proposed one is an architecture created by vertically stacking x planes of a ($\beta$,${\gamma}$) ShuffleNet in parallel via $\beta$r nodes called "bridge nodes" so that N-by-N(N=(x*$\beta$${\gamma}$*${\gamma}$) switching is achieved based on the self-routing algorithm for each ($\beta$,${\gamma}$) ShuffleNet. With the topological parallelism, in contrast to the conventional virtual topologies, the diameter of 2${\gamma}$ hops can be fixed and high utilization and performance are provided while N increases. Such a scalability characteristic allows to design a growable broadband switch. As for the delay, we show that the traffic locality, due to the topological feature. result in low delay characteristics.lay characteristics.

• The Journal of the Korea Contents Association
• /
• v.4 no.2
• /
• pp.68-75
• /
• 2004

In this paper, n study a distributed establishment scheme to setup lightpath in WDM/TDM Network considering user traffic characteristics. We propose a GBTA(guaranteed-bandwidth time-slot allocation) algorithm which assigns time-slots according to the requred traffic so that it can utilize given network resources efficiently in RWTA(routing and wavelength time-slot assignment) schemes. We consider traffic specification on the basis of ATM traffic classes. Also, in order to increase link utilization and minimize blocking probability, we extend distributed lightpath establishment protocol based on GBTA algorithm. In order to establish lightpath in distributed WDM/IDM network, we use backward resonation protocol that resewes resource with recent information. We use DOWTns(Distributed Optical WDM/TDM ns) that is extended from NS(Network Simulator), in order to verify proposed GBTA-based optical wavelength routed network.

• 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 Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.2835-2842
• /
• 2013

In this paper, service differentiation scheme using optical buffer that is reduced in size with slow-light technology in optical burst switching networks is presented. In suggested scheme, each outport has buffer to store high-class burst only in case that all its wavelengths are occupied. When all wavelengths are being used, a new arriving high-class burst goes into the buffer and waits until a burst is serviced. As soon as a burst is serviced with a wavelength, the high-class burst at buffer is allocated to the free wavelength. In case that low-class burst is arriving under the same situation, it is not stored at the buffer but discarded. An analytical model is derived to analyze the performance of the suggested scheme and compare its performance with the conventional scheme such as preemption and deflection as well as no service differentiations.