• 제목/요약/키워드: ingress OBS node

검색결과 7건 처리시간 0.025초

광 버스트 스위칭 망에서 장애에 둔감한 SCM 기반의 노드 구조 설계 (Design of Fault-Tolerant Node Architecture based on SCM in Optical Burst Switching Networks)

  • 송규엽;유경민;유완;이해정;김영천
    • 한국통신학회논문지
    • /
    • 제30권8B호
    • /
    • pp.514-524
    • /
    • 2005
  • 광 버스트 스위칭 망은 Ingress 에지 라우터에서 입력된 If 패킷을 모아서 데이터 버스트를 생성하고 과도한 프로세싱 오버헤드 없이 효율적인 버스트 교환을 수행하기 위하여 채널에 대한 예약을 목적으로 데이터 버스트보다 offset 시간 이전에 제어 패킷을 전송하여 파장 채널을 예약한다. 따라서 OBS 방식은 광 계층에서 버퍼에 의존하지 않고 단방향 예약 방식으로 빠르게 투명성을 지닌 광전송 경로를 설정할 수 있다. 그러나 링크 장애와 같은 망 장애가 발생할 경우 광 버스트 스위칭 망의 단 방향 예약 특성 때문에 데이터 버스트의 많은 손실이 발생하게 되어 트래픽 QoS에 심각한 영향을 초래하게 된다. 따라서 본 논문에서는 광 버스트 스위칭 망에서 장애 발생시에도 손실되는 버스트를 최소화하여 QoS를 보장할 수 있도록 Ingress 에지 라우터에서는 부 반송파 다중화 방식 기반의 버스트 생성 및 전송모듈 구조를 설계하고 코어 망에서는 신속한 장애 복구가 가능한 혼합형 장애 복구 기법을 제안하였다. 또한 제안된 기법의 성능 평가를 위하여 망 장애 발생에 따른 버스트 손실률, 버스트 처리율 및 망 자원 사용량 관점에서 기존의 기법과 비교 평가하였다.

OBS 네트워크를 위한 광 자원 예약 프로토콜 (Optical Resource Reservation Protocol for OBS Networks)

  • 엄태원;최준균
    • 대한전자공학회논문지TC
    • /
    • 제40권10호
    • /
    • pp.43-50
    • /
    • 2003
  • 본 논문에서는 OBS 네트워크를 위한 광 자원 예약 프로토콜 (Optical Resource Reservation Protocol) 을 제안하였다. OBS 네트워크 상에서 광 자원 예약 프로토콜을 사용하면 입구 OBS 노드와 출구 OBS 노드 사이의 이용 가능한 광 자원을 측정하여 예약할 수 있고, 입구 OBS 노드에서는 예약된 파장 조각의 크기에 따라 버스트 전송 시간과 버스트 크기를 설정하여 보냄으로써 OBS 네트워크에서의 블록 킹 문제를 해결할 수 있을 뿐만 아니라, 광 채널 이용률을 최대 두 배 가까이 증가시킬 수 있다. 본 논문에서는 NS2 시뮬레이터를 이용하여 제안된 광 자원 예약 프로토콜의 성능을 분석하였다.

Throughput-based fair bandwidth allocation in OBS networks

  • Le, Van Hoa;Vo, Viet Minh Nhat;Le, Manh Thanh
    • ETRI Journal
    • /
    • 제40권5호
    • /
    • pp.624-633
    • /
    • 2018
  • Fair bandwidth allocation (FBA) has been studied in optical burst switching (OBS) networks, with the main idea being to map the max-min fairness in traditional IP networks to the fair-loss probability in OBS networks. This approach has proven to be fair in terms of the bandwidth allocation for differential connections, but the use of the ErlangB formula to calculate the theoretical loss probability has made this approach applicable only to Poisson flows. Furthermore, it is necessary to have a reasonable fairness measure to evaluate FBA models. This article proposes an approach involving throughput-based-FBA, called TFBA, and recommends a new fairness measure that is based on the ratio of the actual throughput to the allocated bandwidth. An analytical model for the performance of the output link with TFBA is also proposed.

