• ETRI Journal
• /
• 제31권1호
• /
• pp.31-41
• /
• 2009

Optical burst switching is a promising switching paradigm for the next IP-over-optical network backbones. However, its burst loss performance is greatly affected by burst contention. Several methods have been proposed to address this problem, some of them requiring the network to be flooded by frequent state dissemination signaling messages. In this work, we present a traffic engineering approach for path selection with the objective of minimizing contention using only topological information. The main idea is to balance the traffic across the network to reduce congestion without incurring link state dissemination protocol penalties. We propose and evaluate two path selection strategies that clearly outperform shortest path routing. The proposed path selection strategies can be used in combination with other contention resolution methods to achieve higher levels of performance and support the network reaching stability when it is pushed under stringent working conditions. Results show that the network connectivity is an important parameter to consider.

• ETRI Journal
• /
• 제29권1호
• /
• pp.116-119
• /
• 2007

In this letter, we design a collision resolution protocol for optical burst switching ring networks to avoid burst collision. We define the offset time condition for no burst transmission collision and manage the free time list of nodes for no burst reception collision. In order to improve the throughput, we use a fiber delay line, void-filling, and void-compression. This protocol does not require any additional procedures for bandwidth reservation such as centralized assignment of bandwidth, lightpath setup of WDM ring networks, or token capturing for the burst transmission. The simulation results show that the proposed protocol can achieve high throughput while saving 70% of wavelengths when compared to round robin with random selection, round robin with persistent, and round robin with non-persistent with only destination delay.

• 한국군사과학기술학회지
• /
• 제10권3호
• /
• pp.129-138
• /
• 2007

Recently, Direction Finding(DF) System is using switching DF algorithm to reduce system-weight by eliminating RF cable as much as possible. Also, Correlation Vector Direction Finding(CVDF) algorithms is being used for Fast Direction finding in tactical environment. In this paper, I will give you burst error elimination algorithms and compare the performance in case we use switching CVDF algorithm. Although antenna array is not working, we will successfully perform direction finding when we use this burst error elimination algorithms. Also, we will be completely capable of DF mission despite of meeting the unwanted situation that the monitoring signal disappear in case we use Switching Direction Finding algorithms. That situation frequently occurs under the Frequency Hopping signal circumstances.

• ETRI Journal
• /
• 제30권2호
• /
• pp.216-226
• /
• 2008

This paper proposes a novel transport network architecture for the next generation network (NGN) based on the optical burst switching technology. The proposed architecture aims to provide efficient delivery of various types of network traffic by satisfying their quality-of-service constraints. To this end, we have developed a soft-state bandwidth reservation mechanism, which enables NGN transport nodes to dynamically reserve bandwidth needed for active data burst flows. The performance of the proposed mechanism is evaluated by means of numerical analysis and NS2 simulation. Our results show that the packet delay is kept within the constraint for each traffic flow and the burst loss rate is remarkably improved.

• 제어로봇시스템학회논문지
• /
• 제9권3호
• /
• pp.251-258
• /
• 2003

Optical Switching Matrix (OSM) or Optical Multistage Interconnection Networks (OMINs) comprising photonic switches have been studied extensively as important interconnecting blocks for Optical Cross Connects (OXC) based on Optical Burst Switching (OBS). A basic element of photonic switching networks is a 2$\times$2 directional coupler with two inputs and two outputs. This paper is concerned with the diagnosis of multiple crosstalk-faults in OSM. As the network size becomes larger in these days, the conventional diagnosis methods based on tests and simulation become inefficient, or even more impractical. We propose a simple and easily implementable algorithm for detection and isolation of the multiple crosstalk-faults in OSM. Specifically. we develop an algorithm for isolation of the source fault in switching elements whenever the multiple crosstalk-faults arc detected in OSM. The proposed algorithm is illustrated by an example of 16$\times$16 OSM.

• 대한전자공학회논문지TC
• /
• 제40권10호
• /
• pp.59-66
• /
• 2003

본 논문에서는 다수 트래픽 클래스들에게 최소 대역폭을 보장해 줄 수 있는 광버스트스위칭 (Optical Burst Switching, OBS) 기법을 제안한다. 현재까지 제안되었던 QoS (Quality of Service) 관련 OBS 기법들은 클래스간 차별화는 가능하였으나 여러 클래스들이 존재하는 경우 하위 우선순위의 트래픽 클래스는 상급 클래스와 충돌로 최소 대역폭을 보장해 주진 못 하였다. 본 논문에서는 클래스별로 데이터 채널의 일정 시간구간을 할당하여, 최소한 그 영역에서는 최상급 클래스보다도 높은 우선순위를 부여하여 최소 대역폭을 보장받도록 하였다. 이런 동작을 효율적으로 가능하게 하기 위해서 새로운 버스트 어셈블리 알고리즘과, 데이터 채널의 시간영역을 관리방법을 제안한다. 또한 제안된 기법의 단대단 지연시간과 성능을 시뮬레이션을 통해 검증하였다.

