Packet Assignment Research Articles

POSSIBILITIES OF IMPROVING THE VOICE SERVICES QUALITY IN 5G NETWORKS

Background. The introduction of fifth-generation (5G) networks creates new opportunities for fast and continuous data exchange, but there are still some problems with the quality of voice services in such networks. With the rapid development of technology and the further spread of 5G, there is a need to understand the impact of key aspects of 5G on voice quality. This requires research that can systematically analyse the features of 5G networks that affect the quality of voice services.
 Objective. Identification of ways to improve the quality of voice services in 5G networks. Assessment of key indicators of voice service quality in 5G networks. Determination of the best option for the gradual transition to the Standalone mode and the use of VoNR technology in the fifth generation networks.
 Methods. Analysis of factors affecting the quality of voice services in fifth-generation networks. Analysis of well-known publications on the implementation of 5G networks. Comparison of the implementation of Non-Standalone and Standalone modes in the 5G network. Testing of the modern EVS codec, which provides an opportunity to improve the customer experience.
 Results. Confirmation that 5G networks can significantly improve the quality of voice services compared to previous mobile communication technologies such as 4G and 3G. Certain factors that may affect the quality of voice services and require additional attention when planning and deploying 5G networks are identified. The optimal steps for the transition to the Standalone mode and the use of VoNR technology in fifth-generation networks are determined. The main differences in the QoS architecture between LTE and 5G are identified, and the purpose of DRB flows for separating traffic types and services is established.
 Conclusions. It has been confirmed that 5G networks can significantly improve the quality of voice services compared to previous technologies such as 4G and 3G. This is possible due to the broadband capabilities of 5G networks, improved data transmission, low latency, the use of an advanced EVS codec and reduced response time. However, certain factors, such as network coverage, optimisation level and traffic characteristics, can affect the quality of voice services and require additional attention when planning and deploying 5G networks. The QoS management architecture consists of QoS flows, which allow separating packet assignment to flows (managed by the CN) from the assignment of DRB flows (managed by the RAN). As 5G networks are being rolled out gradually, it is important to properly integrate the 5G domain into the existing telecoms provider's network. The transition from Non-Standalone to Dual connectivity is a necessary step for the implementation of VoNR technology in Standalone mode. Using the modern EVS codec allows not only improving the customer experience, but also introducing new voice services.

Maintenance scheduling at high-speed train depots: An optimization approach

Under the preventive maintenance policy, high-speed trains need to conduct periodical inspection/overhaul at dedicated depots, where maintenance facilities and maintenance crews are available. Due to the complicated structure of trains, the maintenance work is rich in a variety of types, characterized by mechanical components repaired, maintenance levels and etc. In practice, these types of maintenance work are integrated into maintenance packets, and different packets may require the specific types of crews. In this paper, a mixed integer linear programming model is proposed for the depot maintenance packet assignment and crew scheduling problem. The objective of the problem is to minimize the overall crew worktime, while the main constraints include the compatibility between maintenance packets and crew types, maintenance packet duration time and execution order, maintenance time window, and crew worktime limit. Besides, two families of valid inequalities are proposed to improve the baseline model. Computational experiments on a set of randomly generated instances show the effectiveness and efficiency of the improved model compared to the baseline one. Finally, a real-world case study from Shanghai South Depot is carried out to further validate the proposed approach. Improvements on both solution time and quality are achieved in contrast with the manual schedule.

Design security architecture for unmanned aerial vehicles by 5G cloud network based implementation of SDN with NFV and AI

A recent progression of unmanned aerial vehicles (UAV) augmentation its employments for different applications. It’s also vulnerable to being, stolen, lost, stray, or destroyed at status of a security infringements for the UAV network. The proposed strategy is defending against of different attacks through using artificial intelligence by implements five steps: RGSK, GCSCS, SEDC, HSSC, and FVNF. UAV authentication is happened in the first step through the Curve448. We performance deep reinforcement learning to run with GCS for packet assignment as it implemented for switch current state identification before updating. In our work we ability to alleviate for attack of flow table overloading by assigned of packets as an under loaded or idle switches. Then, selected the least loaded switch by applied 5 tuples. Hence, we divided SDN to SEDCs and HSSC forms. First in the SEDC we using Shannon entropy to achieve classified of input packet in to regular and suspicious packets. Last will forwarded regular packets to cloud layer. By growing multiple self-organizing maps for maintained in NFV that used to classify suspicious packets as classes normal or malicious packet. The proposed performance work evaluates using NS3.26 show up the better strategy to secure UAV for different attacks.

