Ege Orkun Gamgam
Research Subjects
Ege Orkun Gamgam has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Nail Akar
Electrical and Electronics Engineering Department, Bilkent University, Bilkent, Ankara, Trkiye
4 shared publications - Caglar Tunc
Department of Electrical and Computer Engineering, New York University Tandon School of Engineering, Brooklyn, NY, USA
1 shared publication
Latest Publications
- 9 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (5) , 8961-8972
Water-Filling-Based Scheduling for Weighted Binary Freshness in Cache Update Systems
We consider a cache update system with a remote server delivering time-varying contents of multiple Internet of Things (IoT) items with heterogeneous popularities and service times to a local cache so as to keep the items as fresh as possible at the cache. New content for an item arrives at the server according to a Poisson process and the server is equipped with multiple queues each of which holds the most up-to-date content for the corresponding item. In this setting, we study several scheduling policies employed at the server so as to maximize the popularity-weighted binary freshness across the items. The scheduling problem is first formulated as an infinite-horizon average-reward Markov Decision Process (MDP) which suffers from the curse of dimensionality when the number of items is large. We then propose a Water-Filling based Scheduling (WFS) policy and its extension, namely Extended WFS (E-WFS) policy, with worst-case complexities being quadratic and cubic in the number of items, respectively, based on convex optimization applied to a relaxation of the original system. Simulation results are provided to validate the effectiveness of the proposed policies.
- 9 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (5) , 8961-8972
Water-Filling-Based Scheduling for Weighted Binary Freshness in Cache Update Systems
We consider a cache update system with a remote server delivering time-varying contents of multiple Internet of Things (IoT) items with heterogeneous popularities and service times to a local cache so as to keep the items as fresh as possible at the cache. New content for an item arrives at the server according to a Poisson process and the server is equipped with multiple queues each of which holds the most up-to-date content for the corresponding item. In this setting, we study several scheduling policies employed at the server so as to maximize the popularity-weighted binary freshness across the items. The scheduling problem is first formulated as an infinite-horizon average-reward Markov Decision Process (MDP) which suffers from the curse of dimensionality when the number of items is large. We then propose a Water-Filling based Scheduling (WFS) policy and its extension, namely Extended WFS (E-WFS) policy, with worst-case complexities being quadratic and cubic in the number of items, respectively, based on convex optimization applied to a relaxation of the original system. Simulation results are provided to validate the effectiveness of the proposed policies.
- 31 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (8) , 2024-2028
Distribution of Age of Information in Status Update Systems With Heterogeneous Information Sources: An Absorbing Markov Chain-Based Approach
In this letter, we obtain the exact distributions of the Age of Information (AoI) and Peak AoI (PAoI) in a non-preemptive multi-source status update system for (i) Generate-At-Will (GAW) servers with probabilistic transmissions (ii) Random Arrival with Single Buffer (RA-SB) servers employing probabilistic buffer management, using absorbing Continuous-Time Markov Chains (CTMC). For both servers, the information sources are allowed to have different relative urgencies, phase-type service time distributions, and transmission error probabilities, for the sake of generality. Numerical examples are presented to validate the proposed analytical model.
- 31 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (8) , 2024-2028
Distribution of Age of Information in Status Update Systems With Heterogeneous Information Sources: An Absorbing Markov Chain-Based Approach
In this letter, we obtain the exact distributions of the Age of Information (AoI) and Peak AoI (PAoI) in a non-preemptive multi-source status update system for (i) Generate-At-Will (GAW) servers with probabilistic transmissions (ii) Random Arrival with Single Buffer (RA-SB) servers employing probabilistic buffer management, using absorbing Continuous-Time Markov Chains (CTMC). For both servers, the information sources are allowed to have different relative urgencies, phase-type service time distributions, and transmission error probabilities, for the sake of generality. Numerical examples are presented to validate the proposed analytical model.
- 27 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (20) , 20706-20718
Exact Analytical Model of Age of Information in Multi-Source Status Update Systems With Per-Source Queueing
We study a multi-source status update system with Poisson information packet arrivals and exponentially distributed service times. The server is equipped with a waiting room holding the freshest packet from each source referred to as Single Buffer Per-Source Queueing (SBPSQ). The sources are assumed to be equally important, i.e., (non-weighted) average AoI or average age violation probability are used as the information freshness metrics to optimize for, and subsequently, two symmetric SBPSQ-based scheduling policies are studied in this paper, namely First Source First Serve (FSFS) and the Earliest Served First Serve (ESFS) policies. By employing the theory of Markov Fluid Queues (MFQ), an analytical model is proposed to obtain the exact distribution of the Age of Information (AoI) for each source when the FSFS and ESFS policies are employed at the server. Additionally, a benchmark scheduling-free scheme named as Single Buffer with Replacement (SBR) that uses a single buffer to hold the freshest packet across all sources, is also studied with a similar but less complex analytical model. We comparatively study the performance of the three policies through numerical examples in terms of the average AoI and the age violation probability averaged across all sources, in a scenario of sources possessing different traffic intensities but sharing a common service time.
- 27 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (20) , 20706-20718
Exact Analytical Model of Age of Information in Multi-Source Status Update Systems With Per-Source Queueing
We study a multi-source status update system with Poisson information packet arrivals and exponentially distributed service times. The server is equipped with a waiting room holding the freshest packet from each source referred to as Single Buffer Per-Source Queueing (SBPSQ). The sources are assumed to be equally important, i.e., (non-weighted) average AoI or average age violation probability are used as the information freshness metrics to optimize for, and subsequently, two symmetric SBPSQ-based scheduling policies are studied in this paper, namely First Source First Serve (FSFS) and the Earliest Served First Serve (ESFS) policies. By employing the theory of Markov Fluid Queues (MFQ), an analytical model is proposed to obtain the exact distribution of the Age of Information (AoI) for each source when the FSFS and ESFS policies are employed at the server. Additionally, a benchmark scheduling-free scheme named as Single Buffer with Replacement (SBR) that uses a single buffer to hold the freshest packet across all sources, is also studied with a similar but less complex analytical model. We comparatively study the performance of the three policies through numerical examples in terms of the average AoI and the age violation probability averaged across all sources, in a scenario of sources possessing different traffic intensities but sharing a common service time.
- 5 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 67 (5) , 3431-3442
On the Queuing Model of the Energy-Delay Tradeoff in Wireless Links With Power Control and Link Adaptation
- 5 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 67 (5) , 3431-3442
On the Queuing Model of the Energy-Delay Tradeoff in Wireless Links With Power Control and Link Adaptation