Packet Loss Probability Research Articles

Cross-Layer Performance Analysis of Downlink Multi-Flow Carrier Aggregation in Heterogeneous Networks

Multi-flow carrier aggregation (CA) is an emerging technique that is implemented to improve the capacity of cellular networks. In this paper, we study the cross-layer performance of user equipments (UEs) in heterogeneous networks under multi-flow CA. We develop a queuing analytical model for measuring packet-level performance parameters, e.g., packet loss probability and queuing delay. Our developed model accounts for the time-varying channels, the channel scheduling algorithm, partial channel quality information feedback, and the number of component carriers deployed at each tier. Our model also takes into consideration stochastic packet arrivals, the packet scheduling algorithm, and out-of-sequence packet delivery. The developed model can be used to tune the various system and operating parameters in order to offload traffic from the macrocells to the small cells while maintaining the quality of service requirements of UEs. The accuracy of the analytical model developed in this paper is validated through computer simulations.

Queueing analysis of ultra-wideband medium access control protocol with finite buffer

Ultra-wideband (UWB) communication has recently emerged as a technology that offers high data rate services for future wireless personal area networks. Due to its high bandwidth, it is substantial effort to design medium access control (MAC) protocols that perfectly utilise the available shared bandwidth offered by UWB technology. This paper introduces an extensive 4-dimensional finite Markov chain queueing model to investigate the performance of a multi-band protocol that was proposed in literature in terms of system occupancy, waiting time, throughput, packet loss and blocking probabilities. Our motivation is to precisely estimate packets collision probability due to randomly selection of receivers or bands. Besides introducing the finite buffer, our queuing model reflects the system behaviour in-depth. Next, we validate the obtained analytic results using discrete-event simulation. Finally, we introduce an outline of a proposal to eliminate the randomness of selecting receivers and bands.

Packet Level Performance Assessment of mmWave Backhauling Technology for 3GPP NR Systems

Recently standardized millimeter-wave (mmWave) band 3GPP New Radio systems are expected to bring extraordinary rates to the air interface efficiently providing commercial-grade enhanced mobile broadband services in hotspot areas. One of the challenges of such systems is efficient offloading of the data from access points (AP) to the network infrastructure. This task is of special importance for APs installed in remote areas with no transport network available. In this paper, we assess the packet level performance of mmWave technology for cost-efficient backhauling of remote 3GPP NR APs connectivity “islands”. Using a queuing system with arrival processes of the same priority competing for transmission resources, we assess the aggregated and per-AP packet loss probability as a function environmental conditions, mmWave system specifics, and generated traffic volume. We show that the autocorrelation in aggregated traffic provides a significant impact on service characteristics of mmWave backhaul and needs to be compensated by increasing either emitted power or the number of antenna array elements. The effect of autocorrelation in the per-AP traffic and background traffic from other APs also negatively affects the per-AP packet loss probability. However, the effect is of different magnitude and heavily depends on the load fraction of per-AP traffic in the aggregated traffic stream. The developed model can be used to parameterize mmWave backhaul links as a function of the propagation environment, system design, and traffic conditions.

SOS: Standard-Compliant and Packet Loss Tolerant Security Framework for ADS-B Communications

The Automatic Dependent Surveillance - Broadcast (ADS-B) technology, already deployed by the major avionics companies (e.g., QatarAirways and AmericanAirlines), will become mandatory on board of civil and military aircraft flying in Class A, B, and C airspaces by 2020, enabling direct airplanes communications and enhanced flights monitoring. However, ADS-B has been designed without security considerations, thus being vulnerable to a variety of attacks, including message injection and messages order manipulation attacks, that can be easily performed via widely available commercial Software Defined Radios. To address these threats, we present Securing Open Skies (SOS), a standard-compliant, backward-compatible, loss-tolerant, and bandwidth efficient security framework to secure ADS-B communications. SOS leverages the real deployment of densely distributed, participatory ADS-B sensor networks such as OpenSky Network and Flight Radar, and provides message authentication and integrity security services on a time-slot basis, without resorting to any public key cryptography mechanism. Experimental performances obtained through a realistic proof-of-concept, deployed using commercial Ettus Research X310 Software Defined Radios, demonstrate the viability and effectiveness of our solution, even in presence of uniformly at random or burst packet loss events characterizing the ADS-B frequency band. For instance, SOS allows the verification of the authenticity of ADS-B messages requiring less than 50 percent of bandwidth overhead, with a percentage of verifiable slots above 80 percent, even in an highly lossy environment, characterized by a single packet loss probability of 60 percent—the process requiring less than one second: almost one tenth of similar approaches published in the literature. Finally, a thorough comparison against state of the art solutions in the literature highlights the unique security and reliability features enjoyed by SOS, as well as its practical viability.

