Ingress Edge Node Research Articles

Learning-Based Transmission Protocol Customization for VoD Streaming in Cybertwin-Enabled Next-Generation Core Networks

Next-generation core networks are expected to achieve service-oriented traffic management for diversified Quality-of-Service (QoS) provisioning based on software-defined networking (SDN) and network function virtualization (NFV). In this article, a learning-based transmission protocol customized for Video-on-Demand (VoD) streaming services is proposed for a Cybertwin-enabled next-generation core network, which provides caching-based congestion control and throughput enhancement functionalities at the edge of the core network based on traffic prediction. The per-slot traffic load of a VoD streaming service at an ingress edge node is predicted based on the autoregressive integrated moving average (ARIMA) model. To balance the tradeoff between network congestion and throughput enhancement, a multiarmed bandit (MAB) problem is formulated to maximize the expected overall network performance in a long run, by capturing the relationship between transmission control actions and QoS provisioning. A comprehensive transmission protocol operation framework is also presented with in-network congestion control and throughput enhancement modules. Simulation results are presented to validate the efficacy of the proposed protocol in terms of packet delay, goodput ratio, throughput, and resource utilization.

PBB-TE 기반의 패킷전송시스템에서 멀티캐스트 서비스와 계층적 QoS 구현

We have proposed a solution to multicast services and an advanced quality of service (QoS) mechanism on a packet transport system (PTS) based on PBB-TE. The point-to-multipoint (PtMP) connection in the PBB-TE system have been realized by grouping point-to-point (PtP) PTL trunks and mapping a BSI onto the PtP PTL trunks using a multicast backbone destination address. To provide end-to-end QoS of the PtMP services, the hierarchical QoS scheme for backbone service instances and connection-oriented paths has been implemented in the PTS. For providing different capabilities for service selection and priority selection, the PTS offers to customers three basic types of the port-based, C-tagged, and S-tagged service interface defined by the IEEE 802.1ah. To offer to customers different capabilities of the layer 3 applications and services, moreover, an IP-flow service interface have been added. In order to evaluate traffic performance for PtMP services in the PTS, the PtMP throughputs for the link capacity of 1 Gbps at the four service interfaces were measured in the leaves of the ingress edge node, the transit node, and the egress edge node. The throughputs were about 96 % because the B-MAC overhead of 22 bytes occupies 4% of the 512-byte packet. The QoS performance is ability to guarantee an application or a user a required bandwidth, and could be evaluated by the accuracy of policing or shaping. The accuracy of the policing scheme and the accuracy of the shaping scheme were 99% and 99.3% respectively.

A framework for deterministic delay guarantee in OBS networks

In OBS networks, the delay of control packets in the switch control unit (SCU) of core nodes influences burst loss performance in the optical switching and should be constrained. Furthermore, the end-to-end (E2E) delay requirements of premium services need queueing delay guarantee in network nodes throughout the transmission path. For this purpose, a framework for deterministic delay guarantee is proposed in this article. It incorporates the deterministic delay model in the ingress edge node as well as in the SCUs of core nodes. On this basis, the configuration of the assembler and the offset time is addressed by means of an optimization problem under the delay constraints. Scenario studies are carried out with reference to realistic transport network topologies. Compared to statistical delay models in the literature, the deterministic model has advantages in rendering robust absolute delay guarantee for individual FEC flows, which is especially appreciated in the provisioning of premium services. By performance evaluation in comparison with the statistical models, it is shown that the adopted deterministic delay models lead to practical delay bounds in a magnitude that is close to the delay estimations by stochastic analysis.

Analysis of burst/packet assembly techniques in high-speed optical switching network

