Packet Delay Variation Research Articles

ANALYSIS OF DEVELOPMENT TRENDS IN MODERN BUSINESS COMMUNICATIONS

Advanced communication techniques are used to organize fixed-user access to corporate communication network (CCNs) resources, with the ability to quickly change the encoding speed during network overloads. Estimating the probability of a denial of service caused by a lack of free channel resources at Access Network was one of the research's aims. IP based network enable the delivery of different services. Primary determinants of users' subjective quality evaluation of communication: data transmission: fast, without errors or failures; video communication: high-quality images, no delays; audio communication: no voice distortion, no call failures. Important to network operators to make effective use of their own resources while maintaining transmission quality standards. Control over metrics such packet loss ratio, delay variations, and latency is crucial. For certain corporate networks, the implementation of 5G mobile communication equipment holds great potential, especially in terms of enabling remote access for staff members. Simultaneously, concerns over unauthorized access to information and the risk of packet loss during transmission have become increasingly pressing. This paper discusses the effectiveness of Low-Density Parity Check (LDPC) codes and polar codes in variable length packet transmission in a 5G system. The modeling results of 5G communication system operation at a fixed value of packet loss are discussed.

Benchmarking methodology for stateful NAT64 gateways

The benchmarking of Network Address and Protocol Translation from IPv6 clients to IPv4 servers (stateful NAT64) gateways is challenging from a methodological point of view because the state of the art benchmarking standards have some requirements that are conflicting when applied to stateful NAT64 gateways. In this paper, several methodological gaps are pointed out and a benchmarking methodology is proposed, which is applicable for any stateful NATxy gateways, where x and y are in {4, 6}. It bridges all the gaps by reconciling the conflicting requirements and facilitating the execution of the industry standard benchmarking measurement procedures (throughput, latency, frame loss rate, packet delay variation) with stateful NATxy gateways. New performance metrics specific to stateful testing are also defined: maximum connection establishment rate, connection tear down rate, and connection tracking table capacity. The proposed methodology is suitable for examining the scalability of the stateful NATxy gateways, too. The methodology is validated by applying it to the benchmarking of three radically different stateful NAT64 implementations: Jool, tayga plus iptables, and OpenBSD Packet Filter (PF). The details of the measurements and their results are fully disclosed.

Performance Investigation of IP Security Virtual Private Network in Ipv6 Environment using Quality of Service

Different types of data are transmitted through the internet, these data such as Email, HTTP, FTP and VoIP conversation might contain important and sensitive information which can be read or seen by other users. Many attacks such as man in the middle, packet sniffing and phishing are available and used by many attackers, as a way to access the protected information. Based on this fact, security and privacy become a necessity in the field of private network (intranet) and public network (extranet). IP sec VPN is considered to be the strongest technique for protecting packets from any kind of attack. In this paper, an analytical study is accomplished using opnet simulation software to design and analyze the proposed network. The proposed network represents four sites in different cities are communicating using the technique of IPsec VPN, different scenarios are created and studied to investigate the performance of network using IPsec VPN in IPV6 environment with QoS. The investigated metrics were packet end to end delay, jitter, packet delay variation, download and upload response time.

A Novel Switching Algorithm to the Preferred Clock Skew Estimator Applicable for the PTP Case in the Fractional Gaussian Noise Environment

Recently, the same authors provided a switching algorithm for the preferred clock skew estimator appropriate for the precision time protocol (PTP) scenario. The algorithm chooses the one‐way delay (OWD) clock skew estimator for the Forward path or the Reverse path or the two‐way delay (TWD) clock skew estimator that has the best performance in the mean square error (MSE) perspective. However, the switching algorithm applies only to the Gaussian scenario. In a real system, the packet delay variation (PDV) can be characterized as an fractional Gaussian noise (fGn) process where the Hurst exponent parameter can also have values higher than 0.5. Thus, the Gaussian case‐switching algorithm may not apply in a real system where after a small set of PTP measurements, the switching algorithm should be able to switch effectively to the preferred clock skew estimator with the best performance in the MSE perspective. In this paper, the PDV is characterized as an fGn process where the Hurst exponent (H) is in the range of 0.5 ≤ H < 1. We estimate the unknown PDV variances and the Hurst exponent parameters of the Forward and Reverse paths. These estimated parameters are used for switching to the preferred clock skew estimator from the MSE perspective, even in the presence of asymmetry in the PDV or in the Hurst exponent parameters. We also detect and alarm for the unexpected load, cyber‐attack, or clock skew deviation that can occur in a real system.