Topology-Aware Network Coding for Wireless Multicast

In this paper, we present a topology-aware network coding (TANC) technique for wireless multicast systems aiming at reducing packet retransmissions in a lossy propagation environment. In addition to radio channel impacts, packet loss may result from traffic congestion, thereby yielding different retransmission requests. In such a wireless network coding multicast environment, what is the best packet combination to minimize the packet retransmissions for a number of users? We make progress on this problem by taking advantage of the network topology information to select the appropriate lost encoded packets in the encoding phase. We leverage the capability of software-defined networking controller to construct the global network topology in the proposed TANC scheme. Experimental results show that the proposed TANC scheme can reduce 52.4% of packet retransmissions compared to the existing random linear network coding in different environments, including various numbers of uncoded packets, network nodes, and packet loss probabilities.

Analysis of Two-Unicast Network-Coded Hybrid-ARQ With Unreliable Feedback

Network-coded (NC) automatic repeat request (ARQ) systems have been shown to provide significant throughput improvements over basic ARQ systems in multiuser wireless systems. These systems have been extended to NC hybrid-ARQ (HARQ) to show further enhancements in throughput by allowing receivers to use previous retransmissions. However, prior results were derived under the assumption of perfect ARQ feedback channels. In practical systems, feedback channels are not perfect, and therefore it is crucial to study the effect of noise in the ARQ feedback channels. In this paper, we consider the case of two-unicast flows and extend NC-HARQ to the case of imperfect ARQ feedback. Assuming binary symmetric feedback channels, we analyze the performance of these systems in terms of throughput, probability of packet loss, and average number of retransmissions. In the presence of feedback noise, our results show that significant throughput improvements over basic HARQ can still be obtained for a moderate-to-high signal-to-noise ratio with negligible increase in the probability of packet loss. We also present a new scheme that limits the number of NC packets to only one per data packet and show that for the two-unicast case the new scheme attains most of the throughput improvements of the original NC-HARQ scheme.

State Estimation for General Complex Dynamical Networks With Packet Loss

The state estimation problem is investigated in this brief for discrete-time general complex dynamical networks with packet loss happening in the transmission channel between original and observer networks. A set of random variables satisfying the Bernoulli distribution is used to describe the phenomenon of the packet loss. In order to eliminate the influence of packet loss, we substitute the observer outputs for the missing original network outputs when the packet loss happens. By applying the Lyapunov stability theory and the stochastic analysis method, a sufficient condition for state estimation is derived in terms of linear matrix inequalities. Based on the bisection method, we propose an algorithm to obtain the maximally allowable packet loss probability for state estimation. If the real packet loss probability is smaller than the maximally allowable value, the state estimation problem is feasible. Finally, it is demonstrated by simulation that the proposed scheme is feasible and effective.

Arrayed Waveguide Grating and Re-Circulating Buffer Based Optical Packet Switch

Abstract Optical packet switching has gained popularity in past decade. However, due to technical challenges all- optical switching is not implemented till date, still hybrid switching where both optical and electrical switching are used simultaneously by-passing the limitations of both the technologies. In fiber delay lines (FDLs) buffering is limited due to accumulated losses and noises, and most of the times short term storage is enough in optical switching, but in case of long term storage, re-circulating type buffer can be used, but again due to accumulation of degrading terms re-circulation count is limited therefore in case of longer duration storage, electronic buffer is better choice. In this paper, we have proposed a hybrid buffer based optical switch where both optical and electronic buffers are used for storage of contending packets, and optical buffer is re-circulating in nature. The performance of the switch is measured in terms of bit error rate (BER) and packet loss probability, and BER performance is compared with recently proposed design, and it has been found that the proposed switch is comparatively much superior to earlier one.

A new analytical model of TCP Hybla for satellite IP networks

