z-logo
open-access-imgOpen Access
A Data Burst Assembly Algorithm in Optical Burst Switching Networks
Author(s) -
Oh Seyoon,
Hong Hyun Ha,
Kang Minho
Publication year - 2002
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.02.0102.0406
Subject(s) - optical burst switching , burst switching , computer science , computer network , queueing theory , network packet , real time computing , transmission delay , optical performance monitoring , materials science , wavelength division multiplexing , wavelength , optoelectronics
Presently, optical burst switching (OBS) technology is under study as a promising solution for the backbone of the optical Internet in the near future because OBS eliminates the optical buffer problem at the switching node with the help of no optical/electro/optical conversion and guarantees class of service without any buffering. To implement the OBS network, there are a lot of challenging issues to be solved. The edge router, burst offset time management, and burst assembly mechanism are critical issues. In addition, the core router needs data burst and control header packet scheduling, a protection and restoration mechanism, and a contention resolution scheme. In this paper, we focus on the burst assembly mechanism. We present a novel data burst generation algorithm that uses hysteresis characteristics in the queueing model for the ingress edge node in optical burst switching networks. Simulation with Poisson and self‐similar traffic models shows that this algorithm adaptively changes the data burst size according to the offered load and offers high average data burst utilization with a lower timer operation. It also reduces the possibility of a continuous blocking problem in the bandwidth reservation request, limits the maximum queueing delay, and minimizes the required burst size by lifting up data burst utilization for bursty input IP traffic.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here