Packet Loss Probability Research Articles

Fuzzy queue based switch efficiency measures for optical network

In the optical network, researchers face the major challenges and issues like improper packet scheduling, inadequate number of packet switching, less response time of switch and routing efficiency. In this paper a satisfactory model replacing the existing unsatisfactory stream of packet transmission in optical network switching for performance analysis investigation using the fuzzy queuing theory with M/M/2/∞ queuing system based on optical fuzzy queue based switch (OFQS) with a view to improve the performance of the efficiency of the novel OFQS switch design. The investigation uses the uncertainty rate of packet arrival ( $$\lambda$$ ) and rate of service (µ) of the switch and applies the Robust ranking technique to convert the fuzzy values into crisp values for trapezoidal fuzzy analysis. Simulation result shows that the proposed novel switch gives better performance in terms of low conversion switching complexity and packet loss probability as compared to the conventional switch model.

IRCTGP: A Novel Intra-node Resource Control Protocol Based on Traffic Priority and Evolutionary Games Theory for Wireless Sensor Networks

A Wireless Sensor Network (WSN) is a network which is made up of resource-constrained wireless sensors with restricted capabilities. Quality of Service in Wireless Sensor Networks is still an open area of research, due to the fact that several problems need to be solved using resource constrained WSN nodes. The probability of congestion occurrence and packet loss in Wireless Sensor Networks is high, which makes it difficult to satisfy different qualities of service requirements. Congestion in WSN needs to be controlled to improve the quality of service such as throughput and packet loss ratio along with the packet delay. In particular, we proposed the use of evolutionary game theory in the design of a QoS-aware Intra-node congestion control protocol. Intra-node congestion control protocol is a non-cooperative asymmetric game that adjusts the queue accepting rate and queue service rate such that higher priority classes have lower loss rate and lower queuing delay. Simulation results show that the proposed protocol decreases packet dropping and improves network throughput and network quality of service performance.

Development of a Real-Time Dynamic Weighting Method in Routing for Congestion Control: Application and Analysis

Congestion control issues have received consistent attention from several telecommunication researchers and practitioners for many years because network congestion often causes significant packet loss and delay problems. Although many suggested methods for these issues and problems can be available in telecommunication literature, there is room for improvement. This paper's primary objective is to propose a dynamic weighting method in routing to reduce congestion during peak hours by predicting incoming traffics and optimizing weights in the adjacency matrix of the routing table online. While changing weight values in the routing table, this method implicitly changes the routing path of many nodes through the congested node. As a result, the packet losses and delays can be decreased in used nodes. The main steps of this proposed framework are fourfold. First, the candidate weighing list is calculated based on the routing table of the congested node. Second, a proposed auto-adaptive framework (AAF) is used to predict congestion levels and apply the weighing list in the network node. Third, the evaluation of network congestion is then performed by the probability of packet losses due to overflowing buffers. Finally, the case study results demonstrate that the proposed AAF framework can significantly reduce network congestion.

Анализ очереди в системе G/G/1 на основе гиперэкспоненциальных распределений

For real-time applications, the change in packet delay, which is usually called delay jitter, is one of the most important parameters of quality of service in modern infocommunication networks when processing multimedia streams, along with the delay and the probability of packet loss. This article discusses approaches to assessing jitter in modern infocommunication networks when processing non-Poissonian traffic in the G/G/1 system. To approximate the system of an arbitrary queue G/G/1, a model based on hyperexponential distributions of the type H2/H2/1 was used. As a processed stream, the implementation of IP network traffic with the absence of mutual correlations between the time intervals between packets and the times of packet processing is used. An important task in this case is to determine the parameters of hyperexponential distributions for the time intervals between packets and packet processing times. The paper presents two methods for determining the parameters of hyperexponential distributions: using the method of moments and using the EM-algorithm. The paper analyzes the influence of the network load factor on the jitter value when using two models for determining the parameters of hyperexponential distributions. This analysis showed a slight increase in jitter with increasing network load both in the case of using the method of moments and in the case of the EM algorithm. It has been determined that the estimates of the jitter values in the case of applying the method of moments and the EM algorithm are quite close in value. The main result of the work is to obtain simple calculation formulas for the analysis of jitter in the G/G/1 system using hyperexponential distributions.

