NANail Akar

Nail Akar

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Nail Akar has a total of 61 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Absorbing Markov Chain-Based Analysis of Age of Information in Discrete-Time Dual-Queue Systems

    by Yifan Feng, Nail Akar, Zhengchuan Chen, Mehul Motani

    Status update systems require the timely collection of sensing information for which deploying multiple sensors/servers to obtain diversity gains is considered as a promising solution. In this work, we construct an absorbing Markov chain (AMC) to exactly model Age of Information (AoI) in a discrete-time dual-queue (DTDQ) status update system with generate-at-will (GAW) status updates, discrete phase-type (DPH-type) distributed service times and transmission freezing. Specifically, transmission is frozen for a certain number of slots following the initiation of a transmission, after which one of the two servers is allowed to simultaneously sample the monitored physical process and transmit a status update packet, according to the availabilities and priorities of the two servers. Based on the discrete-time AMC, we provide the exact distributions of both AoI and peak AoI (PAoI), enabling the derivation of arbitrary order moments. In addition, we analytically study the role of freezing using several typical service time distributions, including geometric, uniform, negative binomial, and triangular distributions. The introduction of freezing for DTDQ systems is demonstrated to be significantly beneficial in reducing the mean AoI for various service time distributions. Additionally, we study the impact of the statistical parameters of the service times and heterogeneity between the two servers on the freezing gain, i.e., reduction in mean AoI attained with optimum freezing policies.


  • Open Access

    Absorbing Markov Chain-Based Analysis of Age of Information in Discrete-Time Dual-Queue Systems

    by Yifan Feng, Nail Akar, Zhengchuan Chen, Mehul Motani

    Status update systems require the timely collection of sensing information for which deploying multiple sensors/servers to obtain diversity gains is considered as a promising solution. In this work, we construct an absorbing Markov chain (AMC) to exactly model Age of Information (AoI) in a discretetime dual-queue (DTDQ) status update system with generate at will (GAW) status updates, discrete phase-type (DPH-type) distributed service times and transmission freezing. Specifically, transmission is frozen for a certain number of slots following the initiation of a transmission, after which one of the two servers is allowed to simultaneously sample the monitored physical process and transmit a status update packet, according to the availabilities and priorities of the two servers. Based on the discrete-time AMC, we provide the exact distributions of both AoI and peak AoI (PAoI), enabling the derivation of arbitrary order moments. In addition, we analytically study the role of freezing using several typical service time distributions, including geometric, uniform, and triangular distributions. The introduction of freezing for DTDQ systems is demonstrated to be significantly beneficial in reducing the mean AoI for various service time distributions. Additionally, we study the impact of the statistical parameters of the service times and heterogeneity between the two servers on the freezing gain, i.e., reduction in mean AoI attained with optimum freezing policies.

  • Minimizing Age of Information and Its Peak: Finding Cyclic Schedules With Deletion Search

    by Ege Orkun Gamgam, Nail Akar, Sennur Ulukus

    We study the scheduling problem for a multi-source single-server generate-at-will (GAW) status update system with sources having heterogeneous service times and weights, for which the goal is to minimize the system age of information (AoI), or system peak AoI (PAoI), by employing scheduling algorithms with low runtime complexity. Here, system AoI/PAoI refers to weighted sum of the average AoI/PAoI values of information sources. In particular, we focus on open-loop cyclic schedulers with O(1) runtime complexity, where status updates are scheduled according to a fixed finite transmission pattern whose construction is the main scope of this paper. We first develop an analytical method to obtain the exact average AoI/PAoI of the sources when a transmission pattern is given. Subsequently, we derive the optimum transmission pattern for system AoI in closed form, for the specific case of two sources. For general number of sources, a novel method is proposed based on a deletion search (DS) based algorithm which constructs a pattern whose system PAoI can be brought arbitrarily close to the minimum system PAoI that is attainable using open-loop scheduling. Using another outcome of the same DS-based algorithm, a heuristic scheduler is proposed for system AoI minimization, which is shown to outperform various existing age-agnostic schedulers in the literature, including the insertion search (IS) based algorithm, in the majority of the examples we studied.


  • Multi-Threshold AoII-Optimum Sampling Policies for Continuous-Time Markov Chain Information Sources

    by Ismail Cosandal, Nail Akar, Sennur Ulukus

    We study push-based sampling and transmission policies for a status update system consisting of a general finite-state continuous-time Markov chain (CTMC) information source with known dynamics, with the goal of minimizing the average age of incorrect information (AoII) defined via a linear time penalty function. The problem setting we investigate involves an exponentially distributed delay channel for transmissions and a constraint on the average sampling rate. We first show that the optimum sampling and transmission policy is a multi-threshold policy, where the thresholds depend on both the estimation value and the state of the original process, and sampling and transmission need to be initiated when the instantaneous AoII exceeds the corresponding threshold, called the estimation- and state-aware transmission (ESAT) policy. Subsequently, we formulate the problem of finding the thresholds as a constrained semi-Markov decision process (CSMDP) and the Lagrangian approach. Additionally, we propose two lower complexity sub-optimum policies, namely the estimation-aware transmission (EAT) policy, and the single-threshold (ST) policy, for which it is possible to obtain these thresholds for CTMCs with relatively larger number of states. The underlying CSMDP formulation relies on the multi-regime phase-type (MR-PH) distribution which is a generalization of the well-known phase-type distribution, which allows us to obtain the first two moments of time until absorption in a CTMC whose transition rates change with respect to time, in a piece-wise manner. The effectiveness of the proposed ESAT, EAT, and ST sampling and transmission policies are shown through numerical examples, along with comparisons with a baseline scheme that transmits packets according to a Poisson process in out-of-sync periods.


  • Age of Information Analysis of Ber/Geo/1/1 Queue With On-Off Service

    by Hao Zeng, Yi Qu, Zhengchuan Chen, Nail Akar, Min Wang, Dapeng O. Wu, Tony Q. S. Quek

    The Age of Information (AoI), which measures the time since the generation of the latest update, quantifies information freshness in timeliness-critical systems. Minimizing AoI and characterizing it precisely are crucial for system efficiency and decision-making. This work investigates AoI under external interference modeled as an On-Off process, providing a foundation for future research in more complex scenarios. We consider a discrete-time remote status-updating system with a monitor and a sensor, where the sensor observes a physical process, generates timestamped updates, and sends them to the monitor. Both interarrival and service times follow geometric distributions, with service interrupted according to a two-state On-Off process. We analyze AoI under two queuing disciplines: 1) nonpreemptive, where arriving updates are discarded if the server is occupied, and 2) preemptive, where in-service updates are replaced with new ones during the Off state. For both, we derive closed-form expressions for average AoI and peak AoI (PAoI). We also explore the relationship between discrete-time and continuous-time systems, showing that the latter is the limiting case of the former. Numerical results validate the theoretical analysis, revealing a linear relationship between the relative normalized increase in average PAoI and AoI and the proportion of Off state time. Frequent On-Off switching and higher service rates under the same system load help mitigate freshness deterioration caused by interruptions. The On-Off process is shown to have a large impact on the average AoI (resp. PAoI) of systems with relatively high (resp. low) arrival and service rates.


  • Scheduling Policies in a Multisource Status Update System With Dedicated and Shared Servers

    by Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar

    Use of multi-path network topologies has become a prominent technique to assert timeliness in terms of age of information (AoI) and to improve resilience to link disruptions in communication systems. However, establishing multiple dedicated communication links among network nodes is a costly endeavor. Therefore, quite often, these secondary communication links are shared among multiple entities. Moreover, these multi-path networks come with the added challenge of out-of-order transmissions. In this paper, we study an amalgamation of the above two aspects, i.e., multi-path transmissions and link sharing. In contrast to the existing literature where the main focus has been scheduling multiple sources on a single shared server, we delve into the realm where each source sharing the shared server is also supplemented with its dedicated server so as to improve its timeliness. In this multi-path link sharing setting with generate-at-will transmissions, we first present the optimal probabilistic scheduler, and then propose several heuristic-based cyclic scheduling algorithms for the shared server, to minimize the weighted average age of information of the sources.


  • Cyclic Scheduler Design for Minimizing Age of Information in Massive Scale Networks Susceptible to Packet Errors

    by Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar

    In multi-source status update systems, sources need to be scheduled appropriately to maintain timely communication between each of the sources and the monitor. A cyclic schedule is an age-agnostic schedule in which the sources are served according to a fixed finite transmission pattern, which upon completion, repeats itself. Such a scheme has a low $O(1)$ runtime complexity, which is desirable in large networks. This paper’s focus is on designing transmission patterns so as to be used in massive scale networking scenarios involving a very large number of sources, e.g., up to thousands of IoT sources, with service time requirements and weights being heterogeneous in nature. The goal is to minimize the weighted sum age of information (AoI), called weighted AoI, when transmitting users’ packets over a channel susceptible to heterogeneous packet errors. The main tool we use is a stochastic modeling framework using either Markov chains (MC) or moment generating functions (MGF), by which we obtain the weighted AoI for a given transmission pattern, which is not straightforward in the presence of packet drops. Using this framework, we provide a lower bound on the weighted AoI for the particular case of two sources, and also an algorithm to attain this lower bound. Then, by using the same framework, we design a cyclic scheduler for general number of sources with reasonable complexity using convex optimization and well-established packet spreading algorithms, and comparatively evaluate the proposed algorithm and existing age-agnostic scheduling schemes for general number of sources (resp. two sources) when the lower bound is not available (resp. when it is available). We present extensive numerical results also involving comparisons with age-aware scheduling to validate the effectiveness of the proposed approach.


  • Age of Information in a Single-Source Generate-at-Will Dual-Server Status Update System

    by Nail Akar, Sennur Ulukus

    We study age of information (AoI) in a single-source dual-server continuous-time status update system for the generate-at-will (GAW) scenario, consisting of an information source, two heterogeneous servers, and a monitor (or destination). The technique of stochastic hybrid systems (SHS) has recently been used to obtain the average (or mean) AoI for a work-conserving (WC) zero wait (ZW) system imposed on the Non-parallel Transmission with Monitor Discarding (NT-MD) policy for which out-of-order packets are discarded upon reception by the monitor, for the case of exponentially distributed service times. In this paper, we exactly obtain the distributions (not only the means) of AoI and peak AoI (PAoI) processes for the NT-MD policy, in a more general setting with continuous phase-type distributed service times, by making use of the absorbing Markov chain (AMC) method, which was specifically developed for exact AoI modeling. Additionally, two Parallel Transmission (PT) policies resulting from either monitor discarding (PT-MD), or Source Preemption (PT-SP), are proposed and studied which allows us to comparatively evaluate these policies as a function of certain parameters of the service times. We also propose a non-work-conserving (NWC) NT policy with Freezing and source preemption, called NTF-SP, for which the transmission process is frozen for a certain amount of time upon each transmission, and we comparatively study NTF-SP against its NT-MD counterpart, for exponentially distributed and also deterministic service times. Numerical results are presented for the validation of the proposed analytical models and a comparative evaluation of the four transmission policies in terms of mean AoI.