Study and Evaluation of Quality of Services in Mobile Internet Protocol v6 Using IEEE802.11e

Mobile Internet Protocol v6 (MIPv6) is a protocol that allows a mobile node (MN) to transparently maintain connections while moving from one subnet to another. Using the route optimization (RO) method in MIPv6 gives optimized routing and helps avoid triangular routing. In real-time applications such as video conference applications, quality of service (QoS) issues will increase especially in the handover process between subnets. This study investigates the performance of MIPv6 handover in IEEE802.11e standard in wireless environments. The investigation considers that handover for the MN moves between 2 home agents (HA). The system model’s fundamental performance limits are measured by packet delay variation, HA binding delay, and wireless local area network (WLAN) media access delay analysis metrics in video conference applications. According to the results of real-time simulations, network performance during the handover process can be effectively improved as the packet lost during handover decreased significantly from 43% in IEEE802.11b distributed coordination function (DCF) to 36% in IEEE802.11e hybrid coordination function (HCF). Furthermore, experimental results prove that IEEE802.11e connects to new HA roughly 20% quicker than IEEE802.11b, and IEEE802.11b has 100 times more time delay than IEEE802.11e. In addition to this, the WLAN media access delay of IEEE802.11b often reaches 0.00011 s as compared to 0.000005 s of IEEE802.11e. Thus, it is evident that the performance of IEEE802.11e in terms of packet delay variation, HA binding delay, and WLAN media access delay is better than IEEE802.11b. Likewise, it is noted that network speed during the handover process in IEEE802.11e can be considerably improved in a MIPv6 scenario.

Network Calculus Approach for Packet Delay Variation Analysis of Multi-Hop Wired Networks

The Industrial Internet of Things (IIoT) has revolutionized businesses by changing the way data are used to make products and services more efficient, reliable, and profitable. To achieve the improvement goals, the IIoT must guarantee the real-time performance of industrial applications such as motion control, by providing stringent quality of service (QoS) assurances for their (industrial applications) communication networks. An application or service may malfunction without adequate network QoS, resulting in potential product failures. Since an acceptable end-to-end delay and low jitter or packet delay variation (PDV) are closely related to quality of service (QoS), their impact is significant in ensuring the real-time performance of industrial applications. Although a communication network topology ensures certain jitter levels, its real-life performance is affected by dynamic traffic due to the changing number of devices, services, and applications present in the communication network. Hence, it is essential to study the jitter experienced by real-time traffic in the presence of background traffic and how it can be maintained within the limits to ensure a certain level of QoS. This paper presents a probabilistic network calculus approach that uses moment-generating functions to analyze the delay and PDV incurred by the traffic flows of interest in a wired packet switched multi-stage network. The presented work derives closed-form, end-to-end, probabilistic performance bounds for delay and PDV for several servers in series in the presence of background traffic. The PDV analysis conducted with the help of a Markovian traffic model for background traffic showed that the parameters from the background traffic significantly impact PDV and that PDV can be maintained under the limits by controlling the shape of the background traffic. For the studied configurations, the model parameters can change the PDV bound from 1 ms to 100 ms. The results indicated the possibility of using the model parameters as a shaper of the background traffic. Thus, the analysis can be beneficial in providing QoS assurances for real-time applications.

A machine learning-based optimization for end-to-end latency in TSN networks

Ultra-low latency (ULL) is a challenging but nonetheless essential network requirement to achieve in many contexts. Industrial automation (IEC/IEEE 60802), in-vehicle communications (IEEE P802.1DG), audio and video bridging (IEEE Std 802.1BA), aerospace, and 5G fronthaul (IEEE 802.1CM) applications demand a low network latency in the order of few milliseconds or even microseconds. ULL services target a more controlled latency for end-to-end device communication and, in critical environments, near real-time connections. Time-Sensitive Networks (TSN) aim at providing deterministic connectivity over IEEE 802 networks guaranteeing packet transport with bounded latency, low packet delay variation, and low packet loss. This work analyzes TSN latency mechanisms and examines how they influence E2E latency. Moreover, it builds a regression-based surrogate model that enables the creation of optimization models to find optimal configurations for a given TSN network. Our findings span the discussion of the characteristics of each individual TSN latency mechanism to the benefits achieved by the proposed optimization models and using these to achieve optimal E2E latency.