Stabilization of continuous linear scalar systems with network-induced delay using quantized and lossy observations

We propose a coding scheme for the stabilization of continuous linear scalar systems under a communication channel with finite data rate, lossy observations and network-induced delay. Owing to the network-induced delay, uncertain control input is introduced to the corresponding discrete time systems. Furthermore, since the system state is quantized to finite-bit signals and may be randomly lost in the communication, under the proposed coding scheme, the considered scalar system is described by a switched system of more than one dimension with arbitrary switchings. We derive the conditions for first moment stability of the systems, characterizing the relations on quantization cell boundaries, packet loss probabilities, and the network-induced delay. Further, we derive the condition for almost sure stability of the systems. A numerical method is proposed to search the infimum of the data rate for first moment stability under the given condition. It is shown that for the quantizer with the infimum of the data rate for first moment stability, although the quantization cells have different lengths, the matrices corresponding to these quantization cells have the same maximum eigenvalue.

The Mobile Water Quality Monitoring System Based on Low‐Power Wide Area Network and Unmanned Surface Vehicle

The increasingly serious water pollution problem makes efficient and information‐based water quality monitoring equipment particularly important. To cover the shortcomings of existing water quality monitoring methods, in this paper, a mobile water quality monitoring system was designed based on LoRa communication and USV. In this system, the USV carrying water quality sensors was used as a platform. Firstly, the LoRa network is used to monitor water quality over a large area. Secondly, the unmanned surface vessel controls the position error within ±20 m and the velocity error within ±1 m/s based on the Kalman filter algorithm. Thirdly, the genetic algorithm based on improved crossover operators is used to determine the optimal operational path, which effectively improves the iterative efficiency of the classical genetic algorithm and avoids falling into local convergence. In the actual water surface test, its packet loss probability within a working range of 1.5 km was below 10%, and the USV could accurately navigate according to the preset optimal path. The test results proved that the system has a relatively large working range and high efficiency. This study is of high significance in water pollution prevention and ecological protection.

Cross-Layer MAC/Routing Protocol for Reliable Communication in Internet of Health Things

Internet of Health Things (IoHT) involves intelligent, low-powered, and miniaturized sensors nodes that measure physiological signals and report them to sink nodes over wireless links. IoHTs have a myriad of applications in e-health and personal health monitoring. Because of the data’s sensitivity measured by the nodes and power-constraints of the sensor nodes, reliability and energy-efficiency play a critical role in communication in IoHT. Reliability is degraded by the increase in packets’ loss due to inefficient MAC, routing protocols, environmental interference, and body shadowing. Simultaneously, inefficient node selection for routing may cause the depletion of critical nodes’ energy resources. Recent advancements in cross-layer protocol optimizations have proven their efficiency for packet-based Internet. In this article, we propose a MAC/Routing-based Cross-layer protocol for reliable communication while preserving the sensor nodes’ energy resource in IoHT. The proposed mechanism employs a timer-based strategy for relay node selection. The timer-based approach incorporates the metrics for residual energy and received signal strength indicator to preserve the vital underlying resources of critical sensors in IoHT. The proposed approach is also extended for multiple sensor networks, where sensor in vicinity are coordinating and cooperating for data forwarding. The performance of the proposed technique is evaluated for metrics like Packet Loss Probability, End-To-End delay, and energy used per data packet. Extensive simulation results show that the proposed technique improves the reliability and energy-efficiency compared to the Simple Opportunistic Routing protocol.

Research on adaptive prediction of multimedia data transmission path based on machine learning

Aiming at the problems of high probability of data packet loss and long data receiving delay in current methods, an adaptive prediction method of multimedia data transmission path based on machine ...

Joint Power Control and Scheduling for High-Dynamic Multi-Hop UAV Communication: A Robust Mean Field Game