TCP Hybla is increasingly being recognized for yielding high throughput over satellite IP links. However, due to the difficulty in measuring the expected performance over such links, the deployment decision is not trivial. A good analytical model of TCP Hybla can help spread its deployment by allowing easy estimation of its performance using network parameters like packet loss probability and round trip time (RTT) over the target satellite connection. Also, it can lead to design of congestion control mechanisms based on Hybla friendly rate control. In this paper, we therefore propose new analytical models for (i) steady-state throughput and (ii) latency for TCP Hybla over satellite IP links. The new model for steady-state throughput results from a major overhaul of our previously devised model for the same. The latency model has been devised newly. Using the latency model, the throughput and the average transmission time can be estimated. We verify the accuracy of our model by comparing with simulation and emulation results. It is observed that for packet loss probability of 10−4 or below that correspond to real life packet loss probability over satellite link, our analytical models for throughput and latency closely match both the simulation and emulation outcomes. That is, our analytical models correctly represent the behavior of satellite links. Our new model leads to up to 3% more accuracy than our previously proposed model while calculating steady-state throughput.

Development of the tensor model of multipath qоe-routing in an infocommunication network with providing the required quality rating

This work has solved a relevant task to ensure the required level of quality of experience in an infocommunication network, which implied the development of a mathematical model of the multipath QoE-routing while maintaining the required quality rating. In this case, quality rating calculation requires the introduction to the mathematical model of routing of additional conditions for obtaining the indicators of an end-to-end delay and a packet loss probability. To this end, it is advisable to use the tensor formalization of these conditions when implementing a multipath routing strategy. Such a technique for expanding the mathematical models (introduction of additional analytical conditions) is more flexible and would full account for the complexity of relationship between network parameters within QoE. Given this, the quality of experience of speech transmission is not defined by the absolute values of delays and loss probabilities, but rather by their relationship. The result of studying the proposed model is the calculated quantitative indicator for a quality rating, which, compared to recommended indicators according to existing recommendations, makes it possible to evaluate the execution of the predefined level of QoE. In other words, given the preset intensity of traffic in a network, we calculated indicators for the average end-to-end delay and a packet loss probability, which make it possible to assess the quality of experience in terms of a quality rating and indicate the efficiency of the proposed solution. And, on the contrary, owing to the developed model of QoE-routing, it has become possible to control the probability of losses and the average end-to-end packet delay in an infocommunication network in order to ensure meeting the specified QoE-requirements. In addition, a comparative analysis was performed of a flow model of multipath routing based on using the IGRP metric, which made it possible to assess the effectiveness of the proposed solution and demonstrated better performance in terms of a quality rating by 12 to 25 % depending on the source data.

Dynamic heuristic for the recomposition of service function chain

Network function virtualisation and software-defined networking are two emerging technologies which together enable a new service provisioning paradigm called service function chain (SFC). However, the SFC should be scalable enough to accommodate one or more service functions joining or leaving it during its lifecycle. In this work, the authors first formulate this problem as an integer linear programming (ILP) model, and then address this ILP model to obtain the optimal solution. Due to the extremely high execution time for solving the ILP model, they next proposed a dynamic heuristic to solve this problem. In particular, the proposed heuristic leverages two kinds of strategies to handle the scale-in (i.e. removing existing service functions from SFCs) and scale-out (i.e. adding new service functions to SFCs) requests. Since each SFC has a corresponding service function path (SFP) constructed, the first kind of strategy proposes to serve the arriving scale-in and scale-out requests based on the in-use SFP, while the second kind of strategy intends to optimise the in-use SFP to achieve low cost and packet loss probability proactively. Finally, the experimental results indicate that the proposed heuristic can achieve better performance than the existing algorithm.

A load-balanced congestion-aware routing algorithm based on time interval in wireless network-on-chip

Network-on-chip (NoC) has been introduced to increase the performance of chip multiprocessors (CMPs) and execute parallel programs. Although NoC is known as a modular and scalable infrastructure for interconnections, there are still some challenges with conventional NoC such as high latency and power consumption due to the communication among long-distance (LD) cores. In this regard, wireless network-on-chip (WiNoC) is a potential solution that can provide high bandwidth and low latency by means of the unique features of wireless interconnects. However, wireless routers (WRs) are prone to congestion in WiNoC due to the limited number of wireless channels on a chip and shared use of these channels by all processing elements (PEs). In this study, a load-balanced time-based congestion-aware (LTCA) routing algorithm is proposed to eliminate the congestion of WRs and distribute the traffic load on the wired and wireless networks in a balanced way. LTCA is a deadlock-free routing algorithm in which only a limited number of packets are allowed to use wireless channels. The required time for transmitting the selected packets through wireless links is measured with regard to the bandwidth of the wireless channels and traffic load. Simulation results on synthetic traffic patterns and real-world 3-tuple traffic patterns indicated a considerable improvement in latency, throughput, wired and wireless link utilization and packet loss probability.

