Packet Loss Behavior Research Articles

Assessment of QOS indicators of a network with UDP and TCP traffic under a node peak load mode

The object of research is Markov models of network nodes with UDP (User Datagram Protocol) and TCP (Transmission Control Protocol) traffic and their differences. The task solved is the lack of Markov models of network nodes describing the behavior of TCP traffic from the point of view of packet retransmissions and packet delivery guarantees. Markov models of network nodes describing traffic behavior with guaranteed packet delivery have been further advanced. Given the comparison of the models, the differences from the classic models serving TCP traffic were shown, for each packet flow, an additional dimensionally was added to the graph of states and transitions, which takes into account the retransmission of a lost packet. The comparison graph shows similar behavior of queue length and packet loss for both types of traffic. But the nature of the curves is different. With TCP traffic, packet loss can exceed 5 percent. In addition, lost packets must be retransmitted, which increases the load on the network node. More failures and packet queue lengths at a network node during peak load typically occur with TCP traffic compared to UDP traffic. At peak load, the difference in service failures can reach 20–30 percent. The main reason is that TCP uses flow control and rate-limiting mechanisms to avoid network congestion and ensure efficient data transfer between nodes. The Markov model of TCP traffic requires an additional dimensionally on the graph of states and transitions, which affects the behavior of queues and packet failures. The investigated problem was solved due to the universality and diversity of the mathematical apparatus of Markov mass service systems. The results could be used in network modeling software products for building and reengineering the topology of electronic communications networks at enterprises and organizations

Asynchronous event-triggered [formula omitted][formula omitted] control for 2D Markov jump systems subject to networked random packet losses

This paper investigates the issue of asynchronous event-triggered control for two-dimensional Markov jump systems subject to networked random packet losses. The asynchronous behavior between the plant and controller is characterized by a hidden Markov model, and the packet loss behavior is described by a Bernoulli stochastic process. To relieve the communication pressure, an event-triggered strategy with independent triggering behavior in the horizontal and vertical directions is given. A sufficient condition is established to ensure stochastic stability and H∞ performance for the closed-loop system. Then, a method for designing an asynchronous event-triggered controller is developed through eliminating nonlinearities formed by the inverse of Lyapunov matrices. Moreover, based on convex optimization of the H∞ performance, an algorithm is proposed to find the maximum feasible domain of the event-triggered thresholds. Finally, a Darboux equation with Markov jump properties is applied to verify the effectiveness of the presented design method.

Disturbance-Observer-Based Finite-Time Antidisturbance Control for Markov Switched Descriptor Systems With Multi-Disturbances and Intermittent Measurements

This paper is concerned with the finite time <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$H_\infty$</tex-math> </inline-formula> composite anti-disturbance control problem for Markov switched descriptor systems with multiple disturbances and packet loss via a disturbance observer. Significantly, the switching topology of descriptor systems is controlled by nonhomogeneous Markov switching processes, whose time-varying transition probability is limited by a convex hull. Subsequently, a Bernoulli random variable is exploited to characterize the intermittent measurement mode behavior of controller-actuator packet loss. Furthermore, the stochastic <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$H_\infty$</tex-math> </inline-formula> finite time boundiness of the composite system and simultaneously suppression and rejection of external disturbances are established by resorting to disturbance observer-based robust control (DOBC) strategy and a new stochastic Lyapunov function technique. More importantly, a relaxed variable method is provided to eliminate the coupling between Lyapunov variables and the system matrix in the process of stability analysis, instead of eliminating the coupling by means of commonly-used traditional inequalities, which effectively increases the flexibility of the obtained stable results and greatly reduces the computational complexity of controller/observer in the existing works. Finally, the effectiveness and practicability of the developed results are verified by two practical engineering models.

Observer-based control for networked Takagi-Sugeno fuzzy systems with stochastic packet losses

This paper addressed the observer-based control problem for Takagi-Sugeno (T-S) fuzzy systems with stochastic packet losses. More specifically, an sampled-data (SD) control technique is introduced to reduce the burden of the limited bandwidth of the network, a general consecutive packet loss model is used to represent the stochastic packet loss behavior between sensor-to-controller and controller-to-actuator, and an observer scheme based on received SD output information is used to obtain the estimated system states. Based on the above scenarios, an exact discrete-time model approach is developed for stabilizing networked T-S fuzzy systems. First, the considered system with the observer-based control scheme is transformed into its discrete-time model such that subsequent analysis will be carried out in the discrete-time domain. On this basis, stability criteria are derived by fully considering the probability distribution of consecutive packet losses. Furthermore, an observer-based controller is designed by introducing some auxiliary matrices. Finally, the correctness and practicability of the designed controller is demonstrated by a mass-spring-damper system.

