Packet Scheduling Research Articles

Double Deep Q- energy aware Service allocation based on Dynamic fractional frequency reusable technique for lifetime maximization in HetNet-LTE network

The development of mobile communication in heterogeneous networks is incredible in providing various services through wireless cellular communication through advanced long-term evaluation networks. Increasing multi-concern services and frequencies in spectrum channels are highly layered to select the bandwidth to provide the fastest network without interference. Selecting the channel through macro cell selection is essential to improve network communication and provide the quickest service. Most frequency reuse techniques use service optimality and route selection-based protocols to enrich the packet flow. Still, the improper spectrum delights create more delay tolerance due to short-range service optimality due to energy loss by selecting the short spectrum signal to reuse, which doesn't support the lifetime improvement of the LTE network. To resolve these problems, we propose a Double Deep Q- energy-aware Service allocation based on a Dynamic fractional frequency reusable technique for lifetime maximization in the HetNet-LTE network. Initially, the heterogenous communication environment and node deplanement were carried out to construct the LTE network under the WCC. The communication logs are Route Table (RT), and its services are taken by all node LTE Communication Impact Rate (LTE-CIR). Then, the Backhaul Traffic Algorithm (BTA) is applied to predict the interference on traffic rate from the channel frequency margin. Select the balanced node using the Channel Interference Macro Cell Selection (CIMCS) technique. Considering frequency limits with the Double Deep Q- Network (DDQN) approach, energy-aware selects the optimal route to reuse the frequency level using Frequency Domain Packet Scheduling (FDPS) to improve communication. The proposed system improves the overall throughput by up to 97.8 % with adopted channel selection from the macro unit to improve the latency performance. Also, the interference frequency limits are dynamically reused at an energy optimal level with low-level delay tolerance to improve the link stability by up to 98.4 % with higher lifetime maximation in the LTE network.

Two-Hop Packet Scheduling, Resource Allocation, and UAV Trajectory Design for Internet of Remote Things in Air–Ground Integrated Network

Two-Hop Packet Scheduling, Resource Allocation, and UAV Trajectory Design for Internet of Remote Things in Air–Ground Integrated Network

Optimized Resource Management and Dynamic Routing Protocol for Wireless Sensor Networks Through Load Balancing, Packet Scheduling, and Intelligent Clustering

Heterogeneous Wireless Sensor Networks (HWSNs) are pivotal for providing weather-related event data, enabling universal location access, and facilitating remote monitoring through multi-hop transmission. Efficient energy utilization is critical in ensuring the optimal functioning of HWSNs. Previously, Compressive Sensing (CS) technology was established to enhance communication efficiency within HWSNs. While previous methods were effective in managing energy consumption and reducing transmission delays across network devices, the increased number of devices has impacted their efficacy. Consequently, energy becomes a vital limitation in constructing HWSNs. In order to address these challenges, this study introduces Load Balancing and Packet Scheduling with Intelligent Clustering based Improved Routing Protocol (LPICR). This integrates load balancing, packet scheduling, intelligent clustering, and enhanced routing techniques. The protocol is structured into three main categories: intelligent route selection, load balancing-based Cluster Head (CH) selection, and path scheduling. Initially, an efficient opportunistic routing is conducted by the intelligent route selection process. This routing method minimizes data forwarding during communication and significantly decreases energy consumption in the HWSN. Furthermore, by using a load balancing-oriented procedure for selecting cluster heads, the system achieves efficient determination of cluster heads and construction of clusters, resulting in the most efficient use of energy in communication. Path scheduling reduces the probability of delays by facilitating effective data flow between the source and destination in the HWSN. The NS2 platform is used to implement the proposed LPICR-HWSN protocol. The calculation of the result and comparison analysis is considered for the parameters are Data loss rate, communication time, packet success rate, malicious detection ratio, throughput, Routing overhead and energy efficiency. The results are thoroughly investigated by accounting for factors like the quantity of nodes and the varying speed of the network. To assess the efficacy of this proposed protocol, we conduct a comparative analysis using established methodologies such as CDAS-WSN, EEPC-WSN, TCCS-WSN, and MTODS-HWSN. The results suggest that the proffered LPICR-HWSN model demonstrates superior performance compared to previous methods.

Value of Information-Based Packet Scheduling Scheme for AUV-Assisted UASNs