• Journal of Communications and Networks
• /
• 제8권2호
• /
• pp.234-240
• /
• 2006

We study the dynamic burst assembly based on traffic prediction and offset and delay differentiation in optical burst switching network. To improve existing burst assembly mechanism and build an adaptive flexible optical burst switching network, an approach called quality of service (QoS) based adaptive dynamic assembly (QADA) is proposed in this paper. QADA method takes into account current arrival traffic in prediction time adequately and performs adaptive dynamic assembly in limited burst assembly time (BAT) range. By the simulation of burst length error, the QADA method is proved better than the existing method and can achieve the small enough predictive error for real scenarios. Then the different dynamic ranges of BAT for four traffic classes are introduced to make delay differentiation. According to the limitation of BAT range, the burst assembly is classified into one-dimension limit and two-dimension limit. We draw a comparison between one-dimension and two-dimension limit with different prediction time under QoS based offset time and find that the one-dimensional approach offers better network performance, while the two-dimensional approach provides strict inter-class differentiation. Furthermore, the final simulation results in our network condition show that QADA can execute adaptive flexible burst assembly with dynamic BAT and achieve a latency reduction, delay fairness, and offset time QoS guarantee for different traffic classes.

• 한국통신학회논문지
• /
• 제29권2B호
• /
• pp.203-209
• /
• 2004

OBS 네크워크에서 contention으로 인한 burst의 drop은 TCP의 성능에 중요한 영향을 끼치는 요소이나, 기존의 drop policy에서는 이를 고려하지 않으며 TCP에 대한 연구로는 burst의 assembling이 주를 이루고 있다. 본 논문에서는 OBS 네트워크에서 TCP의 재전송 문제를 drop policy와 연계하여 TCP의 성능을 향상시키고자 한다. 본 논문에서 제안하는 drop policy는 burst의 재전송 횟수가 drop을 결정하는데 있어서 priority로 작용하는 Retransmission Count-based DP(RC-based DP)이다. RC-based DP 모델과 general DP 모델의 성능을 ns-2를 이용한 시뮬레이션을 통해 평가하며, 이 때 시간의 변화에 따른 TCP throughput, 목적지에서 수신한 최고 Sequence 번호, 패킷의 drop rate을 비교 분석한다.

• 대한전자공학회논문지TC
• /
• 제40권10호
• /
• pp.43-50
• /
• 2003

본 논문에서는 OBS 네트워크를 위한 광 자원 예약 프로토콜 (Optical Resource Reservation Protocol) 을 제안하였다. OBS 네트워크 상에서 광 자원 예약 프로토콜을 사용하면 입구 OBS 노드와 출구 OBS 노드 사이의 이용 가능한 광 자원을 측정하여 예약할 수 있고, 입구 OBS 노드에서는 예약된 파장 조각의 크기에 따라 버스트 전송 시간과 버스트 크기를 설정하여 보냄으로써 OBS 네트워크에서의 블록 킹 문제를 해결할 수 있을 뿐만 아니라, 광 채널 이용률을 최대 두 배 가까이 증가시킬 수 있다. 본 논문에서는 NS2 시뮬레이터를 이용하여 제안된 광 자원 예약 프로토콜의 성능을 분석하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권5호
• /
• pp.1606-1623
• /
• 2015

Optical switching will be applied in datacenter networks because electronic switching is costly and power-consuming. In this paper, considering the ring-based interconnection using optical switching in the core of a datacenter, we study the home circuit (HC) construction for the labeled optical burst switching with home circuit (LOBS-HC), a new paradigm trying to share wavelengths among the HCs from the same source. In particular, aiming to construct HCs dynamically and properly, a scheme named optimal path matching and symmetric HC matching (OPM-SHM) is proposed. The main idea of OPM-SHM is to dynamically construct HCs by sharing wavelength(s) not only among the same-source HCs but also with symmetric HCs which have different sources other than the original LOBS-HC features. The simulation results demonstrate that OPM-SHM achieves better performance than some other methods in terms of burst loss rate and wavelength utilization of physical links. More specially, it maintains good load balancing for the datacenter network using an LOBS-HC ring. In addition, due to the symmetric feature of SHM, the proposed scheme can decrease the upper bound of the average hop count of the routing paths to half of the ring size.