English
Related papers

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

200 papers

In this work, we investigate the design of information-update systems, where incoming update packets are forwarded to a remote destination through multiple servers (each server can be viewed as a wireless channel). One important performance…

Information Theory · Computer Science 2017-03-31 Ahmed M. Bedewy , Yin Sun , Ness B. Shroff

In this research, we study the information freshness in M/G/1 queueing system with a single buffer and the server taking multiple vacations. This system has wide applications in communication systems. We aim to evaluate the information…

Performance · Computer Science 2021-12-24 Jin Xu , I-Hong Hou , Natarajan Gautam

Many systems require frequent and regular updates of a certain information. These updates have to be transferred regularly from the source to the destination. We consider scenarios in which an old packet becomes completely obsolete, in the…

Networking and Internet Architecture · Computer Science 2018-07-26 Veeraruna Kavitha , Eitan Altman , Indrajit Saha

In this paper, we study an age of information minimization problem in continuous-time and discrete-time status updating systems that involve multiple packet flows, multiple servers, and transmission errors. Four scheduling policies are…

Networking and Internet Architecture · Computer Science 2023-10-04 Yin Sun , Sastry Kompella

In this paper, we consider a scenario where a source continuously monitors an object and sends time-stamped status updates to a destination through a rate-limited link. We assume updates arrive randomly at the source according to a…

Information Theory · Computer Science 2019-05-14 Boyu Wang , Songtao Feng , Jing Yang

We study peak Age of Information (PAoI) violation guarantee in a periodic multi-source status update system. The system is served by a shared base station, which requires scheduling. Our main contribution is a randomized scheduling…

Information Theory · Computer Science 2025-11-20 Kuan-Yu Lin , Wei-Lun Lu , Yu-Pin Hsu , Yu-Chih Huang

In this paper, we consider N information streams sharing a common service facility. The streams are supposed to have different priorities based on their sensitivity. A higher priority stream will always preempt the service of a lower…

Information Theory · Computer Science 2020-01-07 Ali Maatouk , Mohamad Assaad , Anthony Ephremides

Received samples of a stochastic process are processed by a server for delivery as updates to a monitor. Each sample belongs to a class that specifies a distribution for its processing time and a function that describes how the value of the…

Information Theory · Computer Science 2024-08-23 Ahmed Arafa , Roy D. Yates

Age of Information (AoI) is a crucial metric for quantifying information freshness in real-time systems where the sampling rate of data packets is time-varying. Evaluating AoI under such conditions is challenging, as system states become…

Information Theory · Computer Science 2025-07-08 Jin Xu , Weiqi Wang , Natarajan Gautam

The problem of reducing the age-of-information has been extensively studied in the single-hop networks. In this paper, we minimize the age-of-information in general multihop networks. If the packet transmission times over the network links…

Information Theory · Computer Science 2017-03-31 Ahmed M. Bedewy , Yin Sun , Ness B. Shroff

This paper considers a multichannel preemptive-resume priority queueing system with a Poisson input and an arbitrary service time distribution depending on the priority of job. Jobs of the same priority are serviced according to the LIFO…

Probability · Mathematics 2022-06-22 A. G. Tatashev , O. V. Seleznjev , M. V. Yashina

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…

Information Theory · Computer Science 2025-04-11 Sahan Liyanaarachchi , Sennur Ulukus , Nail Akar

The mathematics of the finite single server queue with Poisson input and semi-Markov service times($M/SM/1/b$) is similar to that used for $BMAP/G/1/b$ systems. This observation results in new analytical formulas for a queue size in the…

Probability · Mathematics 2018-06-15 Krzysztof Rusek , Zdzisław Papir

A new timeliness metric, called Age-of-Information (AoI), has recently attracted a lot of research interests for real-time applications with information updates. It has been extensively studied for various queueing models based on the…

Information Theory · Computer Science 2023-02-17 Zhongdong Liu , Yu Sang , Bin Li , Bo Ji

We consider a system where the updates from independent sources are disseminated via a publish-subscribe mechanism. The sources are the publishers and a decision process (DP), acting as a subscriber, derives decision updates from the source…

Information Theory · Computer Science 2023-06-27 Vishakha Ramani , Ivan Seskar , Roy D. Yates

We establish the averaging property for a queuing process with one server, M(t)/GI/1. It is a new relation between the output flow rate and the input flow rate, crucial in the study of the Poisson Hypothesis. Its implications include the…

Probability · Mathematics 2007-05-23 Alexandre Rybko , Senya Shlosman , Alexandre Vladimirov

This paper considers a communication system where a source sends time-sensitive information to its destination. We assume that both arrival and service processes of the messages are memoryless and the source has a single server with no…

Information Theory · Computer Science 2022-12-09 Ashirwad Sinha , Praful D. Mankar , Nikolaos Pappas , Harpreet S. Dhillon

We consider the problem of minimizing age in a multihop wireless network. There are multiple source-destination pairs, transmitting data through multiple wireless channels, over multiple hops. We propose a network control policy which…

Networking and Internet Architecture · Computer Science 2019-09-17 Ashok Krishnan K. S. , Vinod Sharma

Since Age of Information (AoI) has been proposed as a metric that quantifies the freshness of information updates in a communication system, there has been a constant effort in understanding and optimizing different statistics of the AoI…

Information Theory · Computer Science 2019-05-13 Jaya Prakash Champati , Hussein Al-Zubaidy , James Gross

We consider a polling system where a group of an infinite number of servers visits sequentially a set of queues. When visited, each queue is attended for a random time. Arrivals at each queue follow a Poisson process, and service time of…

Probability · Mathematics 2014-04-23 Maria Vlasiou , Uri Yechiali