English
Related papers

Related papers: Multi-Source M/G/1/1 Queues with Probabilistic Pre…

200 papers

In this paper, we consider a point-to-point wireless communication system. The source monitors a physical process and generates status update packets according to a Poisson process. The packets are transmitted to the destination by using…

Signal Processing · Electrical Eng. & Systems 2019-08-20 Rui Wang , Yifan Gu , He Chen , Yonghui Li , Branka Vucetic

In this paper, we examine the Age of Information (AoI) of a source sending status updates to a monitor through a queue operating under the Processor Sharing (PS) discipline. In the PS queueing discipline, all the updates are served…

Information Theory · Computer Science 2023-09-06 Beñat Gandarias , Josu Doncel , Mohamad Assaad

A source submits status updates to a network for delivery to a destination monitor. Updates follow a route through a series of network nodes. Each node is a last-come-first-served queue supporting preemption in service. We characterize the…

Information Theory · Computer Science 2018-03-22 Roy D. Yates

A large body of applications that involve monitoring, decision making, and forecasting require timely status updates for their efficient operation. Age of Information (AoI) is a newly proposed metric that effectively captures this…

Information Theory · Computer Science 2018-10-09 George Stamatakis , Nikolaos Pappas , Apostolos Traganitis

Age of Information (AoI) has emerged as an important quality-of-service measure for applications that prioritize delivery of the freshest information, e.g., virtual or augmented reality over mobile devices and wireless sensor networks used…

Performance · Computer Science 2021-10-19 George Kesidis , Takis Konstantopoulos , Michael A. Zazanis

Information updates in multihop networks such as Internet of Things (IoT) and intelligent transportation systems have received significant recent attention. In this paper, we minimize the age of a single information flow in…

Information Theory · Computer Science 2019-05-09 Ahmed M. Bedewy , Yin Sun , Ness B. Shroff

A status updating system is considered in which multiple data sources generate packets to be delivered to a destination through a shared energy harvesting sensor. Only one source's data, when available, can be transmitted by the sensor at a…

Information Theory · Computer Science 2021-09-16 Christopher Daniel , Ahmed Arafa

Multiple sources submit updates to a monitor through an M/M/1 queue. A stochastic hybrid system (SHS) approach is used to derive the average age of information (AoI) for an individual source as a function of the offered load of that source…

Information Theory · Computer Science 2020-02-10 Sanjit K. Kaul , Roy D. Yates

We consider a time-slotted status update system with an error-free preemptive queue. The goal of the sampler-scheduler pair is to minimize the age of information at the monitor by sampling and transmitting the freshly sampled update packets…

Information Theory · Computer Science 2024-05-21 Subhankar Banerjee , Sennur Ulukus

Information freshness in IoT-based status update systems has recently been studied through the Age of Information (AoI) and Peak AoI (PAoI) performance metrics. In this paper, we study a discrete-time server arising in multi-source IoT…

Performance · Computer Science 2023-10-05 Nail Akar , Ozancan Dogan

This paper considers a communication system where a source sends time-sensitive information to its destination via queues in tandem. We assume that the arrival process as well as the service process (of each server) are memoryless, and each…

Information Theory · Computer Science 2024-05-07 Ashirwad Sinha , Shubhransh Singhvi , Praful D. Mankar , Harpreet S. Dhillon

Many systems necessitate frequent and consistent updates of a specific information. Often this information is updated regularly, where an old packet becomes completely obsolete in the presence of a new packet. In this context, we consider a…

Information Theory · Computer Science 2023-10-04 Shiksha Singhal , Veeraruna Kavitha , Vidya Shankar

This paper investigates the capacity of a channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly…

Information Theory · Computer Science 2018-03-06 Mehrnaz Tavan , Roy D. Yates , Waheed U. Bajwa

We consider a general queueing system with price-sensitive customers in which the service provider seeks to balance two objectives, maximizing the average revenue rate and minimizing the average queue length. Customers arrive according to a…

Data Structures and Algorithms · Computer Science 2025-12-09 Jacob Bergquist , Adam N. Elmachtoub

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 shown to be optimal under a generate-at-will update…

Information Theory · Computer Science 2026-05-18 Sahan Liyanaarachchi , Sennur Ulukus , Nail Akar

In this work, we investigate information freshness in a status update communication system consisting of a source-destination link. Initially, we study the properties of a sample path of the age of information (AoI) process at the…

Networking and Internet Architecture · Computer Science 2020-12-22 Antzela Kosta , Nikolaos Pappas , Anthony Ephremides , Vangelis Angelakis

The freshness of information in real-time monitoring systems has received increasing attention, with Age of Information (AoI) emerging as a novel metric for measuring information freshness. In many applications, update packets need to be…

Information Theory · Computer Science 2024-04-04 Jianhang Zhu , Jie Gong

Age of information (AoI) is an effective performance metric measuring the freshness of information and is popular for applications involving status update. Most of the existing works have adopted average AoI as the metric, which cannot…

Information Theory · Computer Science 2022-06-10 Guan-Yu Lin , Yu-Chih Huang , Yu-Pin Hsu

Two independent Poisson streams of jobs flow into a single-server service system having a limited common buffer that can hold at most one job. If a type-i job (i=1,2) finds the server busy, it is blocked and routed to a separate type-i…

Discrete Mathematics · Computer Science 2012-06-26 Konstantin Avrachenkov , Philippe Nain , Uri Yechiali

In this paper, we consider performing packet managements in discrete time status updating system, focusing on determining the stationary AoI-distribution of the system. Firstly, let the queue model be Ber/G/1/1, we obtain the…

Information Theory · Computer Science 2022-04-29 Jixiang Zhang