Joint Video Packet Assignment, Power Control and User Scheduling Over Cognitive Multi-Homing Heterogeneous NOMA Networks

Non-orthogonal multiple access (NOMA)-based cognitive heterogeneous multi-homing networks is a very important scenario in the future wireless networks. In this work, we formulate a joint video packet assignment, power control and user scheduling problem as a mixed integer non-linear programming (MINLP) to maximize the total video transmission quality for cognitive multi-homing heterogeneous NOMA networks, which is subject to the maximum accessed number of secondary users at each subchannel, video encoding characteristics, maximum interference power constraint and total available power constraint. For the joint video packet assignment, power control and user scheduling problem, we divide it into a video packet assignment subproblem, a power control subproblem and a secondary user scheduling subproblem for cognitive multi-homing heterogeneous NOMA networks. Firstly, the secondary user scheduling algorithm is proposed using the greedy method. Then, we utilize successive convex approximation (SCA) method to transform the power control subproblem into a convex programming problem, and an approximated optimal power control algorithm is proposed with the dual decomposition method. Finally, a heuristic video packet assignment algorithm is designed, which utilizes the auction theory. Numerical simulation results demonstrate that the proposed algorithms not only improve the video transmission quality, but also enhance the total throughput of cognitive multi-homing heterogeneous NOMA networks.

Resource Management of Video Traffic Over Heterogeneous NOMA Networks

To exploit the power domain diversity, heterogeneous non-orthogonal multiple access (NOMA) networks improve the spectrum efficiency for Internet of Things (IoT). For video traffic transmission, we formulate a resource allocation and assignment problem as a mixed integer non-linear programming (MINLP) subject to video encoding characteristics, maximum number of accessed devices, max-min fairness criterion, and total available energy of each device. To solve the resource allocation and assignment problem over heterogeneous NOMA networks, two subproblems are formulated, i.e., a packet assignment subproblem for video traffic and a joint device allocation and power control subproblem. Firstly, the joint device allocation and power control subproblem is transformed into a bi-convex programming with successive convex approximation (SCA) method. Then, an optimal device allocation and power control solution is obtained via dual decomposition method. Finally, a heuristic packet assignment algorithm via greedy method is presented for video transmission traffic. In numerical simulation, we can see that the proposed algorithm guarantees the max-min fairness among different devices, and improves the minimum and average video transmission quality over heterogeneous NOMA networks.

Block Recovery Rate-Based Unequal Error Protection for Three-Screen TV

This paper describes a three-screen television system using a block recovery rate (BRR)-based unequal error protection (UEP). The proposed in-home wireless network uses scalable video coding (SVC) and UEP with forward error correction (FEC) for maximizing the quality of service (QoS) over error-prone wireless networks. For efficient FEC packet assignment, this paper proposes a simple and efficient performance metric, a BRR which is defined as a recovery rate of temporal and quality layer from FEC assignment by analyzing the hierarchical prediction structure including the current packet loss. It also explains the SVC layer switching scheme according to network conditions such as packet loss rate (PLR) and available bandwidth (ABW). In the experiments conducted, gains in video quality with the proposed UEP scheme vary from 1 to 3 dB in Y-peak signal-to-noise ratio (PSNR) with corresponding subjective video quality improvements.

Packet assignment under resource constraints with D2D communications