In the Optical Burst Switching (OBS) Network, the burst assembly technique is one of the challenging issues in the implementation of the system. It has the influence on the burst characteristic, which gives an impact on the network performance. Burst assembly is the process of assembling incoming data from the higher layer into bursts at the ingress edge node of the OBS network. The burst assembly mechanism must then place these packets into bursts based on some assembly policy. In this paper, the OBS system performance has been observed in simulated 12-node network based on Just-Enough-Time (JET) reservation protocol with various burst assembly techniques under the standard drop policy (DP) and the segmentation policy for contention resolution. The simulation results show that the performance of the proposed Adaptive-Threshold with Fixed Maximum Time Limitation (ATH-FMTL) burst assembly scheme is better than conventional burst assembly schemes in terms of loss probability and average assembly delay. Also, the proposed scheme avoids a sudden increase in the burst size and makes the burst sent out smoother as compared to conventional schemes.

Burst transmission algorithm to improve packet level performance in contention-free slotted OBS networks

In contention-free slotted optical burst switching (SOBS) networks, controllers are utilized in order to manage the time-slot assignment, avoiding congestions among multiple burst transmissions. In this network, bursts are never lost at intermediate nodes but packets are lost at an ingress edge node due to a burst transmission algorithm. In addition, packet transmission delay increases depending on the algorithm. In order to improve packet level performance, in this paper, we propose a new burst transmission algorithm. In this method, two different thresholds are used; one is used to send a control packet to a controller and the other is used to assemble a burst. With these thresholds, a time slot can be assigned to a burst in advance and packet level performance can be improved. In order to evaluate its packet level performance and investigate the impact of thresholds, we also propose a queueing model of a finite buffer where a batch of packets are served in a slot of a constant length. Numerical results show that our proposed method can decrease packet loss probability and transmission delay with two thresholds. In addition, we show that our analysis results are effective to investigate the performance of the proposed method when the number of wavelengths is large.

Demonstration of 10 Gbit Ethernet/Optical-Packet Converter for IP Over Optical Packet Switching Network

We developed novel network interfaces, for example 10 Gbit Ethernet to 80 Gbit/s optical-packet (10 GbitE-80 GbitOP) or 80 Gbit/s optical-packet to 10 Gbit Ethernet (80 GbitOP-10 GbitE) converters (collectively called as 10 GbitE/80 GbitOP converters), to connect optical packet switching (OPS) networks with IP technology-based networks. By using newly developed arrayed burst-mode optical packet transmitters/receivers together, the 10 GbitE-80 GbitOP converter at the ingress edge node of the OPS network encapsulates an IP packet into an 80(8lambda×10) Gbit/s dense wavelength division multiplexing (DWDM)-based optical packets and generates an optical label based on a lookup table and the destination addresses of the IP packet. The 80 GbitOP-10 GbitE converter at the egress edge node decapsulates the IP packet from the optical packet and generates a 10 GbitE frame accommodating the IP packet according to a lookup table. By using these network interface devices and OPS system based on multiple optical label processing, we achieved, for the first time, 74-km single-mode fiber transmission, switching, and buffering of 80(8lambda×10) Gbit/s DWDM-based optical packets encapsulating almost 10 Gbit/s IP packets with error-free operation (IP packet loss rate < 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-6</sup> ).

TCP Performance Over Optical Burst-Switched Networks With Different Access Technologies

The interworking between different access networks and an optical burst switched network is considered here. The end-to-end performance of the TCP (Transmission Control Protocol) is evaluated by jointly accounting for access network protocols and the burst assembly procedure at ingress edge nodes, both with wired and wireless access solutions, based on electrical and advanced optical technologies. The influence of the assembly timeout in different access contexts is presented, and numerical investigations are performed by means of ns-2 simulations. Results show that end-to-end throughput is mostly influenced by the delay introduced by access protocols, which arise in the analyzed different scenarios, and by assembly timeout. These results provide meaningful insights about interconnected systems to the task of overall network design and, in particular, to the setup of the interworking unit parameters.

Deterministic delay guarantee in OBS edge node for premium services