Characteristic analysis of queue theory in Wi-Fi applications using OPNET 14.5 modeler

Wireless Fidelity (Wi-Fi) broadband network technology has created great influence in the evolution of broadband wireless networks that are anticipated to progress regarding broadband speed and coverage. Several Wi-Fi hotspots are available everywhere, making it a medium of internet access that is easier to use compared to a local area network (LAN). However, the internet being the best effort network doesn’t provide the required Quality of Service (QoS) and there is no differentiation of service traffic. The chief aim of the current paper is to study the operation of the three organizing mechanisms: First-In, First-Out (FIFO) method – the standard method of network implementation to process the packets one by one as it arrives, Priority Queuing (PQ) and Weighted Fair Queuing (WFQ) whereas PQ and WFQ classify the types of traffic based on service priority. In addition, WFQ assigns fair weight to each service on multiple traffic classes like video conferencing, Voice over Internet Protocol (VoIP), and File Transfer Protocol (FTP), using Telkom ST3’s Wi-Fi network. This study applies four different scenarios: the first scenario applies the methods without any queuing discipline; the second scenario implements the methods with FIFO; the third scenario carries out the methods with PQ and the last scenario applies the methods with WFQ. The studies have shown that “end-to-end packet delay and packet delay variation for VoIP in the WFQ scenario” is good when compared to other queuing mechanisms with values of 171.717 ms and 0.977 ms, respectively. In the case of videotape conferencing also, the performance is better in the case of WFQ with values of 32.495 ms and 7.207 ms, correspondingly, since the WFQ has a “bandwidth allocation” tailored to the requirements

Two Novel One-Way Delay Clock Skew Estimators and Their Performances for the Fractional Gaussian Noise/Generalized Fractional Gaussian Noise Environment Applicable for the IEEE 1588v2 (PTP) Case

Papers in the literature dealing with the Ethernet network characterize packet delay variation (PDV) as a long-range dependence (LRD) process. The fractional Gaussian noise (fGn) or the generalized fractional Gaussian noise (gfGn) belong to the LRD process. The IEEE1588v2 is a two-way delay (TWD) protocol that uses the messages from the Forward (Master to Slave) and the Reverse (Slave to Master) paths. Suppose we have a significant difference between the PDV variances of the Forward and the Reverse paths. Thus, if we can use only the path with the lowest PDV variance (namely, only the one-way delay (OWD) technique), we might get a better clock skew performance from the mean square error (MSE) point of view compared with the traditional TWD method. This paper proposes two OWD clock skew estimators, one for the Forward path and one for the Reverse path applicable for the white-Gaussian, fGn and gfGn environment. Those OWD estimators do not depend on the unknown asymmetry between the fixed delays in the Forward and Reverse paths and nor on the clock offset between the Master and Slave. We also supply two closed-form approximated expressions for the MSE related to our new proposed OWD clock skew estimators. In addition, we supply some conditions, summarized in a table, guiding us whether we should use the OWD clock skew estimator for the Forward path or for the Reverse path, or just use the TWD algorithm. Simulation results confirm that our new proposed OWD clock skew estimators achieve better clock skew performances from the MSE point of view, compared with the TWD clock skew estimator recently proposed by the same authors and compared with two literature known OWD methods (the maximum likelihood and Kalman clock skew estimators).

Performance Evaluation of Routing Protocols in Enterprise Networks

This paper evaluates the performance of routing protocols such as OSPF, EIGRP and IS-IS in an enterprise network. Routing protocols are rules that govern the best route to transfer data between various nodes in networks. These rules are used in the transmission of information from the transmitting end to the receiving end. Routing protocol's main responsibility lies in determining the best way routers communicate with each other in order to forward any kind of network traffic using the optimal path. The evaluation of routing protocols was achieved by measuring packet end-to-end delay, packet delay variation, Jitter, Ethernet delay, traffic sent and received parameters by employing OPNET simulator software using Http, Video conferencing and Voice data types. The results shows that OSPF_IS-IS combined protocols outperforms the of OSPF_EIGRP and OSPF protocols by 60%.

QUEUEING SYSTEMS WITH TIME LAG

