Cover Image

Scheduling Policies in a Multi-Source Status Update System with Dedicated and Shared Servers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liyanaarachchi, Sahan, Ulukus, Sennur, Akar, Nail
Format:	Preprint
Published:	2024
Subjects:	Information Theory Networking and Internet Architecture Systems and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Minimizing the Age of Two Heterogeneous Sources With Packet Drops Via Cyclic Schedulers
by: Liyanaarachchi, Sahan, et al.
Published: (2024)

Preemption Revisited: Multi-Threshold Preemption Policies for AoI Minimization
by: Liyanaarachchi, Sahan, et al.
Published: (2026)

Cyclic Scheduler Design for Minimizing Age of Information in Massive Scale Networks Susceptible to Packet Errors
by: Liyanaarachchi, Sahan, et al.
Published: (2024)

Scalable Cyclic Schedulers for Age of Information Optimization in Large-Scale Status Update Systems
by: Akar, Nail, et al.
Published: (2024)

Age of Information in a Single-Source Generate-at-Will Dual-Server Status Update System
by: Akar, Nail, et al.
Published: (2024)

Multi-Threshold AoII-Optimum Sampling Policies for CTMC Information Sources
by: Cosandal, Ismail, et al.
Published: (2024)

Which Sensor to Observe? Timely Tracking of a Joint Markov Source with Model Predictive Control
by: Cosandal, Ismail, et al.
Published: (2025)

Minimizing Age of Information with Generate at Will Status Updates and Age-Agnostic Cyclic Scheduling
by: Gamgam, Ege Orkun, et al.
Published: (2023)

Utilizing the Perceived Age to Maximize Freshness in Query-Based Update Systems
by: Liyanaarachchi, Sahan, et al.
Published: (2026)

Beyond Martingale Estimators: Structured Estimators for Maximizing Information Freshness in Query-Based Update Systems
by: Liyanaarachchi, Sahan, et al.
Published: (2026)

Modeling AoII in Push- and Pull-Based Sampling of Continuous Time Markov Chains
by: Cosandal, Ismail, et al.
Published: (2024)

How to Maximize Efficiency in Systems with Exhausted Workers
by: Sariisik, Elif Beray, et al.
Published: (2025)

Joint Age-State Belief is All You Need: Minimizing AoII via Pull-Based Remote Estimation
by: Cosandal, Ismail, et al.
Published: (2024)

Modeling Interfering Sources in Shared Queues for Timely Computations in Edge Computing Systems
by: Akar, Nail, et al.
Published: (2024)

When to Preempt in a Status Update System?
by: Banerjee, Subhankar, et al.
Published: (2024)

Query-Based Sampling of Heterogeneous CTMCs: Modeling and Optimization with Binary Freshness
by: Akar, Nail, et al.
Published: (2023)

Preemptive Scheduling for Age of Job Minimization in Task-Specific Machine Networks
by: Banerjee, Subhankar, et al.
Published: (2026)

Index-Based Scheduling for a Resource-Constrained Quantum Switch
by: Banerjee, Subhankar, et al.
Published: (2026)

Age-Based Scheduling for a Memory-Constrained Quantum Switch
by: Mitrolaris, Stavros, et al.
Published: (2026)

Structured Estimators: A New Perspective on Information Freshness
by: Liyanaarachchi, Sahan, et al.
Published: (2025)

Tracking and Assigning Jobs to a Markov Machine
by: Banerjee, Subhankar, et al.
Published: (2025)

Equidistant-Sample or Wait-and-Sample to Minimize Age Under Sampling Constraint?
by: Banerjee, Subhankar, et al.
Published: (2025)

6G at $\frac{1}{6}g$: The Future of Cislunar Communications
by: Liyanaarachchi, Sahan, et al.
Published: (2024)

Age of Gossip in Networks with Multiple Views of a Source
by: Khojastepour, Kian J., et al.
Published: (2024)

Age of Estimates: When to Submit Jobs to a Markov Machine to Maximize Revenue
by: Liyanaarachchi, Sahan, et al.
Published: (2025)

Optimum Monitoring and Job Assignment with Multiple Markov Machines
by: Liyanaarachchi, Sahan, et al.
Published: (2025)

Age of Job Completion Minimization with Stable Queues
by: Mitrolaris, Stavros, et al.
Published: (2025)

Source Coding for a Wiener Process
by: Liyanaarachchi, Sahan, et al.
Published: (2025)

Fully Decentralized Task Offloading in Multi-Access Edge Computing Systems
by: Aggarwal, Shubham, et al.
Published: (2024)

Multi-Stage Structured Estimators for Information Freshness
by: Liyanaarachchi, Sahan, et al.
Published: (2026)

Age of Gossip in Ring Networks With Non-Poisson Updates
by: Srivastava, Arunabh, et al.
Published: (2026)

Optimal Sampling and Actuation Policies of a Markov Source over a Wireless Channel
by: Salimnejad, Mehrdad, et al.
Published: (2026)

The Capacity of Semantic Private Information Retrieval with Colluding Servers
by: Nomeir, Mohamed, et al.
Published: (2025)

Goal-oriented Estimation of Multiple Markov Sources in Resource-constrained Systems
by: Luo, Jiping, et al.
Published: (2023)

Scale-Robust Timely Asynchronous Decentralized Learning
by: Mitra, Purbesh, et al.
Published: (2024)

Optimizing Version Innovation Age for Monitoring Markovian Source in Energy-Harvesting Systems
by: Salimnejad, Mehrdad, et al.
Published: (2024)

AoII-Optimum Sampling of CTMC Information Sources Under Sampling Rate Constraints
by: Cosandal, Ismail, et al.
Published: (2024)

How Far Back in Time a Digital Twin Reflects the State of the Physical Object: Age of Staleness
by: Cosandal, Ismail, et al.
Published: (2026)

Network Connectivity--Information Freshness Tradeoff in Information Dissemination Over Networks
by: Srivastava, Arunabh, et al.
Published: (2024)

Information Degradation and Misinformation in Gossip Networks
by: Maranzatto, Thomas Jacob, et al.
Published: (2025)