In optical burst switched (OBS) networks, the queueing delay in ingress edge node is an important performance measure. In this paper, we propose a deterministic delay model and derive the upper bound of the burst queueing delay in an edge node. On this basis, the edge-to-edge delay guarantee framework for premium services is further outlined.

An adaptive load-aware burst assembly scheme to achieve optimal performance of FDL buffers in OBS networks

Optical burst switching (OBS) is regarded as one of the most promising switching technologies for next generation optical networks. Contention resolution of data bursts is a critical mission to implement practical OBS. The use of fiber delay line (FDL) buffers has received a lot of attention as a fundamental but effective solution to resolve burst contention. Several studies have investigated the way to achieve the optimal performance of FDL buffers at a single-node level. However, this article studies how to achieve the best performance of OBS networks with FDL buffers under varying traffic condition at a network level. For this purpose, we propose an adaptive load-aware burst assembly (ALBA) scheme, which adaptively adjusts the size threshold of burst assembler optimized to the current network traffic load. A piggybacking method used to deliver the traffic-load information from core nodes to ingress edge nodes accelerates the adaptiveness of the proposed scheme by reducing the update time of the size threshold. The effectiveness of the ALBA scheme is proved by comparing with No-FDL case and fixed size-threshold cases under changing traffic-load environment from extensive simulation tests.

Modeling and analysis of the optical burst switching network

A detailed queuing model of the optical burst switching network has been proposed. Based on the queuing model, a constraint analysis is done to show that the burst assembly time at the ingress edge node cannot be arbitrarily large or small. Rather, it has finite lower and upper limits depending on the network parameters.

Analysis of Delay Characteristics in MPsLS Forwarding Scheme

The delay characteristics of the MPsLS, a data forwarding scheme used for a core area of the integrated data service network, are discussed and analyzed. MPsLS has the capability of guaranteeing QoS on the per-flow level for time-sensitive applications and simultaneously maintaining the high utilization of network resources. In the MPsLS core area, the forwarding process is implemented with a fine-grain slot synchronization model, and at the ingress edge nodes, the forwarding process is carried with a coarse-grain frame synchronization model. The delay analyses are done according to three service models: the exact synchronization model, the less strict synchronization model for the appointed channels, and an asynchronous model for the filler channels. The authors give estimation equations of mean delay between edge-to-edge nodes in an MPsLS network, and introduce an effective method to determine the reserved bandwidth for given application flows based on numerical calculations from those theory analysis and simple simulation results.

Burst-cluster transmission: service differentiation mechanism for immediate reservation in optical burst switching networks

In this article we propose a service differentiated burst transmission called burst-cluster transmission to provide service differentiation in terms of burst loss for optical burst switching networks. The proposed method consists of a burst assembly algorithm and burst transmission scheduling, and it works only at the ingress edge node. A mixed timer/burst-length-based assembly algorithm is considered for burst assembly, and bursts with different service classes are assembled simultaneously according to the algorithm. A burst-cluster is generated so that the bursts in the cluster are arranged in order from lowest priority to highest. Then the burst-cluster is transmitted according to the burst transmission scheduling. We also consider the application of burst-cluster transmission to delay-sensitive traffic. We evaluate by simulation the performance of the burst-cluster transmission for NSFNET. Numerical examples show that burst-cluster transmission succeeds in providing different service grades even though the burst loss probabilities of high-priority service classes are affected by the traffic load of low-priority ones

Performance analysis of timer-based burst assembly with slotted scheduling for optical burst switching networks

In this paper, we analyze the performance of a timer-based burst assembly for optical burst switching (OBS) networks. In our analytical model, an ingress edge node has multiple buffers where IP packets are stored depending on their egress edge nodes, and bursts are assembled at the buffers in round-robin manner. Moreover, bursts are transmitted in accordance with slotted scheduling where each burst transmission starts at the slot boundary. We construct a loss model with two independent arrival streams, and explicitly derive the burst loss probability, burst throughput, and data throughput. In numerical examples, we show the effectiveness of our analysis in comparison with the Erlang loss system. It is shown that our model is quite useful for an OBS network with a large number of input and output links.