A Data Burst Assembly Algorithm in Optical Burst Switching Networks

  • Oh, Se-Yoon;Hong, Hyun-Ha;Kang, Min-Ho
    • ETRI Journal
    • /
    • 제24권4호
    • /
    • pp.311-322
    • /
    • 2002
  • 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.

  • PDF

Modeling of a controlled retransmission scheme for loss recovery in optical burst switching networks

  • Duong, Phuoc Dat;Nguyen, Hong Quoc;Dang, Thanh Chuong;Vo, Viet Minh Nhat
    • ETRI Journal
    • /
    • 제44권2호
    • /
    • pp.274-285
    • /
    • 2022
  • Retransmission in optical burst switching networks is a solution to recover data loss by retransmitting the dropped burst. The ingress node temporarily stores a copy of the complete burst and sends it each time it receives a retransmission request from the core node. Some retransmission schemes have been suggested, but uncontrolled retransmission often increases the network load, consumes more bandwidth, and consequently, increases the probability of contention. Controlled retransmission is therefore essential. This paper proposes a new controlled retransmission scheme for loss recovery, where the available bandwidth of wavelength channels and the burst lifetime are referred to as network conditions to determine whether to transmit a dropped burst. A retrial queue-based analysis model is also constructed to validate the proposed retransmission scheme. The simulation and analysis results show that the controlled retransmission scheme is more efficient than the previously suggested schemes regarding byte loss probability, successful retransmission rate, and network throughput.

Delay Fairness Using the Burst Assembly for Service Differentiation

  • Vo, Viet Minh Nhat;Le, Van Hoa;Le, Manh Thanh
    • ETRI Journal
    • /
    • 제40권3호
    • /
    • pp.347-354
    • /
    • 2018
  • Using various offset times to separate differential services is the most common form of service differentiation in optical burst switching networks. In this approach, a larger offset time is given to a higher priority burst, but it causes this burst to have a longer delay. One solution to this problem is to adjust the burst assembly time so that the buffering delay of the higher priority burst is always shorter than that of the lower priority burst. However, this adjustment causes another problem, called delay unfairness, for bursts with differential priorities that share the same path to their destination. This article proposes a new solution for delay fairness using the burst assembly.

Kalman Filtering-based Traffic Prediction for Software Defined Intra-data Center Networks

  • Mbous, Jacques;Jiang, Tao;Tang, Ming;Fu, Songnian;Liu, Deming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권6호
    • /
    • pp.2964-2985
    • /
    • 2019
  • Global data center IP traffic is expected to reach 20.6 zettabytes (ZB) by the end of 2021. Intra-data center networks (Intra-DCN) will account for 71.5% of the data center traffic flow and will be the largest portion of the traffic. The understanding of traffic distribution in IntraDCN is still sketchy. It causes significant amount of bandwidth to go unutilized, and creates avoidable choke points. Conventional transport protocols such as Optical Packet Switching (OPS) and Optical Burst Switching (OBS) allow a one-sided view of the traffic flow in the network. This therefore causes disjointed and uncoordinated decision-making at each node. For effective resource planning, there is the need to consider joining the distributed with centralized management which anticipates the system's needs and regulates the entire network. Methods derived from Kalman filters have proved effective in planning road networks. Considering the network available bandwidth as data transport highways, we propose an intelligent enhanced SDN concept applied to OBS architecture. A management plane (MP) is added to conventional control (CP) and data planes (DP). The MP assembles the traffic spatio-temporal parameters from ingress nodes, uses Kalman filtering prediction-based algorithm to estimate traffic demand. Prior to packets arrival at edges nodes, it regularly forwards updates of resources allocation to CPs. Simulations were done on a hybrid scheme (1+1) and on the centralized OBS. The results demonstrated that the proposition decreases the packet loss ratio. It also improves network latency and throughput-up to 84 and 51%, respectively, versus the traditional scheme.