Anomaly Detection of Wireless Relays Based on Markov Models Through the Wald-Wolfowitz Runs Test

This letter presents a new anomaly detection method adopting the Wald–Wolfowitz runs test for abnormal wireless relays with intermittent packet loss modeled as Markov chains. The proposed method identifies anomalies by leveraging the characteristics of runs in time series of packet loss behaviors without prior knowledge. An asymptotic analysis of the detection performance shows that the false alarm probability rapidly converges to a sufficiently small value, and the missed detection probability decays to zero exponentially. According to theoretical analysis, this method can discern arbitrary Markov-based intermittently abnormal relays from normal ones compared to the general approach based on the overall proportion of dropped packets. Numerical results verify the analysis and corroborate its superiority of wide detection range and short detection time.

Learn-ing-Based On-AP TCP Performance Enhancement

Data transmissions suffer from TCP’s poor performance since the introduction of the first commercial wireless services in the 1990s. Recent years have witnessed a surge of academia and industry activities in the field of TCP performance optimization. For a TCP flow whose last hop is a wireless link, congestions in the last hop dominate its performance. We implement an integral data sampling, network monitoring, and rate control software-defined wireless networking (SDWN) system. By analysing our sampled data, we find that there exist strong relationships between congestion packet loss behaviors and the instant cross-layer network metric measurements (states). We utilize these qualitative relationships to predict future congestions in wireless links and enhance TCP performance by launch necessary rate control locally on the access points (AP) before the congestions. We also implement modeling and rate control modules on this platform. Our platform senses the instant wireless dynamic and takes actions promptly to avoid future congestions. We conduct real-world experiments to evaluate its performance. The experiment results show that our methods outperform the bottleneck bandwidth and RTT (BBR) protocol and a recently proposed protocol Vivace on throughput, delay, and jitter performance at least 16.5%, 25%, and 12.6%, respectively.

A new approach for packet loss measurement of video streaming and its application

Packet loss is of great importance as a metric that characterizes the network’s performance, and is crucial for video applications, congestion control and routing. Most of existing measurement tools can indicate the packet loss of network links instead of the actual packet loss of individual application. On the other hand, because occurrence of packet loss behavior is relatively rare and its duration is short, active measuring methods need to inject a large number of packets and run for a long time for reporting accurate estimates, which would introduce additional intrusiveness to the network and perturb user traffic. In this paper, we present a new packet loss estimation technique by making use of user_data field of video, which is less intrusive since it does not affect video playing and does not need to inject extra probing stream. It can also provide the packet loss detailed information of I,P,B frames. The accuracy of the algorithm has been evaluated with both simulations and experiments over real-world Internet paths. In addition, we analyze the video quality distortion caused by packet loss of different frame types, and a real-time video quality monitoring system is built.

Elucidating the Short Term Loss Behavior of Markovian-Modulated Batch-Service Queueing Model with Discrete-Time Batch Markovian Arrival Process

This paper applies a matrix-analytical approach to analyze the temporal behavior of Markovian-modulated batch-service queue with discrete-time batch Markovian arrival process (DBMAP). The service process is correlated and its structure is presented through discrete-time batch Markovian service process (DBMSP). We examine the temporal behavior of packet loss by means of conditional statistics with respect to congested and noncongested periods that occur in an alternating manner. The congested period corresponds to having more than a certain number of packets in the buffer; noncongested period corresponds to the opposite. All of the four related performance measures are derived, including probability distributions of a congested and noncongested periods, the probability that the system stays in a congested period, the packet loss probability during congested period, and the long term packet loss probability. Queueing systems of this type arise in the domain of wireless communications.

Contribution-Guided Peer Selection for Reliable Peer-to-Peer Video Streaming Over Mesh Networks

This paper proposes a sender-driven peer selection scheme, including estimation of packet loss propagation, evaluation of peers' contributions, and peer selection based on child-peers' contributions, for mesh-based peer-to-peer (P2P) video streaming systems. The proposed packet loss propagation model takes into account the link packet drop rate, peer dynamics, and forward error correction protection to capture the heterogeneous packet loss behavior of individual substreams transmitted over a mesh network. The evaluation of candidate peers' contributions is modeled through Markov random fields to significantly reduce complexity. Simulation results demonstrate that our peer selection scheme significantly mitigates packet loss in a mesh-based P2P network, compared to other state-of-the-art schemes.

