• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.658-668
• /
• 2011

Over the past decade, the improvement of communications technologies and the rapid spread of www (World Wide Web) have brought on the exponential growth of users using Internet and real time multimedia multicast services like video conferencing, tele-immersive virtual reality, and Internet games. The dense-wavelength division multiplexing (DWDM) networks have been widely accepted as a promising approach to meet the ever-increasing bandwidth demands of Internet users, especially in next generation Internet backbone networks for nation-wide or global coverage. A major challenge in the next generation Internet backbone networks based on DWDM technologies is the resolution of the multicasting RWA (Routing and Wavelength Assignment) problem; given a set of wavelengths in the DWDM network, we set up light-paths by routing and assigning a wavelength for each connection so that the multicast connections are set-upped as many as possible. Finding such optimal multicast connections has been proven to be Non-deterministic Polynomial-time-complete. In this paper, we suggest a new heuristic multicast routing and wavelength assignment method for multicast sessions called DVS-PMIPMR (Differentiated Virtual Source-based Priority Minimum Interference Path Multicast Routing algorithm). We measured the performance of the proposed algorithm in terms of number of wavelength and wavelength channel. The simulation results demonstrate that DVS-PMIPMR algorithm is superior to previous multicast routing algorithms.

• 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 Korea Multimedia Society
• /
• v.14 no.1
• /
• pp.33-43
• /
• 2011

Routing technologies considering QoS-based hypermedia services have been seen as a crucial network property in next generation optical Internet (NGOI) networks based on IP/dense-wavelength division multiplexing (DWDM). The huge potential capacity of one single fiber. which is in Tb/s range, can be exploited by applying DWDM technology which transfers multiple data streams (classified and aggregated IP traffics) on multiple wavelengths (classified with QoS-based) simultaneously. So, DWDM-based optical networks have been a favorable approach for the next generation optical backbone networks. Finding a qualified path meeting the multiple constraints is a multi-constraint optimization problem, which has been proven to be NP-complete and cannot be solved by a simple algorithm. The majority of previous works in DWDM networks has viewed heuristic QoS routing algorithms (as an extension of the current Internet routing paradigm) which are very complex and cause the operational and implementation overheads. This aspect will be more pronounced when the network is unstable or when the size of network is large. In this paper, we propose a flooding-based unicast and multicast QoS routing methodologies(YS-QUR and YS-QMR) which incur much lower message overhead yet yields a good connection establishment success rate. The simulation results demonstrate that the YS-QUR and YS-QMR algorithms are superior to the previous routing algorithms.

• Information and Communications Magazine
• /
• v.18 no.11
• /
• pp.82-95
• /
• 2001

OXC는 정적인 점대점 광전송망에서 동적인 그물형 전광통신망으로 진화하기 위하여 망에 도입되어야 할 새로운 광네트워크 장비이다. OXC는 링크 단위의 스위칭을 하는 FXC 파장 단위의 스위칭 기능이 있으나 파장 변환 기능이 없는 WSXC, 그리고 파장 변환 기능이 있는 WIXC로 구분할 수 있으며, 이들간의 hybrid 도 가능하다. OXC 하드웨어의 중심을 이루는 것은 광스위치이다. MEMS 기술, 열광학 효과를 이용한 광도파로 기술, 전반사를 이용하는 bubble 스위치 기술 등을 사용하여 개발이 진행되고 있다. 현재까지는 이 중 3D MEMS 기술이 대용량 스위치를 구성할 가능성이 있는 기술로 받아들여지고 있다. OXC를 구성하는데 있어서 또 다른 핵심적인 기술에는 파장변환 기술이 있다. 광전 파장변환기와 전광 파장변환기 방식이 현재 연구되고 있으며 초기에는 광전변환 방식이 OXC 시스템에 적용될 가능성이 높다. 전광 파장변환기의 시스템 적용을 위해서는 좀 더 많은 연구가 필요할 것으로 보인다. OXC를 사용하는 전광통신망에서 광스위치 기술 이상으로 많은 논란이 되는 것은 망의 운용 문제이다. 현재 가장 많이 언급되는 모델은 오버레이 모델과 피어 모델이다. 오버레이 모델은 클라이언트/서버 개념에 기반한 모델인 반면 피어 모델은 광 네트워크 장비와 기존 장비를 대등한 관계로 정의한 모델이다. 각각의 모델에 대해서는 표준화 단체에 따라 약간씩 다른 입장을 취하고 있지만 상호 간에 수용 또는 타협할 점이 많다고 볼 수 있다. OXC를 포함하는 전광 통신망을 운용할 때에는 동적 연결 설정 및 해제를 위한 새로운 신호 방식이 필요하다. 이를 위하여 ITU-T 및 OIF에서 UNI와 NNI등의 인터페이스와 여기에 사용되는 신호 방식을 논의하고 있다. 그 외에도 전광 통신망 운용에 필요한 라우팅 및 파장할당 방법과 OXC를 이용한 그물형 망에서의 보호 및 복구에 대한 연구도 활발히 진행되고 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1427-1433
• /
• 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 and the proposed aggressive reservation method improve blocking probability with appropriate reservation channel count.