• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.2835-2842
• /
• 2013

In this paper, service differentiation scheme using optical buffer that is reduced in size with slow-light technology in optical burst switching networks is presented. In suggested scheme, each outport has buffer to store high-class burst only in case that all its wavelengths are occupied. When all wavelengths are being used, a new arriving high-class burst goes into the buffer and waits until a burst is serviced. As soon as a burst is serviced with a wavelength, the high-class burst at buffer is allocated to the free wavelength. In case that low-class burst is arriving under the same situation, it is not stored at the buffer but discarded. An analytical model is derived to analyze the performance of the suggested scheme and compare its performance with the conventional scheme such as preemption and deflection as well as no service differentiations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1906-1914
• /
• 2012

In this paper, relative service differentiation in JET based optical burst-switched networks with deflection routing is presented. It differs from conventional schemes in that it tries to make the loss rate of high class bursts as low as possible while maintaining the desired proportional ratio between the high class bursts and low class bursts. Strategies applied to it are dynamic wavelength allocation and the preemption which are combined to deflection routing. With dynamic wavelength allocation, the number of wavelengths allocated to high class bursts are dynamically changed. Preemption which gives more preference to high class bursts is also applied to decrease its loss rate. To lower the loss rate, deflection routing is applied for any kind of traffic. With those strategies, the suggested scheme shows desired properties that the loss rate of high class traffic is as lowered as possible. A queueing model for the scheme is developed to approximate loss ratio and the numerical results show that the proposed scheme provisions relative service differentiation.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.287-287
• /
• 2004

• Journal of Broadcast Engineering
• /
• v.20 no.5
• /
• pp.748-755
• /
• 2015

In this paper, sharing based admission control scheme is suggested for both service differentiation and improvement of wavelength utilization efficiency in burst switching networks. To provide service differentiation and high wavelength utilization efficiency, some of the wavelengths on a output link are shared with all classes and the others are used for the highest class exclusively. Markov based analysis is applied to the suggested scheme for the performance analysis and the numerical results are derived. The results are: The performance of lower traffic is more improved by the more number of shared wavelengths in case that the higher traffic or lower traffic is arrived equally or that the input rate of lower traffic is low. Another result is that the sharing effect of wavelengths is a little bit lowered when lower traffic passes the threshold.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.449-456
• /
• 2005

Optical burst switching (OBS) overcomes the inefficient resource usage of optical circuit switching and minimizes the optical buffering requirement of optical packet switching. General switch management protocol (GSMP) is an open interface between a label switch and a controller, and it provides connection, configuration, performance, event management and synchronization. GSMP open interface in the OBS network allows the implementation of OBS switch to be simple by separating the data forward plane from the control plane. We defined managed objects to support connection, configuration, performance, and fault management for the management of OBS network in the GSMP open interface. We proposed the network management model, in which the above managed objects are distributed in a controller and an OBS switch according to network management functions. We verified the possibility of connection management using distributed network management model in the GSMP open interface of OBS network by implementing GSMP and network management functions with managed objects of OBS.

• 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.