D2D communications offer various benefits such as coverage extension and high energy efficiency. For example, a cluster of in-coverage devices can be recruited to relay packets for an out-of-coverage device. As the helper devices can be subject to varying relay costs and resource constraints, a sequence of packets need to be properly assigned among the helpers. In this article, we study the packet assignment problem from a mechanism design's perspective, taking into account the strategic interactions of self-interested helpers. Fundamental concepts in mechanism design are introduced for general readers to understand the background. Auctions are an important application of mechanism design and widely used in many fields. We develop a reverse auction mechanism, consisting of an allocation rule and a payment rule, to assign packets among helpers and determine payments based on their declared costs and resource constraints. As it is NP-hard to find an optimal packet assignment that minimizes the total cost, we use a low-complexity allocation rule, which performs closely to the optimal allocation on average. The payment rule implements the allocation rule in dominant strategies in which helpers disclose their true costs and resource constraints. This truthful revelation in turn justifies the allocation according to the helpers' declaration. Numerical analysis and simulations are conducted to evaluate the performance.

Transmission Power Control for Link-Level Handshaking in Wireless Sensor Networks

In practical wireless sensor networks (WSNs), the main mechanism for link-level data exchange is through handshaking. To maximize the network lifetime, the transmission power levels for both data and acknowledgement (ACK) packets should be selected optimally. If the highest transmission power level is selected then the handshake failure is minimized, however, minimizing handshake failure does not necessarily result in the maximized lifetime due to the fact that for some links selection of the maximum transmission power may not be necessary. In this paper, we investigate the impact of optimal transmission power assignment for data and ACK packets on network lifetime in WSNs. We built a novel family of mathematical programming formulations to accurately model the energy dissipation in WSNs under practical assumptions by considering a wide range of energy dissipation mechanisms. We also investigate the validity of a commonly made assumption in wireless communication and networking research: lossless feedback channel (i.e., ACK packets never fail). Our results show that the global optimal assignment of data and ACK packets can be replaced with link scope power level assignment strategies without any significant deterioration of network lifetime. The assumption that ACK packets do not fail is shown to be misleading.

Comparative performance analysis of subcarrier assignment for real‐time video traffic

The ability to transmit video and carry real-time multimedia applications such as video-streaming, video conferencing and mobile TV are considered important to support the viability and survivability of next generation mobile wireless networks. High peak transmission rate, spectral efficiency and multiple channel bandwidth requirements influence the design of next generation networks. For efficient usage of resources a number of block assignment strategies are followed based on congestion of traffic and priority of the service. Efficient block assignment schemes such as dynamic channel assignment (DCA) and dynamic packet Assignment (DPA) have been analysed in the literature. The authors propose a block assignment strategy for video traffic which sends video bursts over multiple blocks of orthogonal frequency division multiplexed access subcarriers simultaneously considering the interference characteristics of the channel. They present an analytical model using stochastic petrinets and compute the performance of the system in terms of mean delay and normalised system throughput. The results are validated using simulations. They compare the performance of the proposed sub-sequence DPA scheme in terms of mean delay and normalised throughput with DPA and DCA. It is observed that with the proposed strategy there is an increase in normalised throughput by 66 and 57% and reduction in mean delay by 74 and 61% for DCA and DPA, respectively.

Priority based Dynamic Packet Assignment for Multipath Routing in Multihop Networks

With the prevalence of wireless video applications, QoS of wireless video transmission in resource-limited wireless networks attract more and more researchers’ attention. In network layer, how to perform video packet assignment in multipath routing is a key issue. In this paper, we develop a simple but efficient, priority based dynamic assignment algorithm for multipath routing. The idea of this algorithm is to assign packet to a suitable path dynamically based on the priority of a video packet, quality difference between different paths and coding structure of the streaming video sequence. Simulation results show that our novel algorithm outperforms single path routing algorithm and other multipath routing algorithms significantly in packet receiving and average PSNR performance.

Analysis on Packet Reordering under Multi-path Transfers with Round-Robin Packet Assignment

基于包分配的多径传输在接收端所引起的数据包乱序严重影响TCP的传输性能。针对此问题，从排队论的角度出发对Round-Robin分配方式下多径传输的重排序问题进行了分析。从数据包的乱序率、重排序时间和端到端总时间3个方面考察了路径差异与路径数目对多径传输的性能的影响。结果表明，在采用两条路径传输时，应使得两条路径的传输速率近似相同；在路径传输速率相同的条件下，为明显地提升多径传输的重排序性能，路径数目应不超过4条。

QoS, Channel and Energy-Aware Packet Scheduling over Multiple Channels