Context. In the queuing theory of a research of the G/G/1 systems are relevant because it is impossible to receive decisions for the average waiting time in queue in a final form in case of arbitrary laws of distributions of an input flow and service time. Therefore, the study of such systems for particular cases of input distributions is important. The problem of deriving solutions for the average waiting time in a queue in closed form for systems with distributions shifted to the right from the zero point is considered.
 Objective. Getting solutions for the main characteristics of the systems – the average waiting time of requirements in the queue for queuing systems (QS) of type G/G/1 with shifted input distributions.
 Methods. To solve this problem, we used the classical method of spectral decomposition of the solution of the Lindley integral equation. This method allows to obtaining a solution for the average waiting time for the systems under consideration in a closed form. The method of spectral decomposition of the solution of the Lindley integral equation plays an important role in the theory of systems G/G/1. For the practical application of the results obtained, the well-known method of moments of probability theory is used.
 Results. For the first time, spectral expansions are obtained for the solution of the Lindley integral equation for systems with delay, which are used to derive formulas for the average waiting time in a queue in closed form. The paper presents the final studies for the remaining eight delay systems.
 Conclusions. It is shown that in systems with delay, the average waiting time is less than in in the usual systems. The obtained formula for the average waiting time expands and complements the well-known queuing theory incomplete formula for the average waiting time for G/G/1 systems. This approach allows us to calculate the average latency for these systems in mathematical packages for a wide range of traffic parameters. In addition to the average waiting time, such an approach makes it possible to determine also moments of higher orders of waiting time. Given the fact that the packet delay variation (jitter) in telecommunications is defined as the spread of the waiting time from its average value, the jitter can be determined through the variance of the waiting time.

Performance Evaluation of VoIP Codecs over Network Coding in Wireless Mesh Networks

Voice over Internet protocol (VoIP) is used for transmitting voice signals in a packet-switched Internet protocol (IP) networks in real time. For transmitting voice over a wireless mesh networks (WMNs), the analog voice signal has to be digitalized, encoded, and packetized. Codecs based on different Quality of Service (QoS) requirements are used. One of the main QoS requirements is that packets are transmitted through the network in real time; one-way transmission time or End-to-End (ETE) packet delay, and packet delay variation or jitter have to be lower than thresholds. ETE delay depends on various parameters; among them is also network delay. Various mechanisms are used to lower the network delay in WMNs. A promising mechanism, for improving the performance of streaming services such as the case also in VoIP, is network coding. In this paper, we evaluate the benefits of using wireless network coding for VoIP in WMNs. Network coding procedure in combination with various VoIP codecs is used to observe the impact on network delay and jitter of the VoIP application. The simulation results show that network coding can decrease network delay and jitter. Moreover, results show that network coding benefits are codec dependent.

A Novel Clock Skew Estimator and Its Performance for the IEEE 1588v2 (PTP) Case in Fractional Gaussian Noise/Generalized Fractional Gaussian Noise Environment

Papers in the literature dealing with the Ethernet network characterize packet delay variation (PDV) as a long-range dependence (LRD) process. Fractional Gaussian noise (fGn) or generalized fraction Gaussian noise (gfGn) belong to the LRD process. This paper proposes a novel clock skew estimator for the IEEE1588v2 applicable for the white-Gaussian, fGn, or gfGn environment. The clock skew estimator does not depend on the unknown asymmetry between the fixed delays in the forward and reverse paths nor on the clock offset between the Master and Slave. In addition, we supply a closed-form-approximated expression for the mean square error (MSE) related to our new proposed clock skew estimator. This expression is a function of the Hurst exponent H, as a function of the parameter a for the gfGn case, as a function of the total sent Sync messages, as a function of the Sync period, and as a function of the PDV variances of the forward and reverse paths. Simulation results confirm that our closed-form-approximated expression for the MSE indeed supplies the performance of our new proposed clock skew estimator efficiently for various values of the Hurst exponent, for the parameter a in gfGn case, for different Sync periods, for various values for the number of Sync periods and for various values for the PDV variances of the forward and reverse paths. Simulation results also show the advantage in the performance of our new proposed clock skew estimator compared to the literature known ML-like estimator (MLLE) that maximizes the likelihood function obtained based on a reduced subset of observations (the first and last timing stamps). This paper also presents designing graphs for the system designer that show the number of the Sync periods needed to get the required clock skew performance (MSE = 10–12). Thus, the system designer can approximately know in advance the total delay or the time the system has to wait until getting the required system’s performance from the MSE point of view.