As an extensive prospect in communication technology, multi-hop unmanned aerial vehicle (UAV) faces some challenges as well. How to ensure the availability of time slots in high dynamic scenarios and the rationality and robustness of power allocation in massive scenarios remains to be resolved. In this paper, we propose a robust mean field game (MFG) framework to manage time slot resources and power resources. On the one hand, this framework can predict the potential conflicts of time slots and avoid them in time. On the other hand, it can well adapt to the massive scenarios with complex interference, in order to realize power control. The simulation results show that the robust MFG-based resource management scheme can not only reduce the probability of packet collision and packet loss, but also improve communication energy efficiency (EE) with better robustness.

Radio Access Mechanism for Massive Internet of Things Services Over White Spaces

This paper proposes a novel radio access mechanism for massive Internet of Things (IoT) services over TV White Spaces (TVWS). The proposal considers TVWS as the suitable frequency bands for facing the limited-spectrum problem in massive IoT services. The radio access mechanism is based on regulatory policies by interacting with a TVWS Geolocation Database through the Protocol to Access White-Space (PAWS) and using several Master Devices (MD)s. With this approach, IoT devices require neither geolocation receiver in the deployments, nor different frequency bands for initialization process within PAWS. Regarding the evaluation of the radio access mechanism, we explore different types of deployments and coverage areas. This paper also describes the optimization process to obtain the maximum service area, while maintaining an outage probability below a given objective. Moreover, we evaluate the performance of a loaded network with the maximum service area, with respect to a reference case with one MD. We evidence that the average packet loss probability is reduced by 26% when the load is equal to 80% in our proposal.

SDN Assisted Codec, Path and Quality Selection for HTTP Adaptive Streaming

Adaptive streaming over HTTP is the dominant video streaming technology for more than a decade. HTTP Adaptive Streaming (HAS) systems provide a framework which enables clients to adapt quality with respect to network fluctuations during streaming, hence to optimize the perceived quality on the client side. Recently, network assistance is integrated with HAS in order to improve underlying network conditions and to provide network-related information to the clients. The performance of HAS systems can be further enhanced if the characteristics of the streamed video are considered. In this paper, we propose a HAS system architecture where Software Defined Networking (SDN) technology is utilized for assisting clients to select the most appropriate video codec and bitrate under the constraint of current network conditions as well as routing the video packet over the appropriate paths. In the proposed architecture, layered video is used, where each additional layer improves the quality. The controller estimates the packet loss probability by taking video codec characteristics, the bitrates of the layers and network capacity into account. Based on these estimations, the controller selects the appropriate codec type and video quality for the clients and manage the network. Simulation results show that the performance of the video streaming architecture can be improved significantly when codec, quality and path selection are jointly considered, and combined with SDN flexibility and advantageous.

Efficiently Bounding the Probabilities of Vehicle Collision at Intelligent Intersections

Intelligent intersections have the potential to serve as an integral part of tomorrow’s traffic infrastructure. Wireless communication is key to enabling such technology. We consider a scenario where two flows of vehicles traverse an intelligent intersection. We investigate safety in emergency braking scenarios, where one of the vehicles in a flow suddenly decides to emergency brake and emergency braking messages are broadcast to affected vehicles. We provide a framework for computing lower bounds on probabilities for safe braking – collisions between vehicles are to be avoided. If we require that a crash or collision, for example, occurs at most once in a million scenarios, our approach allows for computation of lower bounds on the time-varying (or distance-varying) packet loss probabilities to ensure this. One of the benefits of the proposed framework is that the computational time is reduced; eliminating, for example, the need for time-consuming Monte Carlo simulations.

An Optimized Method of Packet Loss Rate under Backup Path Protection in OBS Network

