803 citations · 2.6k across the 256 of their papers we have counts for
262 papers · 1 filter
Minimizing Age of Incorrect Information in Pull-Based Remote Estimation of a Markov Source
Ismail Cosandal, Sennur Ulukus, Nail Akar
In this paper, we consider a discrete-time pull-based remote estimation system involving an information source and a remote monitor where the information source is a finite-state i…
Dynamic Attack Surfaces: A Queue of Branching Processes
Ismail Cosandal, Abdullah Y. Etcibasi, C. Emre Koksal +1
Modern attack surfaces are inherently dynamic. Vulnerabilities emerge over time and they remain exposed to exploit until defenders discover and patch them. Artificial intelligence…
Distribution of Age of Information in the Erlang Loss System
Nail Akar, Sennur Ulukus
In this paper, we study the exact distributions of the age of information (AoI) and peak AoI (PAoI) in a bufferless setting in which time-stamped updates, or processed tasks, gener…
Private Information Retrieval With Arbitrary Privacy Requirements: Introduction and Capacity Results
Mohamed Nomeir, Shreya Meel, Sennur Ulukus
In this paper, we introduce the problem of private information retrieval (PIR) under arbitrary privacy requirements, in a graph-based storage system. This formulation is motivated…
Local Private Information Retrieval for Graph-Based Replicated Systems
Shreya Meel, Mohamed Nomeir, Sennur Ulukus
We rethink the definition of privacy in multi-server, graph-replicated private information retrieval (PIR) systems, by introducing a novel setting where the user's privacy is gover…
Squeezing the Most Out of Preemption for AoI Minimization: Single-source Case
Nail Akar, Mohammad Moltafet, Sennur Ulukus +2
In this work, we study a single-source single-server continuous-time status update system where the updates arrive according to a Poisson process and update service times are gener…
Dual-Regime Absorbing Markov Chain Theory in Remote Estimation: Age-Minimizing Push Policies
Ismail Cosandal, Sennur Ulukus, Nail Akar
For a remote estimation system, we study the optimization of age of incorrect information (AoII), which is a recently proposed semantic-aware information freshness metric. In parti…
When and Which Sensor to Observe? Timely Tracking of a Joint Markov Source
Ismail Cosandal, Sennur Ulukus, Nail Akar
We investigate the problem of remote estimation (at a monitor) of a discrete-time joint Markov process with individual components which can be observed with dedicated sensors. At a…
Preemption Revisited: Multi-Threshold Preemption Policies for AoI Minimization
Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar
The study of optimal preemption policies for status update systems has been a recurring topic in the age of information (AoI) literature, where threshold-based structures have been…
How Far Back in Time a Digital Twin Reflects the State of the Physical Object: Age of Staleness
Ismail Cosandal, Sennur Ulukus
The groundbreaking metric age of information (AoI) has been introduced to measure information freshness in communication networks. As transformational as it is, AoI metric falls sh…
Simultaneously Minimizing Storage and Bandwidth Under Exact Repair With Quantum Entanglement
Lei Hu, Mohamed Nomeir, Alptug Aytekin +1
We study exact-regenerating codes for entanglement-assisted distributed storage systems. Consider an distributed system that stores a file of class…
Private Information Retrieval With Arbitrary Privacy Requirements for Graph-Based Storage
Mohamed Nomeir, Shreya Meel, Sennur Ulukus
We reformulate the definition of privacy in the private information retrieval (PIR) problem to accommodate flexible privacy requirements. We focus on graph-replicated PIR, with a g…
Local Private Information Retrieval: A New Privacy Perspective for Graph-Based Replicated Systems
Shreya Meel, Mohamed Nomeir, Sennur Ulukus
We rethink the definition of privacy in multi-server, graph-replicated private information retrieval (PIR) systems, and introduce a novel setting where the user's privacy is govern…
Age of Gossip in Ring Networks With Non-Poisson Updates
Arunabh Srivastava, Sennur Ulukus
We consider a network consisting of nodes connected in a ring formation and a source that generates updates according to a renewal process and disseminates them to the ring net…
Index-Based Scheduling for a Resource-Constrained Quantum Switch
Subhankar Banerjee, Stavros Mitrolaris, Sennur Ulukus
We consider a quantum switch with a finite number of quantum memory registers that aims to serve multipartite entanglement requests among users. We propose scheduling policies…
The Role of Common Randomness Replication in Symmetric PIR on Graph-Based Replicated Systems
Shreya Meel, Sennur Ulukus
In symmetric private information retrieval (SPIR), a user communicates with multiple servers to retrieve from them a message in a database, while not revealing the message index to…
Preemptive Scheduling for Age of Job Minimization in Task-Specific Machine Networks
Subhankar Banerjee, Sennur Ulukus
We consider a time-slotted job-assignment system consisting of a central server, task-specific networks of machines, and multiple users. Each network specializes in executing a…
Beyond Martingale Estimators: Structured Estimators for Maximizing Information Freshness in Query-Based Update Systems
Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar
This paper investigates information freshness in a remote estimation system in which the remote information source is a continuous-time Markov chain (CTMC). For such systems, estim…
Multi-Stage Structured Estimators for Information Freshness
Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar
Most of the contemporary literature on information freshness solely focuses on the analysis of freshness for martingale estimators, which simply use the most recently received upda…
Age-Based Scheduling for a Memory-Constrained Quantum Switch
Stavros Mitrolaris, Subhankar Banerjee, Sennur Ulukus
In a time-slotted system, we study the problem of scheduling multipartite entanglement requests in a quantum switch with a finite number of quantum memory registers. Specifically,…
Convergence Properties of Good Quantum Codes for Classical Communication
Alptug Aytekin, Mohamed Nomeir, Lei Hu +1
An important part of the information theory folklore had been about the output statistics of codes that achieve the capacity and how the empirical distributions compare to the outp…
Breaking the Storage-Bandwidth Tradeoff in Distributed Storage with Quantum Entanglement
Lei Hu, Mohamed Nomeir, Alptug Aytekin +1
This work investigates the use of quantum resources in distributed storage systems. Consider an distributed storage system in which a file is stored across nodes such…
On the Capacity Region of Individual Key Rates in Vector Linear Secure Aggregation
Lei Hu, Sennur Ulukus
We provide new insights into an open problem recently posed by Yuan-Sun [ISIT 2025], concerning the minimum individual key rate required in the vector linear secure aggregation pro…
Storage-Rate Trade-off in A-XPIR
Mohamed Nomeir, Sennur Ulukus
We consider the storage problem in an asymmetric -secure private information retrieval (A-XPIR) setting. The A-XPIR setting considers the -secure PIR problem (XPIR) when a gi…