H∞ state estimation via asynchronous filtering for descriptor Markov jump systems with packet losses

Abstract This paper is concerned with the problem of asynchronous state estimation for a class of discrete-time descriptor Markov jump systems with packet losses. Packet losses and asynchronous modes are simultaneously considered in the communication link between the plant and the estimator, where the missing probability of packet losses is governed by a binary distribution. Firstly, by constructing a stochastic Lyapunov functional, a sufficient condition is given such that the filtering error system is stochastically admissible and has a prescribed H∞ noise attenuation performance index. Then, based on the matrix inequality decoupling technique, a linear matrix inequality (LMI)-based condition on the existence of the H∞ asynchronous filter is presented, where the asynchronous filter can be of full-order or reduced-order. Compared with the previous methods, the proposed design method does not impose constraints on slack variables and dimensions of the designed filter, which shows less conservative results. Finally, numerical examples are given to illustrate the benefit and applicability of the new method.

Modeling Energy Saving Mechanism for Green Routers

The rapidly growing energy consumption of the Internet core network has been a growing concern. In this respect, we have proposed a distributed and load adaptive energy saving router (ESR) mechanism to manage the energy consumption of green routers in our previous work. In this paper, we propose an analytical model to investigate the performance of ESR. The proposed model captures the distribution of the packet service time, the buffer size, and the packet loss probability. Under the low (resp. high) traffic load situation, our numerical results show that the ESR has the ability to save more than 40% (resp. 9%) energy. In addition to evaluating the ESR performance in terms of the energy saving ratio, rerouting probability and average delay, the models provide manufactures and operators with guidelines for the deployment of green Internet.

Designing Wireless Transmission Systems for the Dynamic Information Communication of Marine Vessels

Tao, L. and Sun, Z., 2018. Designing wireless transmission systems for the dynamic information communication of marine vessels. In: Ashraf, M.A. and Chowdhury, A.J.K. (eds.), Coastal Ecosystem Responses to Human and Climatic Changes throughout Asia.To solve the present problem of high transmission costs in the wireless information transmission system of dynamic communication of marine vessels, a new design method is presented based on a single-chip microcomputer. The data acquisition and wireless transmission system is designed based on the STC89C52 single-chip microcomputers and wireless transmission module. The system comprises a single-chip microcomputer, three-terminal voltage stabilizing power supply, collecting circuits, display circuits, storage circuits, and serial port output circuits. The system programming adopts the modular design method, and the software design mainly includes the software design of wireless transmission data acquisition and the receiving software design of the wireless information transmission system of dynamic communication of marine vessels. The experiment results show that the proposed method is simple and decreases the transmission cost, the transmission error probability, and the network packet loss probability.

Modelling Software-Defined Networking: Software and hardware switches

In Software-Defined Networking (SDN), a switch is a forwarding device that moves data packets in a network. A software switch handles forwarding functions in software and thus cannot forward packet at line speed while a hardware switch leverages optimised forwarding hardware to forward packets at line speed. However, there has been very little research in the literature to help network engineers understand the tradeoffs in choosing one over the other. In this paper, we develop a unified queueing model for characterizing the performance of hardware switches and software switches in SDN. The unified queueing model is an analytical tool for engineers to predict delay, packet loss and throughput in their SDN deployments. Existing queueing models of SDN have focused on performance analysis of software switches, while our work presented herein is the first to present a unified analysis of hardware and software switches. Our proposed models exhibit errors below 5% compared to simulation. Between a hardware and software switch, the evaluation shows that a hardware switch achieves an average 80% lower delay and up to 100% lower packet loss probability compared to a software switch. The more a hardware switch involves the controller for decisioning, the lower the gains in terms of packet delays through the switch.

The Relation between the Probability of Collision-Free Broadcast Transmission in a Wireless Network and the Stirling Number of the Second Kind

