• Title/Summary/Keyword: burst sending rate control

Search Result 2, Processing Time 0.013 seconds

Burst Sending Rate Control Scheme to Improve the Performance of Optical Burst Switching Networks (광 버스트 교환 망의 성능향상을 위한 버스트 전송률 제어 방식)

  • Lee Su kyoung;Kim Lae young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3A
    • /
    • pp.178-183
    • /
    • 2005
  • In Optical Burst Switching(OBS) networks, burst loss due to contention significantly affects the performance of networks. Even if many contention resolution schemes have been proposed, most of them have focused mainly on passively resolving contentions instead of avoiding them. In this paper, we propose an active contention avoidance scheme which controls a burst sending rate according to traffic load and burst loss in a network. Simulation results show that the proposed scheme can more effectively reduce the burst loss rate compared to existing OBS model with and without burst sending rate control, and at the same time guarantees throughput.

Dynamic Routing Algorithm based on Minimum Path-Cost in Optical Burst Switching Networks (광 버스트 스위칭 망에서 최소 경로비용 기반의 동적 경로배정 기법)

  • Lee Hae joung;Song Kyu yeop;Yoo Kyoung min;Yoo Wan;Kim Young chon
    • 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.