In order to calculate the packet loss rate in OBS network, this paper proposes a method, which performs good in both accuracy and rapidity, based on Erlang B formula to estimate the packet loss probability in OBS network using backup path protection mechanism. This method can be used to optimize the design of OBS network protocol, and it also provides an accurate and efficient approximate calculation method of packet loss rate in OBS network and can be conductive to the study of using copy transmission to enhance the network survivability. Based on the formula of Erlang B, this paper briefly introduces the derivation process and principle of this method. The basic experimental principles of simulation and estimation processes are designed in this paper, and the experimental results of the proposed method under a typical network topology (ARPA network) with no protection mechanism and 1 and 2 backup paths protection mechanisms are analyzed to verify its rapidity and accuracy. The results of experiments show the accuracy and efficiency of this method.

Performance Analysis of Cognitive Radio Networks With Burst Dynamics

The impact of the traffic characteristics of secondary users (SUs) on the performance of cognitive radio networks (CRNs) should be understood for designing operation rules. This paper focuses on multi-type burst services and network congestion problem in CRNs and evaluates the QoS of SUs based on multiple cross-layer considerations. A two-state Markov-modulate Bernoulli process (MMBP-2) is adopted to model packet flows of SUs with different burst degrees in CRNs. We propose a two-dimensional discrete queuing model to consider spectrum access, burstiness of traffic, network congestion, channel environment, user activity and finite buffer. We construct an iterative algorithm to compute the steady-state distribution of the proposed queuing model and determine the performance metrics like the throughput, the average delay, the average queue length and the total packet loss probability. Numerical analysis evaluates the QoS of SUs under different burst environments.

Performance analysis of asynchronous priority-based internet router under self-similar traffic input - queueing system with Markovian input and hyper-exponential services

In this paper, queueing behaviour of asynchronous priority-based internet router with self-similar traffic input is analysed. As Markov modulated Poisson process (MMPP) emulates self-similar traffic, it is used as input process of pertinent queueing system. For quality of service (QoS) guarantee in a broadband integrated services digital network (B-ISDN), partial buffer sharing (PBS) mechanism is promising one. Since, network traffic is asynchronous and of variable packet lengths, wavelength division multiplexing (WDM) technology is to be employed, according to which, each output port is modelled as multi server queueing system. The service times (packet lengths) are assumed to follow hyper-exponential (Hk) distribution. For the said reasons, router here is modelled as MMPP/Hk/s/C queueing system employing PBS mechanism. High and low priority packet loss probabilities, and mean lengths of non-critical and critical periods are computed, and presented graphically. This analysis is useful in dimensioning the priority-based asynchronous router with self-similar traffic input.

Performance analysis of asynchronous priority-based internet router under self-similar traffic input - queueing system with Markovian input and hyper-exponential services

In this paper, queueing behaviour of asynchronous priority-based internet router with self-similar traffic input is analysed. As Markov modulated Poisson process (MMPP) emulates self-similar traffic, it is used as input process of pertinent queueing system. For quality of service (QoS) guarantee in a broadband integrated services digital network (B-ISDN), partial buffer sharing (PBS) mechanism is promising one. Since, network traffic is asynchronous and of variable packet lengths, wavelength division multiplexing (WDM) technology is to be employed, according to which, each output port is modelled as multi server queueing system. The service times (packet lengths) are assumed to follow hyper-exponential (Hk) distribution. For the said reasons, router here is modelled as MMPP/Hk/s/C queueing system employing PBS mechanism. High and low priority packet loss probabilities, and mean lengths of non-critical and critical periods are computed, and presented graphically. This analysis is useful in dimensioning the priority-based asynchronous router with self-similar traffic input.

Investigation of an improved tensor routing model in the telecommunications network represented in the basis of interpolar paths and internal node pairs

An improved tensor model of a telecommunication network (TCN) was selected for the study. The model is presented in terms of inter-polar paths and internal node pairs. The advantage of this model is the use of quality of service conditions in terms of bandwidth, average end-to-end delay, and packet loss probability. Within the framework of the chosen model, the technological routing problem is formulated in an optimization form together with the conditions and constraints imposed on routing variables. A system of criteria for optimality of routing solutions, which can be used to calculate optimal values for routing variables, is proposed. These criteria depending on the specifics of the routing problem focus on the optimal use of the available network resource and/or on the differentiated improvement of Quality of Service (QoS) indicators of network performance, to the numerical values of which one or another packet flow is sensitive. The analysis of the influence to the optimality criterion form on the nature of solutions to QoS-routing problems using the proposed tensor model of a telecommunications network is carried out. On a set of numerical examples, the improved tensor model of TCN both at the level of the proposed QoS-conditions and the considered QoS-optimality criteria confirmed its adequacy in solving the problems of a single path and multipath routing. The improved tensor model of TCN provided an adaptive response to changes in network load and the type of optimality criterion for routing solutions in terms of ensuring the required values of QoS-indicators – bandwidth, average end-to-end delay, and packet loss probability.

