Browsing by Subject "Queue management"

Now showing 1 - 2 of 2

Open Access
Queue management for two-user cognitive radio with delay-constrained primary user
(Elsevier, 2018) Mehr, K. A.; Niya, J. M.; Akar, Nail
In this paper, two novel Queue Management Policies (QMP) are proposed for Quality of Service (QoS) enhancement of a two-user Cognitive Radio Network (CRN) comprising a Primary User (PU) and Secondary User (SU), the latter having non-causal information on PU's messages (or packets). Specifically, we aim to maximize the throughput of the SU while satisfying the delay criterion of the Primary User (PU). The first proposed QMP is a hybrid interweave/overlay scheme where all the SU's resources are devoted to the transmission of PU's packets. The second proposed QMP adaptively uses all or some of the SU's resources towards the transmission of the PU's packet, this decision being based on the packet's delay experienced in the PU queue. For this adaptive QMP, a novel multi-regime Markov fluid queue model is proposed via which closed-form expressions are derived and validated for the exact delay distribution for Poisson PU traffic and exponentially distributed packet lengths. Using this analytical tool, we optimally tune the parameters of the adaptive QMP and we show through numerical examples that it consistently outperforms the hybrid interweave/overlay model as well as two other conventional schemes in terms of SU throughput. We also show that the performance improvement attainable by the proposed QMP depends on the intensity of PU traffic as well as the channel conditions. A heuristic suboptimal parameter tuning scheme is also proposed with lesser computational complexity.
Open Access
Scheduling and queue management for information freshness in multi-source status update systems
(2023-09) Gamgam, Ege Orkun
Timely delivery of information to its intended destination is essential in many ex-isting and emerging time-sensitive applications. While conventional performance metrics like delay, throughput, or loss have been extensively studied in the literature, research concerning the management of age-sensitive traffic is relatively immature. Recently, a number of information freshness metrics have been intro-duced for quantifying the timeliness of information in networked systems carrying age-sensitive traffic, primarily the Age of Information (AoI) and peak AoI (PAoI) metrics as well as their alternatives including Age of Synchronization (AoS), ver-sion age, binary freshness, etc. The focus of this thesis is the development and performance modeling of age-agnostic scheduling and queue management policies in various multi-source status update systems carrying age-sensitive traffic, using the recently introduced information freshness metrics. In this thesis, first, the exact distributions of the AoI and PAoI for the probabilistic Generate-At-Will (GAW) and Random Arrival with Single Buffer (RA-SB) servers are studied with general number of heterogeneous information sources with phase-type (PH-type) service time distributions for which an absorbing Continuous-Time Markov Chains (CTMC) based analytical modeling method, namely AMC (Absorbing Markov Chains) method, is proposed. Secondly, a homogeneous multi-source status update system with Poisson information packet arrivals and exponentially distributed service times is studied for which the server is equipped with a queue holding the freshest packet from each source referred to as Single Buffer Per-Source Queueing (SBPSQ). For this case, two SBPSQ-based scheduling policies are studied, namely First Source First Serve (FSFS) and the Earliest Served First Serve (ESFS) policies, using the AMC method, and it is shown that ESFS presents a promising scheduler for this special setting. Third, a general status update system with two heterogeneous information sources is studied, i.e., sources have different priorities and generally distributed service times, for Deterministic GAW (D-GAW) and Deterministic RA-SB (D-RA-SB) servers. The aim in both servers is to minimize the system AoI/AoS that is time-averaged and weighted across the two sources. For the D-GAW server, the optimal update policy is obtained in closed form. A packet replacement policy, referred to as Pattern-based Replacement (PR) policy, is then proposed for the D-RA-SB server based on the optimal policy structure of the D-GAW server. Finally, scheduling in a cache update system is investigated where a remote server delivers time-varying contents of multiple items with heterogeneous popularities and service times to a local cache so as to maximize the weighted sum binary freshness of the system, and the server is equipped with a queue that holds the most up-to-date content for each item. A Water-filling based Scheduling (WFS) policy and its extension, namely Extended WFS (E-WFS) policy, are proposed based on convex optimization applied to a relaxation of the original system, with low computational complexity and near optimal weighted sum binary freshness performance.