Environment-Aware CMT for Efficient Video Delivery in Wireless Multimedia Sensor Networks

Wireless Multimedia Sensor Networks (WMSNs) have gained significant attention with capabilities of retrieving video and audio streams, still images, and scalar sensor data but with challenge of high data loss. As more and more wireless devices are equipped with multiple network interfaces, multimedia delivery over multipath has been cognized as a more promising approach in wireless transmission. In this paper, based on the Concurrent Multipath Transfer (CMT) extension for Stream Control Transport Protocol (SCTP), we propose a novel environment-aware CMT (e-CMT) to overcome the high data loss challenge, as well as &#x201c;a hot potato&#x201d; congestion problem in wireless transmission. The e-CMT provides environment-aware cognitive ability for efficient video delivery with three modules, which are Path Quality-aware Model (PQM) that devotes to estimate path quality and select candidate path using for retransmission, Adaptive Retransmission Trigger (ART) that contributes to cognize packet loss and trigger efficient retransmission behaviors, and Congestion-avoid Data Distributor (CDD) that serves to enable Partial-Reliable retransmission to mitigate congestion condition. We design a close realistic topology to present how the e-CMT outperforms the original CMT for efficient video delivery over multihomed WMSNs.

Accurate modeling of VoIP traffic QoS parameters in current and future networks with multifractal and Markov models

In this paper, we analyze the jitter and packet loss behavior of Voice over Internet Protocol (VoIP) traffic by means of network measurements and simulations results. As result of these analyses, we provide a detailed characterization and accurate modeling of these Quality of Service (QoS) parameters. Our studies have revealed that VoIP jitter can be modeled by self-similar processes with short range dependence (SRD) or long range dependence (LRD). The discovery of LRD (a kind of asymptotic fractal scaling) in VoIP jitter was followed by a further work that shows the evidence of multifractal behavior. The implication of these behaviors for VoIP and other interactive multimedia services is that receiver de-jitter buffer may not be large enough to mask the jitter with LRD and multifractal characteristics. On the other hand, we use a description of VoIP packet loss based on microscopic and macroscopic packet loss behaviors, where these behaviors can be modeled by 2-state and 4-state Markov chains, respectively. Based on the above mentioned points, we present a methodology for simulating packet loss. Besides, we found relationships between Hurst parameter (H) with the packet loss rate (PLR); these relationships are based on voice traffic measurements and can be modeled by means of a power-law function, characterized by three fitted parameters. The proposed models can be used to: (i) design a de-jitter buffer, (ii) implement a synthetic generator of VoIP jitter data traces, where the synthetic jitter data traces can be used as test vectors to carry out the performance evaluation of a de-jitter buffer of VoIP system, and (iii) design effective schemes for packet loss recovery.

A Comprehensive Study of the Behavior of Different TCP Variants using Multistate Error Model in Cellular Mobile Environment

The widespread use of internet services over the wireless links is expeditiously grown in recent years. The reinforcement of portable computing platform and technological elevation of wireless communication evokes substantial prosperity in the design and development of integrated environment such as cellular mobile environments. The repercussion of packet losses due to corruption and mobility is the radical circumstances of deteriorating TCP performance in the wireless ambience. Uniform and Multistate error model are both used in wireless environment; Uniform error model provides packet losses at a constant rate which consequence an imprecise results during simulation as in wireless environment packet losses are arbitrary, bursty and time diversify in nature. However Multistate error model imitates the behavior of the wireless packet loss in real environment and produce infallible outcome. In this paper we constitute a realistic Cellular Mobile Environment by considering multistage error model in the design of wireless packet losses. Mobility in structure is also conceived to estimate the actual performance of TCP. Moreover the behavior of TCP Tahoe, Reno, New Reno, Sack and Vegas in Cellular Mobile network is simulated to perceive the impact of wireless link on the behavior of these TCP variants. Finally from the result of our simulation we conclude the best TCP variants for different circumstances.

안정적 Wi-Fi 방송 서비스를 위한 무선 랜 전송 특성 분석