Value of Information-Based Packet Scheduling Scheme for AUV-Assisted UASNs

Age-Optimal Packet Scheduling With Resource Constraint and Feedback Delay

Age-Optimal Packet Scheduling With Resource Constraint and Feedback Delay

Performance Impact of Nested Congestion Control on Transport-Layer Multipath Tunneling

Multipath wireless access aims to seamlessly aggregate multiple access networks to increase data rates and decrease latency. It is currently being standardized through the ATSSS architectural framework as part of the fifth-generation (5G) cellular networks. However, facilitating efficient multi-access communication in next-generation wireless networks poses several challenges due to the complex interplay between congestion control (CC) and packet scheduling. Given that enhanced ATSSS steering functions for traffic splitting advocate the utilization of multi-access tunnels using congestion-controlled multipath network protocols between user equipment and a proxy, addressing the issue of nested CC becomes imperative. In this paper, we evaluate the impact of such nested congestion control loops on throughput over multi-access tunnels using the recently introduced Multipath DCCP (MP-DCCP) tunneling framework. We evaluate different combinations of endpoint and tunnel CC algorithms, including BBR, BBRv2, CUBIC, and NewReno. Using the Cheapest Path First scheduler, we quantify and analyze the impact of the following on the performance of tunnel-based multipath: (1) the location of the multi-access proxy relative to the user; (2) the bottleneck buffer size, and (3) the choice of the congestion control algorithms. Furthermore, our findings demonstrate the superior performance of BBRv2 as a tunnel CC algorithm.

Near-Optimal Packet Scheduling in Multihop Networks with End-to-End Deadline Constraints