CoSiWiNeT: A Clock Synchronization Algorithm for Wide Area IIoT Network

Recent advances in the industrial internet of things (IIoT) and cyber–physical systems drive Industry 4.0 and have led to remote monitoring and control applications that require factories to be connected to remote sites over wide area networks (WAN). The adequate performance of remote applications depends on the use of a clock synchronization scheme. Packet delay variations adversely impact the clock synchronization performance. This impact is significant in WAN as it comprises wired and wireless segments belonging to public and private networks, and such heterogeneity results in inconsistent delays. Highly accurate, hardware–based time synchronization solutions, global positioning system (GPS), and precision time protocol (PTP) are not preferred in WAN due to cost, environmental effects, hardware failure modes, and reliability issues. As a software–based network time protocol (NTP) overcomes these challenges but lacks accuracy, the authors propose a software–based clock synchronization method, called CoSiWiNeT, based on the random sample consensus (RANSAC) algorithm that uses an iterative technique to estimate a correct offset from observed noisy data. To evaluate the algorithm’s performance, measurements captured in a WAN deployed within two cities were used in the simulation. The results show that the performance of the new algorithm matches well with NTP and state–of–the–art methods in good network conditions; however, it outperforms them in degrading network scenarios.

The Impact of Length of Frame on The Performance of Video Application in WiMAX System

The IEEE 802.16e standard includes several features that aid data capacity. When dealing with real-time applications such as video conference services, however, it quickly depletes its resources. The quality of the video, on the other hand, is a crucial factor for the user. There is a tradeoff between the video quality and the resources available. In this paper the influence of frame length on video applications was investigated by examining the effect of four frame lengths (5, 10, 15, and 20 mSec) on the Packet Delay Variation, End-to-end packet delay, traffic sent and received with modulation type 64QAM and high quality of video conference application are used. The optimal frame length was found to be 10 milliseconds, with the Packet Delay Variation being the smallest, the Packet End-to-End Delay being the shortest, and the number of received packets being equal to the number of sent packets.

A less‐conservative stability criterion for networked control systems with time‐varying packet delays

A networked output feedback loop subject to packetized transmissions of the output signal is considered. Based on the small gain theorem, an easy-to-use stability criterion covering two important cases is presented. In the first case a packet numbering mechanism is employed whereas in the second case neither packet numbering nor synchronization between sender and receiver is assumed. The analysis makes use of acausal subsystems and deduces the optimal constant time delay with respect to the minimization of the ℓ2 gain due to uncertain packet delays. This additional delay is then used in a nominal controller design such that additional admissible packet delay variations introduced by the network are maximized. A simulation example of a networked control system with a filtered Smith predictor illustrates the application of the proposed criterion. It is shown that the proposed novel technique is less-conservative than existing stability criteria based on the small gain theorem.

DELAY MODELS BASED ON SYSTEMS WITH USUAL AND SHIFTED HYPEREXPONENTIAL AND HYPERERLANGIAN INPUT DISTRIBUTIONS

Context. In the queueing theory, the study of systems with arbitrary laws of the input flow distribution and service time is relevant because it is impossible to obtain solutions for the waiting time in the final form for the general case. Therefore, the study of such systems for particular cases of input distributions is important.
 Objective. Getting a solution for the average delay in the queue in a closed form for queuing systems with ordinary and with shifted to the right from the zero point hyperexponential and hypererlangian distributions in stationary mode.
 Method. To solve this problem, we used the classical method of spectral decomposition of the solution of the Lindley integral equation. This method allows to obtaining a solution for the average delay for two systems under consideration in a closed form. The method of spectral decomposition of the solution of the Lindley integral equation plays an important role in the theory of systems G/G/1. For the practical application of the results obtained, the well-known method of moments of probability theory is used.
 Results. For the first time, a spectral decomposition of the solution of the Lindley integral equation for systems with ordinary and with shifted hyperexponential and hyperelangian distributions is obtained, which is used to derive a formula for the average delay in a queue in closed form.
 Conclusions. It is proved that the spectral expansions of the solution of the Lindley integral equation for the systems under consideration coincide; therefore, the formulas for the mean delay will also coincide. It is shown that in systems with a delay, the average delay is less than in conventional systems. The obtained expression for the waiting time expands and complements the wellknown incomplete formula of queuing theory for the average delay for systems with arbitrary laws of the input flow distribution and service time. This approach allows us to calculate the average delay for these systems in mathematical packages for a wide range of traffic parameters. In addition to the average waiting time, such an approach makes it possible to determine also moments of higher orders of waiting time. Given the fact that the packet delay variation (jitter) in telecommunications is defined as the spread of the waiting time from its average value, the jitter can be determined through the variance of the waiting time.