In this letter, we extend the study from our previous work in. First, we extend physical layer resource allocation problem to a packet based transmission scheme. The proposed packet assignment improves the implementation robustness as it allows for consideration of coded modulation schemes while still ensuring energy efficient transmission as with our previous work. Secondly, we study the impact of channel partition size selection on system performance and complexity.

Accurate reversible color-to-gray mapping algorithm without distortion conditions

This paper proposes an accurate reversible algorithm without any distortion conditions such as a print-san process for converting full color images to gray images while preserving the chroma and spatial resolution of the images. In our previous study, we proposed a reversible color-to-gray algorithm using a second-level Haar wavelet transform with a packet assignment technique. We have improved this algorithm by devising a color embedding technique. The proposed algorithm distributes color information effectively in the one-level wavelet subbands for preserving the chroma and spatial resolution. Experimental results show that the proposed algorithm can achieve a higher accuracy of recovering color images from the textured gray images of the original color images. We also present a practical application of the proposed algorithm to a color-hiding image transmission; this application permits color recovery only to a specific user with a key.

A Processing Path Dispatcher in Network Processor MPSoCs

Multi-field packet classification problems discussed in the literature are typically constrained to the Internet five-tuple and primarily address the problem of network quality-of-service (QoS) support and access control. In this paper, we present a solution for a classification problem that is used for optimized packet assignment to different data paths within a network processor system-on-chip (SoC). In contrast to the five-tuple-based rules discussed in the prior art, our problem has rules that consider a larger set of fields from the packet header. However, for each individual rule a different sub-set of fields is relevant and the number of rules is smaller. Based on a specification of the usage case for our classifier we derive heterogeneous decision graph algorithm (HDGA), a heuristic approach to construct a decision tree classifier that integrates external lookup results for certain types of rules. We evaluate various parameters for optimizing the proposed decision tree and present simulation results to show the scalability of HDGA for typical problem sizes. This paper is concluded with the results of an implementation on our field-programmable gate-array (FPGA)-based prototyping platform.

Performance analysis of dynamic packet assignment in cellular systems with OFDMA

The authors present a performance analysis of orthogonal frequency division multiple access (OFDMA) based cellular systems with dynamic packet assignment (DPA). Most approaches in the current literature for analysing wireless data networks do not take into account the interference conditions on the radio channel. An analytical model based on a two-dimensional continuous-time Markov chain (CTMC), that takes into account the interference conditions on the OFDM subcarriers in addition to the traffic conditions, is proposed. The authors derive expressions for the mean delay and the average system throughput on the uplink and the downlink in OFDMA based cellular systems with data traffic.

Improving throughput and reliability in mobile wireless networks via transport layer bandwidth aggregation☆

Currently, most battlefield mobile communication devices are equipped with multiple wireless interfaces. The main target of the multiple interfaces is to increase the communication reliability between the soldiers in the battlefield and the command center, so that if one of the interfaces fails, the other interfaces can still provide a communication path. In this case each application data stream is limited to use only one communication channel. Due to the limited and variable bandwidth of the wireless channels, as well as their lossy and break-prone nature, the performance of mobile applications can be greatly hurt. In this paper, we present a transport layer solution for aggregating the bandwidth of the available interfaces. Our solution is based on extending Stream Control Transmission Protocol (SCTP). Our choice to extend SCTP for bandwidth aggregation was motivated by its inherent support for multi-homing. The extended SCTP, which we refer to as Load Sharing-SCTP (LS-SCTP), is able to aggregate the bandwidth of all the active transmission paths between the communicating endpoints. In addition, LS-SCTP dynamically adds/drops communication paths to the aggregated paths bundle. To ensure that the aggregate connection will not stall due to the high loss rate or continuous failure of individual paths, LS-SCTP includes path monitoring and packet assignment mechanisms that distribute the packets on the paths according to their current condition. Simulation results demonstrate the effectiveness of our proposed mechanism in providing throughput and reliability to mobile applications under battlefield conditions.

Improving throughput and reliability in mobile wireless networks via transport layer bandwidth aggregation