Scheduling packets with end-to-end deadline constraints in multihop networks is an important problem that has been notoriously difficult to tackle. Recently, there has been progress on this problem in the worst-case traffic setting, with the objective of maximizing the number of packets delivered within their deadlines. Specifically, the proposed algorithms were shown to achieve Ω(1/log(L)) fraction of the optimal objective value if the minimum link capacity in the network is C min = Ω(log (L)), where L is the maximum length of a packet's route in the network (which is bounded by the packet's maximum deadline). However, such guarantees can be quite pessimistic due to the strict worst-case traffic assumption and may not accurately reflect real-world settings. In this work, we aim to address this limitation by exploring whether it is possible to design algorithms that achieve a constant fraction of the optimal value while relaxing the worst-case traffic assumption. We provide a positive answer by demonstrating that in stochastic traffic settings, such as i.i.d. packet arrivals, near-optimal, (1-ε)-approximation algorithms can be designed if C min = Ω((over (logL/ε) Ω 2 ). To the best of our knowledge, this is the first result that shows this problem can be solved near-optimally under nontrivial assumptions on traffic and link capacity.

BBR-based and fairness-guaranteed congestion control and packet scheduling for MPQUIC over heterogeneous networks

Multipath QUIC (MPQUIC) enables concurrent transmission over multiple paths, making it attractive to enhance the delivery performance of smartphones with multiple interfaces. Nevertheless, several issues in the current MPQUIC specification remain inadequately addressed. Congestion control in MPQUIC primarily relies on packet loss and favors paths with lower drop rates, which results in significant throughput degradation, especially in heterogeneous wireless networks with frequent random packet loss and varying path characteristics. Additionally, network fairness principles limits its performance, even in scenarios with independent and non-shared bottleneck paths. A final issue is that packet scheduling in dynamic and asymmetric paths poses a significant challenge, potentially causing out-of-order (OFO) arrivals and Head-of-Line (HoL) blocking if not appropriately managed. Inspired by Google’s BBR algorithm, this paper introduces a novel scheme called Shared Bottleneck and BBR-based Congestion Control (S2B2C) to address the above issues. It identifies subsets of subflows that share common bottlenecks within the MPQUIC connection based on the BBR’s internal mechanism. The scheme dynamically adjusts the pacing rate of these subflows to enhance goodput while preserving fairness with legacy single-path flows. Then, to mitigate inter-stream and intra-stream HoL blocking caused by OFO arrivals over asymmetric paths, we present a fine-grained Stream-path-bounded Priority-based Packet Scheduler (S2PS), which includes a stream dependency tree, a priority-based queuing, and a packet scheduling algorithm that uses a mixed-integer program formulation. Experimental results show that S2B2C achieves higher throughput while maintaining bottleneck fairness, and S2PS effectively mitigates HoL blocking with fewer OFO arrivals and shorter flow completion time compared to existing MPQUIC schemes in heterogeneous networks.

Medium access control protocol based on time division multiple access scheme for wireless body area network

In recent years, the demand for wireless body area network (WBAN) technology has increased, driven by advancements in medical and healthcare applications. WBAN consists of small, low-power, and heterogeneous sensor devices attached inside or outside the body for continuous health monitoring. Medium access control (MAC) is pivotal in addressing WBAN challenges by ensuring reliability and energy efficiency under a dynamic environment caused by body movement. Therefore, to tackle these challenges, this paper presents a MAC protocol based on time division multiple access (TDMA) to enhance the WBAN performance. The proposed TDMA-MAC protocol employs a one-periodic scheduled-based access method to provide reliable data transmission while satisfying the WBAN requirements. The proposed protocol is compared to the IEEE 802.15.6 MAC, enhanced packet scheduling algorithm MAC (EPSA-MAC), and concurrent MAC (C-MAC) protocols based on the performance metrics of packet delivery ratio (PDR), network throughput, energy consumption, and average delay. The simulation results show that the TDMA-MAC protocol outperforms its competitors as it could achieve up to 98% PDR, 30% enhanced throughput, 30% energy optimization, and 20% improvement in average delay.

An Energy Efficient and Scalable WSN with Enhanced Data Aggregation Accuracy

This paper introduces a method that combines the K-means clustering genetic algorithm (GA) and Lempel-Ziv-Welch (LZW) compression techniques to enhance the efficiency of data aggregation in wireless sensor networks (WSNs). The main goal of this research is to reduce energy consumption, improve network scalability, and enhance data aggregation accuracy. Additionally, the GA technique is employed to optimize the cluster formation process by selecting the cluster heads, while LZW compresses aggregated data to reduce transmission overhead. To further optimize network traffic, scheduling mechanisms are introduced that contribute to packets being transmitted from sensors to cluster heads. The findings of this study will contribute to advancing packet scheduling mechanisms for data aggregation in WSNs in order to reduce the number of packets from sensors to cluster heads. Simulation results confirm the system's effectiveness compared to other compression methods and non-compression scenarios relied upon in LEACH, M-LEACH, multi-hop LEACH, and sLEACH approaches.

CIPO: Efficient, lightweight and programmable packet scheduling

With the rapid development of network devices and increasingly high CPU workloads, packet scheduling will have to be offloaded to hardware. Programmable packet scheduling allows scheduling algorithms to be programmed into network devices without modifying the hardware. It not only retains the flexibility of software but also the scalability of hardware. In existing primitives, the most expressive Push-In-ExtractOut (PIEO) is prohibitively expensive to implement due to its complexity. While its variant, Push-In-Pick-Out (PIPO), offers some improvements, it suffers from insufficient scalability. In this paper, we propose the Classify-In-Push-Out (CIPO) primitive. The core idea of CIPO is to track the rank and predicate of recent packets through a sliding window, filter and classify packets using a prediction-based two-dimensional classification algorithm and a finite number of First-In-First-Out (FIFO) queues. Through theoretical analysis and evaluation with a range of real workloads, CIPO proves that it has a scheduling performance similar to the most expressive scheduling primitive. Importantly, CIPO requires fewer hardware resources while still providing sufficient expressiveness. Primitive on FPGA show that the CIPO-based scheduler achieves an average of 1.24× higher throughput than the PIEO-based scheduler but uses only an average of 26.2% of look-up tables (LUTs) and 12.2% of the block RAM of the latter.

Advancing 6G-IoT networks: Willow catkin packet transmission scheduling with AI and bayesian game-theoretic approach-based resource allocation.

The rapid expansion of mobile broadband networks and the proliferation of Internet of Things (IoT) applications have substantially increased data transmission and processing demands. However, the application domains of IoT-enabled models often face resource limitations, requiring rapid responses, low latency, and large bandwidth, surpassing their inherent capabilities. To address these challenges, we propose a fishnet approach-based packet scheduling and resource allocation system, termed Fishnet-6G, to optimize network resource allocation in the proposed 6G networks. Initially, we constructed a Sierpinski Triangle-based network in a 6G-IoT environment, enhancing device connectivity. We utilize the Quantum Density Peak Clustering (QDPC) algorithm to perform clustering for IoT devices, establishing Cluster Head (CH) and Substitute CH (SUB CH) based on actual metrics. Furthermore, traffic prediction is achieved through two processes, grouping, and fair queue status, using the Improved Deep Deterministic Policy Gradient (IMPDDPG) algorithm with a variable sampling rate, resulting in well-organized packet scheduling. Subsequently, we perform optimal packet scheduling by employing the Willow Catkin Optimization (WCO) algorithm, and the scheduled packets are managed within a Fishing Net Topology to reduce energy consumption and system complexity. Finally, we allocate the scheduled packets to the desired resource blocks using the Bayesian Game-Theoretic Approach (BGTA). The proposed approach is implemented using Network Simulator-3.26, and the performance of the Fishnet-6G model is evaluated based on time, transmission rate, energy efficiency, average throughput, latency, and Packet loss rate. Numerical analysis demonstrates that Fishnet-6G outperforms existing approaches across these metrics, showcasing its effectiveness in addressing the challenges of 6G-IoT networks.

Traffic Classification and Packet Scheduling Strategy with Deadline Constraints for Input-Queued Switches in Time-Sensitive Networking

Deterministic transmission technology is a core key technology that supports deterministic real-time transmission requirements for industrial control in Time-Sensitive Networking (TSN). It requires each network node to have a deterministic forwarding delay to ensure the real-time end-to-end transmission of critical traffic streams. Therefore, when forwarding data frames, the switch nodes must consider the time-limited requirements of the traffic. In the input-queued switch system, an algorithm for clock-synchronized deterministic network traffic classification scheduling (CSDN-TCS) is proposed to address the issue of whether a higher-quality-of-service (QoS) performance can be provided under packet deadline constraints. First, the scheduling problem of the switch is transformed into a decomposition problem of the traffic matrix. Secondly, the maximum weight-matching algorithm in graph theory is used to solve the matching results slot by slot. By fully utilizing the slot resources, as many packets as possible can be scheduled to be completed before the deadline arrives. For two types of packet scheduling problems, this paper uses the maximum flow algorithm with upper- and lower-bound constraints to move packets from a larger deadline set to idle slots in a smaller deadline set, enabling early transmission, reducing the average packet delay, and increasing system throughput. When there are three or more types of deadlines in the scheduling set, this scheduling problem is an NP-hard problem. We solve this problem by polling the two types of scheduling algorithms. In this paper, simulation experiments based on the switching size and line load are designed, and the Earliest Deadline First (EDF) algorithm and the Flow-Based Iterative Packet Scheduling (FIPS) algorithm are compared with the CSDN-TCS algorithm. The simulation results show that under the same conditions, the CSDN-TCS algorithm proposed in this paper outperforms the other two algorithms in terms of success rate, packet loss rate, average delay and throughput rate. Compared with the FIPS algorithm, the CSDN-TCS algorithm has lower time complexity under the same QoS performance.

4D-MAP: Multipath Adaptive Packet Scheduling for Live Streaming over QUIC

4D-MAP: Multipath Adaptive Packet Scheduling for Live Streaming over QUIC

Low-delay cost-aware multipath scheduling over dynamic links for access traffic steering, switching, and splitting

Bundling of multiple access technologies is currently being standardized by 3GPP in the 5G access traffic steering, switching and splitting (ATSSS) framework, with the goal to increase robustness, resiliency and capacity of wireless access. A key part of an ATSSS framework is the packet scheduler, which decides the access network over which each packet is to be transmitted. As wireless channels are highly dynamic, a challenge for any scheduler is to correctly estimate the capacity of each path, and thereby avoid congesting the paths. In this paper, we further develop a recent packet scheduler that exploits cross-layer information from the congestion control state of individual transport layer tunnels when making scheduling decisions. Our aim is to achieve good path utilization while keeping the congestion delay low. Extensive emulations show that our approach reduces the excess delay at the bottleneck to as little as 34%. We furthermore show that our approach improves the performance of end-to-end applications including WebRTC and YouTube compared to state-of-the art.

A Multi-Channel Packet Scheduling Approach to Improving Video Delivery Performance in Vehicular Networks

When working with the Wireless Access in Vehicular Environment (WAVE) protocol stack, the multi-channel operation mechanism of the IEEE 1609.4 protocol may impact the overall network performance, especially when using video streaming applications. In general, packets delivered from the application layer during a Control Channel (CCH) time slot have to wait for transmission until the next Service Channel (SCH) time slot arrives. The accumulation of packets at the beginning of the latter time slot may introduce additional delays and higher contention when all the network nodes try, at the same time, to obtain access to the shared channel in order to send the delayed packets as soon as possible. In this work, we have analyzed these performance issues and proposed a new method, which we call SkipCCH, that helps the MAC layer to overcome the high contention produced by the packet transmission bursts at the beginning of every SCH slot. This high contention implies an increase in the number of packet losses, which directly impacts the overall network performance. With our proposal, streaming video in vehicular networks will provide a better quality of reconstructed video at the receiver side under the same network conditions. Furthermore, this method has particularly proven its benefits when working with Quality of Service (QoS) techniques, not only by increasing the received video quality but also because it avoids starvation of the lower-priority traffic.

Inversion impact of approximate PIFO to Start-Time Fair Queueing

Programmable packet schedulers have emerged in the context of Software-Defined Networking (SDN) and diverse service requirements in today’s networks. With a programmable packet scheduler, network operators can apply different scheduling algorithms on the switches. To support a large variety of packet scheduling algorithms, the use of a packet scheduler like PIFO (Push-In First-Out) has been adopted, which serves packets based on their associated priority ranks. Recently, for the concern of priority rank scalability and implementation complexity, a new class of packet schedulers that closely approximate PIFO have been proposed. However, the approximate PIFO schemes may lead to a sub-optimal packet scheduling order and introduce packet inversions.In this paper, we evaluate the inversion impact on Start-Time Fair Queueing (STFQ), an efficient approximation of Weighted Fair Queueing to allocate bandwidth fairly and achieve low maximum delay, when it is used in the approximate PIFO schemes. Our analysis validates the deterioration on the performance goals of STFQ attributed to packet inversions and provides a theoretical bound for the discrepancy caused by these inversions in the fair and delay guarantees offered by STFQ. Based on our simulation results, we demonstrate that the packet inversions in approximate PIFO schemes impair the fairness of bandwidth allocation and the worst-case throughput difference in our simulation exhibits a bias of up to 34% of the total available bandwidth. We further show that the packet inversions result in a 3-fold increase in the maximum end-to-end packet delay in approximate PIFO schemes such as SP-PIFO and AFQ.

Packet Scheduling in Multi-Flow Carrier Aggregation with QoS Provisioning: Cross-Layer Design and Performance Analysis

Packet Scheduling in Multi-Flow Carrier Aggregation with QoS Provisioning: Cross-Layer Design and Performance Analysis

Joint Optimization of Packet Scheduling and Energy Harvesting for Energy Conservation in D2D Networks: A Decentralized DRL Approach

Joint Optimization of Packet Scheduling and Energy Harvesting for Energy Conservation in D2D Networks: A Decentralized DRL Approach

Optimizing User-Level Packet Scheduling Performance through Optimal CQI-Based Resource Allocation in LTE

Our research investigates the Dynamic Resource Allocation in the Downlink of OFDMA-based LTE-A networks. It addresses both user-level and system-level packet scheduling performance. At the user-level, a Traffic Differentiator stage segregates packet queues from active users into different service queues based on service types. Users are prioritized within each service queue based on their QoS requirements and wireless channel conditions, utilizing SPSSA. At the system-level, fairness among users is a key consideration. We propose the PITDSA in the TD Scheduler stage, which aims to allocate just enough radio resource to real-time and non-real time services and assign the remaining available resource to background service. In the FD Scheduler stage, we propose an optimal CQI selection algorithm for resource allocation to exploit frequency domain multi-user diversity. We present our simulation results and analyses of all novel algorithms, and the performance of the Optimal CQI selection algorithm is compared with other algorithms. Our proposed scheduling algorithm demonstrates improved QoS for real-time and non-real time services while maintaining a good traded user-level and system-level performance. Future work can focus on optimizing the throughput or the fairness or both, and more advanced and complex techniques can be designed with the same goal.