The broadcast performance of the 802.11 wireless protocol depends on several factors. One of the important factor is the number of nodes simultaneously contending for the shared channel. The Medium Access Control (MAC) technique of 802.11 is called the Distributed Coordination Function (DCF). DCF is a Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) scheme with binary slotted exponential backoff. A collision is the result of two or more stations transmitting simultaneously. Given the simplicity of the DCF scheme, it was adapted for Dedicated Short Range Communication (DSRC) based vehicular communication. A broadcast mechanism is used to disseminate emergency and safety related messages in a vehicular network. Emergency and safety related messages have a strict end-to-end latency of 100 ms and a Packet Delivery Ratio (PDR) of 90% and above. The PDR can be evaluated through the packet loss probability. The packet loss probability PL is given by, PL = 1 − (1−Pe)(1−PC), where Pe is the probability of channel error and PC is the probability of collision. Pe depends on several environmental and operating factors and thus cannot be improved. The only way to reduce PL is by reducing PC. Currently, expensive radio hardware are used to measure PL. Several adaptive algorithms are available to reduce PC. In this paper, we establish a closed relation between PC and the Stirling number of the second kind. Simulation results are presented and compared with the analytical model for accuracy. Our simulation results show an accuracy of 99.9% compared with the analytical model. Even on a smaller sample size, our simulation results show an accuracy of 95% and above. Based on our analytical model, vehicles can precisely estimate these real-time requirements with the least expensive hardware available. Also, once the distribution of PC and PL are known, one can precisely determine the distribution of Pe.

Prediction of Period-1 oscillations of the state-dependent delayed compound TCP model with PIE queue management policy via HDHBM

State-dependent time-delayed systems are more realistic delayed systems in nature and human society. Their dynamic problems are hot issues and difficult questions due to the fact that the classical RFDE theory is not suitable for them any more. And its corresponding rigorous theory is to be established. The study on the existence and stability of their periodic solutions is an important topic and a difficult question. Compound TCP is a widely used transport control protocol, and proportional integral enhanced (PIE) queue policy is an effective and simple queue policy in the Internet. Thus it is significant to study the dynamics and control of the compound TCP-PIE system. In this paper, Period-1 oscillations of the state-dependent delayed TCP models with PIE queue management policy are predicted by the high-dimensional harmonic balance method (HDHBM). Compared with the traditional harmonic balance method, HDHBM avoids the complex integration of the Fourier coefficients of the nonlinear right hand of the systems by solving the time domain variables of the Fourier coefficients at equally spaced sub-time over the period of one cycle of motion. Thus it transforms the problem into a relatively simple nonlinear algebraic equations, which greatly reduces the computation. By HDHBM, the approximate expressions of the Period-1 solutions for this state-dependent delayed compound TCP-PIE system are obtained. We compare their amplitudes and phase portraits with those of the DDE-BIFTOOL. They agree well with each other. It suggests the validity, effectiveness and simplicity of the employed method. It also turns out that many parameters of the state-dependent delayed TCP model with PIE queue management policy play a very important role in its dynamic behaviours. It follows that PIE parameter μ and update time T may play the most important roles in the Compound TCP-PIE congestion control model and packet loss probability p(t˜) may dominate the dynamics and performances of the network. As a result, we should control the parameters in a proper range to achieve our desired network performances.

Recirculating Buffer and Arrayed Waveguide Grating-Based Switch for Optical Data Centers

Abstract Recently, an explosive growth has been observed in data traffic, which restricts the speed of exiting data communication network. To solve such problem, fiber optical-based optical communication is preferred choice. In this paper, a switch design is proposed to tackle contention problem in Optical Packet Switching (OPS) and data center networks. The proposed switch is compared with recently proposed switch design and advantages of proposed design are presented. To show superiority of the proposed design over earlier one, mathematical modeling is presented and expressions for noise figures and Bit Error Rate (BER) are derived. Using the mathematical framework, switch analysis is done in terms of BER and packet loss probability, and it has been found that power required for correct operation of the switch is lesser in comparison to earlier one. The effect of recirculation count on packet loss probability is detailed. The network layer analysis in terms of packet loss probability is also done using Monte Carlo simulation, and relation between physical and network layer parameters is also discussed.

Performance Analysis of Relay-based Two-way D2D Communications with Network Coding.

In this paper, we present an analytical approach to evaluate the performance of dual-hop, two-way, and asymmetric D2D communications with and without network coding. In our approach, we first establish a relationship between link outage probability (LOP) and packet loss probability (PLP), where PLP is defined as a function of LOP. By distinguishing between two types of probabilities, we then investigate the system throughput and end-to-end packet loss probability (E2EPLP). Our evaluation results reveal that when PLPs of all links along one-way D2D communications are greater or smaller than those of their corresponding links along the other direction, network coding can achieve higher throughput (about 25%), as well as an lower E2EPLP (approximately 10%). We believe that the proposed analytical approach can provide a useful insight into the application of network coding in relay-based D2D networks.