Currently, most battlefield mobile communication devices are equipped with multiple wireless interfaces. The main target of the multiple interfaces is to increase the communication reliability between the soldiers in the battlefield and the command center, so that if one of the interfaces fails, the other interfaces can still provide a communication path. In this case each application data stream is limited to use only one communication channel. Due to the limited and variable bandwidth of the wireless channels, as well as their lossy and break-prone nature, the performance of mobile applications can be greatly hurt. In this paper, we present a transport layer solution for aggregating the bandwidth of the available interfaces. Our solution is based on extending Stream Control Transmission Protocol (SCTP). Our choice to extend SCTP for bandwidth aggregation was motivated by its inherent support for multi-homing. The extended SCTP, which we refer to as Load Sharing-SCTP (LS-SCTP), is able to aggregate the bandwidth of all the active transmission paths between the communicating endpoints. In addition, LS-SCTP dynamically adds/drops communication paths to the aggregated paths bundle. To ensure that the aggregate connection will not stall due to the high loss rate or continuous failure of individual paths, LS-SCTP includes path monitoring and packet assignment mechanisms that distribute the packets on the paths according to their current condition. Simulation results demonstrate the effectiveness of our proposed mechanism in providing throughput and reliability to mobile applications under battlefield conditions.

A packet-size aware adaptive routing algorithm for parallel transmission server systems

This paper describes a routing algorithm that assigns each arriving packet to one of several homogeneous parallel servers. The algorithm differs from existing routing policies in that it considers the impact of each arriving packet's size on the average packet delay. It is derived from mimic optimal routing, which mimics the behavior of numerical solutions to a packet assignment problem. It works under the condition that inter-arrival-time and packet-size distributions are unknown, but some possible candidates are known in advance. The algorithm calculates statistics, such as means of these distributions, from input traffic, so it provides not only good performance under stationary input traffic but also adaptive behavior under dynamic input traffic, where the distributions change with time.

Network-assisted resource management for wireless data networks

We propose a framework for network-assisted radio resource management in wireless data networks. This type of radio resource management techniques offer implementation and capacity benefits compared to conventional, interference-measurement based, dynamic channel assignment (DCA) algorithms. The basic idea is to use interbase signaling to shift most of the burden of the resource allocation from the air interface to the backbone infrastructure. By exchanging channel assignment as well as other relevant information in real time through the backbone network, each base can calculate the impact of a resource assignment on the system. As a result, rapid interference measurements, which are typically needed to implement DCA schemes, are replaced by a limited amount of path loss measurements and the computation of interference conditions by the base stations. This significantly reduces the measurement and over-the-air signaling requirements, and can also provide an opportunity for a better optimization of the system performance. We focus on two specific algorithms: network-assisted least-interference-based dynamic packet assignment (NA-LI-DPA) and network-assisted dynamic packet assignment with throughput optimization (NA-DPA). NA-LI-DPA closely resembles a least-interference-based dynamic channel assignment algorithm, and NA-DPA attempts to further improve the overall system throughput. The algorithms, as defined, are appropriate for a best-effort data service, where the primary goal is to provide a higher throughput. However, it will be clear from the discussion that it is also feasible to alter the algorithms to optimize performance metrics other than throughput, e.g., to ensure a certain quality of service. We show through simulation that, for a system like enhanced general packet radio service (EGPRS) system, NA-DPA can provide a throughput that is 50% higher than random packet assignment, and 25% higher than that obtained by conventional DCA algorithms.

Dynamic single frequency networks

Wireless asymmetric Internet access with a downlink peak bit rate of 10 to 30 Mb/s can be achieved by using the terrestrial digital video broadcasting system (DVB-T) as a supplemental downlink together with today's cellular systems. This paper is a study of dynamic radio resource management on a packet-by-packet basis for this broadband downlink. The dynamic single frequency networks (DSFN) scheme is evaluated. It exploits the macrodiversity capability of the OFDM modulation scheme. The transmitters are dynamically divided into groups of transmitters that send the same information at the same channel frequency simultaneously. The fairly shared spectrum efficiency (FSSE), in bits per second per Hertz per site, which is a combined measurement of maximum throughput and fairness, is evaluated for best-effort traffic. DSFN improves the FSSE by 100% to 370%, for a certain set of test cases, in comparison to the dynamic packet assignment (DPA) scheme, which combines packet scheduling with dynamic channel assignment (DCA).