Burstification Queue Management in Optical Burst Switching Networks

Among the various issues lying in optical burst switching (OBS) networks, burstification, i.e., assembling multiple IP packets into bursts, is an important one. Between the two important aspects related to burst assembly, the burst assembly algorithm aspect has been extensively studied in the literature. However, as far as we know, there is no research about the burstification queue management (BQM) aspect, which refers to how many burstification queues (BQ) we should set at each OBS edge node and how to manage these BQs. Suppose there are G destinations (egress edge nodes) and the OBS network provides S different quality of service (QoS) classes. Traditionally, it is simply regarded that each ingress edge node needs G· S queues to sort incoming packets, one for each possible destination and QoS class. For simplicity, we call this policy the static dedicate BQM (SDB) policy. The SDB policy, though simple, lacks scalability since we have to add S BQs at each OBS edge node if an extra OBS edge node is added to the OBS network. To solve this problem, we propose in this paper two BQM policies: quasi-static BQM (QSB) policy and dynamic BQM (DB) policy. For the QSB policy, we derive the packet loss probability due to lacking BQs based on a Markov chain, from which we can work out the employed number of BQs for a given packet loss probability. Based on these results, the scalability of the QSB policy is also studied. With the DB policy, we not only can dynamically assign BQs for incoming packets, but also can dynamically allocate buffer capacity for each BQ by using a least-mean-square (LMS)-based linear prediction filter. The performance of the DB policy is investigated by analysis and extensive simulations. We also compared the performance of the QSB policy and the DB policy. Results from analysis and simulation demonstrate that the DB policy is the best.

Design of wavelength-convertible edge nodes in wavelength-routed networks

Wavelength converters reduce the connection blocking probability in wavelength-routed networks by eliminating the wavelength continuity constraint. We develop a method for deployment of wavelength converters in wavelength-routed networks with an overlay model. In these networks, most wavelength converters are deployed on edge nodes to cover the difference in the numbers of wavelengths multiplexed on access and core links. Therefore reduction of wavelength converter cost on edge nodes leads to minimizing the wavelength converter cost in the whole network. We propose an ingress edge node architecture with fixed wavelength converters that have limited wavelength convertibility but are more economical than full wavelength converters. In our architecture, each input access link of ingress edge nodes is equipped with fixed wavelength converters, and input wavelengths from the access links are evenly distributed on the output core link. As a result, competition for a free wavelength on an output core link is avoided. Simulation results show that our edge node architecture offers about 20% cost reduction compared with a node architecture that uses only full wavelength converters where networks are actually under operation and a full wavelength converter cost to fixed wavelength converter cost ratio is 3:1.

A Data Burst Assembly Algorithm in Optical Burst Switching Networks

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.

Dynamic burst transfer time-slot-base network

This article proposes a new high-speed network architecture called dynamic burst transfer time-slot-base network (DBTN). The DBTN network is based on circuit-switched network technology. A routing tag is attached to a burst at an ingress edge node and the burst is self-routed in a DBTN network, the circuit of which is created dynamically by the routing tag. The routing tag, which is called time-slots-relay, consists of link identifiers from the ingress to the egress nodes and is used to create the circuit. Subsequent data is switched over the circuit being created in an on-the-fly fashion. Each link identifier is loaded into the address control memory (ACM) of each circuit switching node, and thereby the circuit to the destination is created dynamically. Subsequent user data follows immediately after the time-slots-relay and is sent over the established circuit. Thus short-lived fairly large data transfers such as WWW traffic are efficiently carried. A circuit between adjacent nodes is created and released dynamically so bandwidth efficiency is improved compared with conventional circuit-switched networks. Time division multiplexing of the circuit-switched network is utilized so there is no delay jitter or loss within a burst. We address the performance of DBTN switches and report the experimental system.