무선 랜 기술을 방송 분야에 응용하기 위해서는 IEEE 802.11 방송 패킷에 대한 이해가 필요하다. 현재 IEEE 802.11 방송 패킷 전송 기술은 Unicast 패킷 전송 기술에 비해 컨텐츠 전달의 신뢰성을 보장 할 수 없다는 단점이 있다. 이러한 무선 랜 방송 기술의 손실률 제어를 위한 기법으로 FEC가 주로 사용되고 있다. 무선 랜 방송 기술에 FEC 기법을 활용함에 있어서 핵심은 복구를 위한 여분의 패킷 양을 결정하는 것이다. 이에 본 논문은 먼저 다중 무선 랜 전송률-(1-54Mbps) 이 지원되는 방송 테스트베드를 구성하였다. 그리고 방송 패킷의 길이, 무선랜 전송률, 주변 환경에 따른 손실률을 구하고 손실률을 최소화 할 수 있는 인자들의 값을 도출 하였다. 나아가 구해진 손실률을 이용하여 FEC 여분 패킷 양을 결정하였다. To apply Wi-Fi technique to the Broadcast field, we have to study features of IEEE 802.11 Broadcast packet. IEEE 802.11 Broadcast technique cannot guarantee successful packet delivery than IEEE 802.11 Unicast. A promising solution to this problem is the use of FEC(Forward Error Correction) mechanisms. However, the adjustment of the FEC redundancy rate is not a trivial issue due to the dynamic wireless environment. In order to explore the above issues we conducted an experimental study of the packet loss behavior of the IEEE 802.11g protocol. In order to study, we implemented a broadcast test bed. Based on the experimental results, we provide guidelines on wireless lan parameters(packet size, transmission rate(11g), background traffic). From this experimental study, we provide FEC redundancy rate.

Packet loss behavior of homeplug AV traffic at video bit rates

HomePlug AV is a recent version of the popular HomePlug powerline networking standard. An inhome HomePlug AV network was sampled between 1 and 6 Megabits per second (Mbps) with and without added noise and analyzed with respect to packet losses. Our experimental results indicate that the distribution of the number of consecutive error bursts is a combination of the classic Gilbert-Elliot model and a long-tailed distribution caused by ambient electrical noise.

Significance-Aware Channel Power Allocation for Wireless Multimedia Streaming

We develop a novel transmit power-allocation strategy for wireless multimedia communications using cross-layer optimization. Because the individual frames in a compressed video carry different degrees of importance in terms of quality of service (QoS), improving the packet-loss probability does not necessarily coincide with perceivable improvements in QoS from a client's point of view. We propose a channel power-allocation scheme that properly incorporates the importance of frames when allocating transmit power. The system is modeled in terms of the number of remaining packets to be sent, the interference level, and the QoS importance of the packet that is being transmitted. Dynamic programming formulation is developed to obtain the optimal transmit power that simultaneously minimizes power consumption and maximizes the user-perceivable QoS. Using dynamic programming, we establish a state transition equation in discrete time intervals that incorporates the packet-loss probability. A simulation-based experiment is performed to test our transmit power-allocation scheme. We use four publicly available Motion Pictures Expert Group 4 (MPEG-4) video clips, comparing the performance of three different channel power-allocation strategies: constant power-allocation, interference-aware power-allocation, and significance-aware power-allocation. Optimal channel power under varying interference levels and the respective packet loss behaviors are examined. The results prove that our significance-aware transmit power-allocation scheme exhibits superior performance in terms of the loss ratio PSNR and power-utilization efficiency. The total packet byte loss decreases by 3%-8%. The loss rate of the I frame decreases from 24% to 1%. Significance-aware power-allocation successfully provides unequal protection to the more important packets. Total power consumption is reduced by 18%-34% without loss of user-perceivable QoS.

On-Line Prediction of Nonstationary Variable-Bit-Rate Video Traffic