Improved Model of Load Balancing in the Infocommunication Network

The paper proposes an improved mathematical model of load balancing in the infocommunication network (ICN), corresponding to the Traffic Engineering (TE) concept principles. The model mathematically formalizes the case of ICN construction when each access network is switched simultaneously to not one but to several border routers to increase fault tolerance. Therefore, it is proposed to improve the load balancing level in the ICN according to the TE criterion by ensuring the distribution of traffic at the access level between several border routers that create a default virtual gateway. The proposed mathematical model is based on the conditions of implementation of single or multipath routing; load balancing at the access level; flow conservation at the access level and the network itself; overload prevention of communication links, which act as conditions for load balancing in ICN. Within the proposed model, the load balancing task in ICN is formulated as an optimization problem of mixed-integer linear programming. The results of the study confirmed the effectiveness of the proposed solution. Ensuring coordinated load balancing at both access and core network levels, in general, has increased network performance by 25.45% compared to a solution based on multipath routing, but without access level balancing, and 2.76 times compared to the model in which load balancing in the ICN was absent. Within the available load for each of the compared models, the use of the proposed solution allowed to reduce the upper bound of the network links utilization by an average from 20% to 60%. Lowering the upper bound of the network links utilization positively affects the quantitative values of the main Quality of Service indicators – the average end-to-end delay, jitter, and packet loss probability.

Comparative link-level analysis and performance estimation of channel models for IIoT (Industrial-IoT) wireless communications

In the industrial scenarios, modern gadgets should communicate independently and in a robust and productive manner with one another, depending on an enormous degree on wireless communication channels, which will expand and enhance the current wired communication links. The wireless communication channels experience several channel impairments, for example, attenuation because of propagation losses, random fluctuations because of fading and shadowing impacts over the channel and the non-line-of-sight (NLOS) because of obstacles on the communication channel. Hence adequate channel modeling is necessary. Several pieces of research exist on channel models to model industrial environments, but a comprehensive analysis and measurement of their characteristics are still missing from the current literature. This paper has performed analyses and measurements on a vast number of wireless channel models applicable to the IIoT in terms of multiple analytical approaches in several sections of the paper. Performance estimation approaches, such as received signal strength, packet loss probability, and RMS (Root Mean Square) error, RMS delay spread are investigated with a focus on channel models and three prominent IoT technologies are also included. The research might be able to address the demand for adequate IIoT channel modeling with included channel models and all analytical approaches presented.

Cascadability analysis of WDM recirculating loop buffer-based switch in optical data networks

Abstract In recent years the development of cloud computing, big data, cell phone application increases day by day and this will increase the work load on the server centers. Once the network traffic increases the power consumption also increases. In recent past, for reducing this power consumption arrayed waveguide grating (AWG) based optical packet switches are proposed. In these switches the physical and network layer analysis has been presented in isolated switch. In the core network to achieve low packet loss probability an effective buffering technique is required into the design of switch. In this paper a recirculating loop buffer based switch is presented, in this switch design for sharing the recirculating buffer, WDM technology is used by the packets. The main advantage of recirculating buffer is that it allows packet priority routing and by using this technique longer duration buffering of packet is achieved. This feature provides the quality of service in optical networks. In this paper, switch is deployed in the network and the performance of switch is measured when multiple switches are cascaded in the network simultaneously. The power analysis of switch is also performed for isolated and cascaded switches. For fixing the size of the switch into the network the concept of graph theory and random graph model is used.