• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.34-39
• /
• 2005

In this paper, we propose a new prioritized Optical Burst Switching (OBS) protocol based on a hop count, which can provide an efficient utilization in optical Wireless networks. Under several legacy schemes, a switch drops the burst with a shorter time among ones regardless of its traversed hop count. As a result, the dropped burst that have been traversed more hops might cause to waste bandwidth than the one traversed a few hops. Noting that this problem, we propose the Just Enough Time(JET) with a hop count scheme which can reduce the wasted bandwidth by prioritizing the burst traversed more hops over others. From the simulation result, we show that the proposed scheme is advantageous over the legacy schemes in terms of the burst blocking probability and the link utilization.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.257-260
• /
• 2005

인터넷 사용자의 증가에 따른 데이터 수요와 트래픽 증가에 따라 오늘날의 네트워크는 빠른 전송 속도와 넓은 대역폭을 요구한다. OBS 기반 광 네트워크는 이러한 요구사항을 만족시킬 수 있는 방안으로 활발히 연구가 진행되고 있으나, 도청, 위장, DoS 등의 보안 위협에 취약하다. 본 논문에서는 OBS 기반 광 네트워크에서 존재하는 보안 취약점 및 보안 공격을 분석하며, 이를 기반으로 안전한 서비스 제공을 위해 인증 및 키 분배 가능한 정보보호 프로토콜을 제시한다. 본 논문에서는 OBS 기반 광 네트워크에서 보안 기능을 강화하기 위해 제어 메시지를 이용하여 명시적 인증을 제공하며, 공통키값을 이용하여 제어 메시지를 보호한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.72-84
• /
• 2005

Optical burst switching networks usually employ one-way reservation by sending a burst control packet with a specific offset time, before transmitting each data burst Same. Due to such a Property, burst-contentions occur when multiple bursts contend for the same wavelength in the same output link simultaneously in a node, leading to burst losses, eventually degrading the quality of service. Therefore, in this paper, we propose a dynamic routing algorithm using minimum local state information in order to decrease burst-contentions. In this proposed scheme, if burst loss rate exceeds a threshold value at a certain node, a new alternative routing path is chosen according to burst priority and location of burst generation, which enables the contending bursts to detour around the congested link. Moreover, for reducing the effect of sending bursts on the primary path due to the alternative path, we also apply a minimum path-cost based routing on link-cost concept. Our simulation results show that proposed scheme improves the network performance in terms of burst loss probability and throughput by comparing with conventional one.