• Title/Summary/Keyword: ingress OBS node

Search Result 7, Processing Time 0.023 seconds

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

  • Song Kyu-Yeop;Yoo Kyoung-Min;Yoo Wan;Lee Hae-Joung;Kim Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.8B
    • /
    • pp.514-524
    • /
    • 2005
  • In optical burst switching(OBS) networks, the ingress edge router assembles packets in the same class queue into the appropriate size of burst. A burst control packet(BCP) is generated for channel reservation of corresponding data burst and sent earlier than the corresponding data burst with an offset time. Offset time is determined considering the number of hops from source to destination and the required quality of service(QoS). After offset time, the burst data is passed through tile pre-configured optical switches without any O/E/O conversion. But a failure in OBS networks may lead to the loss of bursts until the ingress nodes receive the failure indication signal. This results in a significant degradation in QoS. Therefore, in this paper, we propose a fault-tolerant node architecture based on sub-carrier multiplexing to reduce the effects of failure in OBS networks. The Performance of the proposed fault-tolerant node architecture exhibits considerable improvement as compared with the previous ones.

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

  • 엄태원;최준균
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.10
    • /
    • pp.43-50
    • /
    • 2003
  • This paper describes the optical resource reservation protocol for Optical Burst Switching(OBS) networks, in which the burst sending time and the burst size at an ingress node are determined by the available resources between the ingress and egress nodes. Our scheme attempts to improve the burst contention resolution and optical channel utilization. We analyze the performance of the optical resource reservation protocol by using NS2 simulator.

Throughput-based fair bandwidth allocation in OBS networks

  • Le, Van Hoa;Vo, Viet Minh Nhat;Le, Manh Thanh
    • ETRI Journal
    • /
    • v.40 no.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
    • /
    • v.24 no.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
    • /
    • v.44 no.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
    • /
    • v.40 no.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)
    • /
    • v.13 no.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.