• Title/Summary/Keyword: Optical burst switching

Search Result 73, Processing Time 0.027 seconds

Performance of Prioritized Service Discipline Based on Hop Count for Optical Burst Switched Networks

  • Kim, Dong-Ok
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.6 no.3
    • /
    • pp.1-7
    • /
    • 2007
  • In this paper, we propose a new prioritized Optical Burst Switching (OBS) protocol based on a hop count, which can provide efficient utilization in optical networks. Under several legacy schemes, a switch drops the burst with the shortest time regardless of its traversed hop count. As a result, a dropped burst that have been traversed many hops might cause increased bandwidth waste compared to one that has traversed a few hops. To improve this problem, we propose the Just Enough Time (JET) with a hop counting scheme which can reduce the wasted bandwidth by prioritizing the burst traversed many hops over others. From the simulation result, it is preyed, we show that the proposed scheme has advantages against legacy schemes in terms of the burst blocking probability and the link utilization.

  • PDF

QoS Supporting Scheme Considering Service-Differentiation Ratio in Optical Burst Switching Networks (광 버스트 스위칭 망에서 서비스 차등률을 고려한 QoS 제공 기법)

  • 소원호;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.12C
    • /
    • pp.1197-1206
    • /
    • 2002
  • Recently, the research on the construction of optical Internet backbone networks using WDM has been actively progressed. In this paper, we propose the offset based service-differentiation scheme in optical burst switching (OBS) networks. We classify the services into two classes; high class and low class. The proposed scheme decides the offset time of high class so as to satisfy the required burst loss rate (BLR) of services according to the service-differentiation ratio (SDR). The SDR may be set depending on the environment of OBS network and user's requirements, our scheme decides the BLR of high class by using the required SDR and conservation law. Finally, we use the offset time decision (OTD) algorithm to determine the offset time of high class. The proposed scheme is evaluated through simulation. The result of simulation is compared with that of analysis to verify the proposed scheme.

Analysis of the Effect on Offset Time under Fault and Propose a New Restoration Scheme Considering QoS in OBS Networks (광 버스트 스위칭 망에서 망 고장에 대한 offset 시간 영향 분석 및 QoS를 고려한 장애 복구 기법)

  • 이해정;송규엽;소원호;김영천
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.12
    • /
    • pp.94-105
    • /
    • 2003
  • OBS(Optical Burst Switching) networks which decouple the burst from its header has characteristic one-way reservation. Therefore, the fault of a fiber link may lead to the magnitude of burst loss. Since sending a header packet and using an offset time before the transmission of the corresponding burst. In this paper, we analysis a offset time based on the burst loss rate resulting from only link failure and by applying the restoration schemes in an optical burst switching networks. The simulation results in terms of the effect of a offset time is evaluated in our network model to verify that comparing the numerical analysis with simulation result. Finally, and through these results, We propose the new restoration scheme based on offset time considered Quality of Service.

Preemption-based Service Differentiation Scheme for Optical Burst Switching Networks (광 버스트 교환망에서 Preemption 기반 서비스 차별화 기법)

  • 김병철;김준엽;조유제
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.10
    • /
    • pp.24-34
    • /
    • 2003
  • In this paper, we investigated the problems of the offset time based service differentiation scheme for optical burst switching (OBS) networks, and proposed the preemption-based service differentiation scheme which combines a preemption channel selection algorithm and channel partitioning algorithm. The proposed preemption channel selection algorithm minimizes the length of preempted bursts to improve the channel efficiency, while the proposed channel partitioning algorithm controls the degree of service differentiation between service classes. The simulation results showed that the proposed schemes could improve the end-to-end performance and effectively provide controllable service differentiation in the multiple hop network environments.

Absolute Differentiated Services for Optical Burst Switching Networks Using Dynamic Wavelength Assignment (동적 파장 할당 기법을 이용한 광 버스트 스위칭 네트워크에서의 절대적 QoS 제공)

  • 김성창;최진식;강민호
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.10
    • /
    • pp.8-15
    • /
    • 2003
  • In this paper, we address how to provide absolute differentiated services for optical burst switching (OBS) networks based on dynamic wavelength assignment. Unlike existing quality of service (QoS), such as buffer-based and offset-time based scheme, our proposed dynamicvirtual lambda partitioning (DVLP) scheme does not mandate any buffer or extra offset time, but can achieve absolute service differentiation between classes. This new DVLP scheme shares wavelength resources based on several different priority of classes in an efficient and QoS guaranteed manner. The performance results show that the proposed scheme effectively guarantees a target blocking probability of each traffic classes both in Poisson and Self-similar traffic environment.

Pre-reservation of Resources and Controlled Loops for Contention Resolution in OBS Networks

  • Comellas, Jaume;Conesa, Josep;Padaro, Salvatore;Junyent, Gabriel
    • ETRI Journal
    • /
    • v.29 no.5
    • /
    • pp.682-684
    • /
    • 2007
  • A new scheme to alleviate contention in optical burst switching networks is proposed. It consists of preventively reserving resources in a node, to be used if resources are busy on the next hop node. The burst is sent back to the preceding node and then resent forward. Simulations are carried out to assess the feasibility of the proposed scheme. Its performance is compared with that of contention resolution based on deflection routing.

  • PDF

A Preemptive Channel Reservation Scheme for Improving Burst Loss Performance in Optical Burst Switching Networks (광 인터넷에서 버스트 손실 성능 향상을 위한 채널 선정 방식)

  • Kim, Eun-Ah;Lee, Kang-Hyung;Lee, Su-Kyoung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.457-459
    • /
    • 2005
  • OBS(Optical Burst Switching) 망에서 우선 순위를 보장해 주기 위해 채널 선정 방식(preemptive channel reservation scheme)이 제안되어 왔다. 채널 선점으로 인해 drop된 버스트의 크기가 OBS 망의 전체 성능에 영향을 끼치는 요소인데도 불구하고 기존의 채널 선점 방식은 선점될 채널 선택 시에 버스트의 채널 사용 시간(elapsed time)만을 고려하고 있다. 따라서 본 논문에서는 각 버스트의 채널 사용 시간과 버스트 길이의 합이 작은 채널을 선택하는 선점 방식으로써 Length-based Smallest Elapsed time Selection(LSE)을 제안한다 시뮬레이션을 통하여 제안하는 LSE 방식이 기존의 SE(Smallest Elapsed time)에 비해서 버스트 손실 성능 면에서 우수함을 알 수 있었다.

  • PDF

Performance Evaluation and Offset Time Decision for Supporting Differential Multiple Services in Optical Burst Switched Networks (광 버스트 교환 망에서 차등적 다중 서비스 제공을 위한 offset 시간 결정 및 성능 평가)

  • So W.H.;im Y.C.K
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.1
    • /
    • pp.1-12
    • /
    • 2004
  • In this paper, we take advantage of the characteristics of optical burst switching (OBS) to support service-differentiation in optical networks. With the offset time between control packet and burst data, the proposed scheme uses different offset time of each service class. As contrasted with the Previous method, in which the high Priority service use only long offset time, it derives the burst loss rate as a QoS parameter in consideration of conservation law and given service-differential ratios and decides a reasonable offset time for this QoS finally Firstly proposed method classifies services into one of high or low class and is an algorithm deciding the offset time for supporting the required QoS of high class. In order to consider the multi-classes environment, we expand the analysis method of first algorithm and propose the second algorithm. It divides services into one of high or low group according to their burst loss rate and decides the offset time for high group, and lastly cumulates the offset time of each class. The proposed algorithms are evaluated through simulation. The result of simulation is compared with that of analysis to verify the proposed scheme.

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.