MATHEMATICAL DELAY MODEL BASED ON SYSTEMS WITH HYPERERLANGIAN AND ERLANGIAN DISTRIBUTIONS

Context. Studies of G/G/1 systems in queuing theory are relevant because such systems are of interest for analyzing the delay of data transmission systems. At the same time, it is impossible to obtain solutions for the delay in the final form in the general case for arbitrary laws of distribution of the input flow and service time. Therefore, it is important to study such systems for particular cases of input distributions. We consider the problem of deriving a solution for the average queue delay in a closed form for two systems with ordinary and shifted hypererlangian and erlangian input distributions.
 Objective. Obtaining a solution for the main characteristic of the system – the average delay of requests in the queue for two queuing systems of the G/G/1 type with ordinary and with shifted hypererlangian and erlangian input distributions.
 Method. To solve this problem, we used the classical method of spectral decomposition of the solution of the Lindley integral equation. This method allows to obtaining a solution for the average delay for systems under consideration in a closed form. The method of spectral decomposition of the solution of the Lindley integral equation plays an important role in the theory of systems G/G/1. For the practical application of the results obtained, the well-known method of moments of probability theory is used.
 Results. For the first time, spectral expansions of the solution of the integral Lindley equation for two systems are obtained, with the help of which calculation formulas for the average delay in a queue in a closed form are derived. Thus, mathematical models of queuing delay for these systems have been built.
 Conclusions. These formulas expand and supplement the known queuing theory formulas for the average delay G/G/1 systems with arbitrary laws distributions of input flow and service time. This approach allows us to calculate the average delay for these systems in mathematical packages for a wide range of traffic parameters. In addition to the average delay, such an approach makes it possible to determine also moments of higher orders of waiting time. Given the fact that the packet delay variation (jitter) in telecommunications is defined as the spread of the delay from its average value, the jitter can be determined through the variance of the delay.

QoS assurance for PON-based fronthaul and backhaul systems of 5G cloud radio access networks

The newly proposed fronthaul and backhaul (FB) segments in the cloud-radio access networks (C-RANs) could be leveraging solutions to satisfy the 5G demands, but the rigorous one-way delay and packet delay variations (PDVs) requirements of fronthaul networks are the bottleneck. Time division multiplexing (TDM)-based passive optical networks (PONs) can be a promising candidate to carry the fronthaul traffic, but the TDM-PON systems have limitations to meet the fronthaul QoS requirements due to unavoidable delays at the switching nodes. Moreover, the unification of FB traffics over the same segment is vital to fully exploit the cost benefits, but due to the poor performance of the PON systems for the fronthaul traffic, the backhaul traffic could not be forwarded through the same fronthaul segments. Therefore, in this paper, we propose and implemented the strict priority and frame pre-emption-based buffering schemes to transport the FB packet flows simultaneously at tolerable delays and PDVs.

QoS assurance for PON-based fronthaul and backhaul systems of 5G cloud radio access networks

The newly proposed fronthaul and backhaul (FB) segments in the cloud-radio access networks (C-RANs) could be leveraging solutions to satisfy the 5G demands, but the rigorous one-way delay and packet delay variations (PDVs) requirements of fronthaul networks are the bottleneck. Time division multiplexing (TDM)-based passive optical networks (PONs) can be a promising candidate to carry the fronthaul traffic, but the TDM-PON systems have limitations to meet the fronthaul QoS requirements due to unavoidable delays at the switching nodes. Moreover, the unification of FB traffics over the same segment is vital to fully exploit the cost benefits, but due to the poor performance of the PON systems for the fronthaul traffic, the backhaul traffic could not be forwarded through the same fronthaul segments. Therefore, in this paper, we propose and implemented the strict priority and frame pre-emption-based buffering schemes to transport the FB packet flows simultaneously at tolerable delays and PDVs.