In this paper, we propose a model-based bandwidth prediction scheme for variable-bit-rate (VBR) video traffic with regular group of pictures (GOP) pattern. Multiplicative ARIMA (autoregressive integrated moving-average) process called GOP ARIMA (ARIMA for GOP) is used as a base stochastic model, which consists of two key ingredients: prediction and model validity check. For traffic prediction, we deploy a Kalman filter over GOP ARIMA model, and confidence interval analysis for validity determination. The GOP ARIMA mPodel explicitly models inter and intra-GOP frame size correlations and the Kalman filter-based prediction maintains ?state? across the prediction rounds. Synergy of the two successfully addresses a number of challenging issues, such as a unified framework for frame type dependent prediction, accurate prediction, and robustness against noise. With few exceptions, a single video session consists of several scenes whose bandwidth process may exhibit different stochastic nature, which hinders recursive adjustment of parameters in Kalman filter, because its stochastic model structure is fixed at its deployment. To effectively address this issue, the proposed prediction scheme harbors a statistical hypothesis test in the prediction framework. By formulating the confidence interval of a prediction in terms of Kalman filter components, it not only predicts the frame size but also determines validity of the stochastic model. Based upon the results of the model validity check, the proposed prediction scheme updates the structures of the underlying GOP ARIMA model. We perform a comprehensive performance study using publicly available MPEG-2 and MPEG-4 traces. We compare the prediction accuracy of four different prediction schemes. In all traces, the proposed model yields superior prediction accuracy than the other prediction schemes. We show that confidence interval analysis effectively detects the structural changes in the sample sequence and that properly updating the model results in more accurate prediction. However, model update requires a certain length of observation period, e.g., 60 frames (2 s). Due to this learning overhead, the advantage of model update becomes less significant when scene length is short. Through queueing simulation, we examine the effect of prediction accuracy over user perceivable QoS. The proposed bandwidth prediction scheme allocates less 50% of the queue(buffer) compared to the other bandwidth prediction schemes, but still yields better packet loss behavior.

802.11g packet-loss behavior at high sustained bit rates in the home

802.11g is a popular way to transmit data throughout homes wirelessly. However, common broadcast-quality video bitrates, up to 20 Megabits per second, represent difficult challenges for wireless networks in terms of latency, packet loss, and packet jitter. An in-home network was sampled between 0.5 and 2 Megabits per second (Mbps) and analyzed with respect to packet loss. Our experimental results indicate that the distribution of the number of consecutive error bursts is a combination of the classical Gilbert-Elliot model and a long-tail model.

Performance Analysis of Mobile Hotspots with Heterogeneous Wireless Links

Mobile hotspot enabling Internet access services in moving vehicles is an important service for ubiquitous computing. In this paper, we propose an analytical framework for studying the packet loss behavior and throughput in a mobile hotspot with heterogeneous wireless links. We first develop a two-state Markov model for the integrated wireless wide area network (WWAN) and wireless local area network (WLAN). We then derive the expressions that describe the experienced packet loss probability, packet loss burst length, and throughput. Finally, we present simulation results to verify the accuracy of our analysis. It is concluded that adaptive and cross-layer approaches should be deployed to improve the performance of mobile hotspots.

Retry Limit Based ULP for Scalable Video Transmission over IEEE 802.11e WLANs

We investigate the packet loss behavior in the IEEE 802.11e wireless local area networks (WLANs) under various retry limit settings. Considering scalable video traffic delivery over the IEEE 802.11e WLANs, our study shows the importance of adaptiveness in retry limit settings for the unequal loss protection (ULP) design. Based on the study, we present a simple yet effective retry limit based ULP which adaptively adjusts the retry limit setting of the IEEE 802.11e medium access control protocol to maintain a strong loss protection for critical video traffic transmission. The simulation results illustrate significant advantages in the delivered video quality for our proposed design.

Short- and Long-Term Packet Loss Behavior: Towards Speech Quality Prediction for Arbitrary Loss Distributions

A speech-quality-oriented classification of packet loss distributions is proposed according to both the short- and long-term loss behavior. While the short-term behavior (microscopic loss behavior) relates to the effect of packet loss on the coder and packet loss concealment performance, the long-term loss behavior (macroscopic loss behavior) is defined so that it reflects the loss behavior that ultimately leads to speech quality that perceptively changes over time. Based on this classification, different parametric (objective) modeling approaches for predicting speech quality are discussed. To this aim, a packet loss averaging approach is presented for modeling speech quality under short-term loss. Starting from this model, two different ways for predicting speech quality under long-term-dependent packet loss are analyzed and compared to auditory (subjective) test results: quality prediction based on the averaging at packet trace level as provided, for example, by the E-model (2005), and the prediction based on the time-averaging of estimated instantaneous quality profiles, as suggested, for example, by L. Gros and N. Chateau (2001) (1998). From this comparison, the suitability of the different approaches for network planning are discussed, and their limitations in case of particular loss distributions are pointed out