• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.673-674
• /
• 2011

본 논문에서는 OBS 망의 에지 라우터에서 소비되는 에너지를 절감하기 위한 통제 기반 동적 버스트 어셈블 알고리즘 (Constraint based Dynamic Burst Assemble algorithm : CDBA) 을 제안한다. 기존의 버스트 어셈블 알고리즘은 망의 성능 및 QoS (Quality of Service) 만을 고려한 고정된 버스트 어셈블 임계값을 사용하였으나 제시한 알고리즘은 에지 라우터에서 발생하는 에너지 소비율을 감소시키면서도 버스트 길이 및 패킷 지연과 같은 지표를 일정 수준이내로 유지함으로써 망의 성능을 보장한다. 제시한 알고리즘 평가를 위해 OPNET Modeler 를 사용하여 시뮬레이션을 수행하였으며, 에너지 절감율 및 패킷 지연 시간 관점에서 기존의 버스트 어셈블 알고리즘과 성능을 비교, 분석하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.892-901
• /
• 2001

Despite of many advantages over conventional radio paths, application of the Meteor Burst Path in commercial communication system is so far limited to a few extent because of its low duty rate, which is, less than several percent at best. In order to get through maximum number of data bits during the short interval of each burst, which normally lives a fractions of a second, a sophisticated communication protocol is called for. In this paper, author introduces a communication protocol which can effectively locate and fetch burst signal by sending out periodic detection signal from master station and, with minimal delay, switch over to transmission states so as to put as many data bits through the detected burst as the burst length permits. By analyzing time period required for each transaction steps, the author derives optimal packet length for various bursts which assures to get a message string through in minimum delay. According to the analysis, the author proposes a protocol including a routine which automatically accesses average length of bursts at each environment and automatically adapt length of data packet so as to maximize data throughput under Riven burst conditions.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.51-58
• /
• 2003

In this paper, we propose a group scheduling scheme to efficiently utilize network resources for core nodes in optical burst switching networks. This scheme schedules multiple bursts utilizing an interval graph to obtain the maximum stable set using the information such as arrival times and burst lengths from the collected header packets. Simultaneous scheduling of multiple bursts in a scheduling window results in lower burst loss probability and increased channel utilization than those proposed previously using one-to-one mapping. Simulation results for both cases of variable and fixed burst sizes show that the group scheduling scheme is better than the immediate scheduling, so called Latest Available Unused Channel with Void Filling, scheme in both performance metrics above mentioned.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.927-932
• /
• 2005

We investigate the effects on performance of using a partial retransmission mechanism in Optical Burst Switched(OBS) networks. In our scheme, the lost segments of a burst are retransmitted in the OBS layer. We also propose an optical resource reservation using the partial retransmission mechanism. Our scheme attempts to improve the burst contention resolution and optical channel utilization. The performance of the proposed mechanism is analyzed by NS2 simulations. Simulation results indicate that link utilization of the OBS network is improved makedly at the expense of signaling and ingress buffers.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.441-446
• /
• 2006

In recent years, WDM networks have received much attention as the Internet backbone networks because of the explosive growth of the Internet IP-based traffic. The Optical Burst Switching (OBS) has been proposed as an effective optical switching technology in the WDM networks. The OBS has the advantages in 1) the high usage rate of the bandwidth, and 2) no necessity of optical buffer. However, the OBS has the burst-contention problem in the networks. The deflection routing is proposed as one of means to solve this problem. In this paper, we propose a new routing method to minimize burst loss in the deflection routing based networks. In addition, we propose a QoS control method using a new routing algorithm. Finally, we show the variety of the proposed methods by computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.912-921
• /
• 2005

Optical burst switching(OBS) is a promising solution for building terabit optical routers and realizing If over WDM. Channel scheduling Algorithm for reduce contention is one of the major challenges in OBS. We address the issue of how to provide basic burst channel scheduling in optical burst switched WDM networks with fiber delay lines(FDLs). In OBS networks the control and payload components or a burst are sent separately with a time gap. If CHP arrives to burst switch node, because using scheduling algorithm for data burst, reservation resources such as wavelength and transmit data burst without O/E/O conversion, because contention and void between burst are happened at channel scheduling process for data burst that happened the link utilization and bust drop probability Existent proposed methods are become much research to solve these problems. Propose channel scheduling algorithm that use Release Time of bust to emphasize clearance between data and data dissipation that is happened in data assignment in this treatise and maximize bust drop probability and the resources use rate (RTUC : Release Time Unscheduled Channel). As simulation results, Confirmed that is more superior in terms of data drop and link utilization than scheduling algorithm that is proposed existing. As simulation results, confirmed improved performance than scheduling algorithm that is proposed existing in terms of survival of burst, efficiency resource and delay. However, In case load were less, degradation confirmed than existent scheduling algorithm relatively, and confirmed that is superior in data drop aspect in case of load increased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.6B
• /
• pp.828-839
• /
• 2001

이동 통신 환경에서는 비트 에러가 버스트 형태로 일어난다. 본 논문은 이러한 환경에서 MPEG-4 비디오를 전송하였을 때, 영향을 분석한다. MPEG-4에서 제공되는 에러 강인성 도구들이 얼마나 효과적인가를 에러의 버스트 정도에 따라 얼마나 효과적인가를 확률론적으로 해석하고, 컴퓨터 시뮬레이션 결과와 비교 분석한다. 이 분석 결과에 따라 버스트 에러의 정도에 따라 에러 강인성 도구들을 효과적으로 운용하는 방법을 정량적으로 제시한다.

• 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 Society of Computer Information Conference
• /
• 2008.06a
• /
• pp.39-45
• /
• 2008

ATM망에서 트래픽의 버스트니스를 완화하기 위한 UPC(Usage Parameter Control) 알고리즘을 제안한다. 기존의 다이나믹 스페이서는 그린 토큰이 축적되어 있을 경우 도착하는 셀을 스페이서와 상관없이 네트워크로 셀을 유입시키는 동적인 스페이서 기능을 수행함으로써 CDV(Cell Delay Variation)에 의한 셀을 위반셀로 구별하지 못하고 그대로 통과시키는 단점이 있다. 즉 스페이서 기능을 사용하지 않음으로써 버스트니스해 질 수 있다. 따라서 본 논문에서는 버스트니스를 완화하기 위한 토큰 버킷을 다이나믹 스페이서 이전에 사용함으로써 다이나믹 스페이서의 버스트니스를 완화시키는 토큰 버킷을 적용한 다이나믹 스페이서 UPC 알고리즘을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.404-413
• /
• 2003

Optical Internet consists of IP domain and optical (WDM) domain, where the wavelength routing (WR) and optical burst switching (OBS) are the promising switching technologies in the optical domain. In this paper, we perform the simulations on the WR network and the OBS network, and compare their performances. It is verified from our simulations that the OBS network performs better than the WR network when the same network resources are given.