English
Related papers

Related papers: Bounding Queue Length Violation Probability of Joi…

200 papers

In general, obtaining the exact steady-state distribution of queue lengths is not feasible. Therefore, we establish bounds for the tail probabilities of queue lengths. Specifically, we examine queueing systems under Heavy-Traffic (HT)…

Probability · Mathematics 2023-06-21 Prakirt Raj Jhunjhunwala , Daniela Hurtado-Lange , Siva Theja Maguluri

Unlike the AWGN (additive white gaussian noise) channel, fading channels suffer from random channel gains besides the additive Gaussian noise. As a result, the instantaneous channel capacity varies randomly along time, which makes it…

Information Theory · Computer Science 2014-07-18 Yunquan Dong , Pingyi Fan

This work investigates the probability that the delay and the peak-age of information exceed a desired threshold in a point-to-point communication system with short information packets. The packets are generated according to a stationary…

Information Theory · Computer Science 2019-02-04 Rahul Devassy , Giuseppe Durisi , Guido Carlo Ferrante , Osvaldo Simeone , Elif Uysal

This article examines the queueing performance of communication systems that transmit encoded data over unreliable channels. A fading formulation suitable for wireless environments is considered where errors are caused by a discrete channel…

Information Theory · Computer Science 2013-09-16 Fatemeh Hamidi-Sepehr , Henry D. Pfister , Jean-Francois Chamberland

In this paper, wireless systems operating under queueing constraints in the form of limitations on the buffer violation probabilities are considered. The throughput under such constraints is captured by the effective capacity formulation.…

Information Theory · Computer Science 2010-09-16 Mustafa Cenk Gursoy

With the emergence of new application areas, such as cyber-physical systems and human-in-the-loop applications, there is a need to guarantee a certain level of end-to-end network latency with extremely high reliability, e.g., 99.999%. While…

Networking and Internet Architecture · Computer Science 2023-07-21 Samie Mostafavi , Gourav Prateek Sharma , James Gross

This paper considers delay-limited communication over quasi-static fading channels under a long-term power constraint. A sequence of length-$n$ delay-limited codes for a quasi-static fading channel is said to be capacity-achieving if the…

Information Theory · Computer Science 2016-11-15 Silas L. Fong , Vincent Y. F. Tan

Unreliable fading wireless channels are the main challenge for strict performance guarantees in mobile communications. Diversity schemes including massive number of antennas, huge spectrum bands and multi-connectivity links are applied to…

Information Theory · Computer Science 2020-09-21 Karl-Ludwig Besser , Eduard A. Jorswieck

While the notion of age of information (AoI) has recently been proposed for analyzing ultra-reliable low-latency communications (URLLC), most of the existing works have focused on the average AoI measure. Designing a wireless network based…

Networking and Internet Architecture · Computer Science 2019-12-24 Mohamed K. Abdel-Aziz , Sumudu Samarakoon , Chen-Feng Liu , Mehdi Bennis , Walid Saad

We analyze and optimize a wireless system with energy transfer in the downlink and information transfer in the uplink, under quasi-static Nakagami-m fading. We consider ultra-reliable communication scenarios representative of the…

Information Theory · Computer Science 2017-02-22 Onel L. Alcaraz López , Hirley Alves , Richard Demo Souza , Evelio Martín García Fernández

This paper investigates the distribution of delay and peak age of information in a communication system where packets, generated according to an independent and identically distributed Bernoulli process, are placed in a single-server queue…

Information Theory · Computer Science 2018-06-20 Rahul Devassy , Giuseppe Durisi , Guido Carlo Ferrante , Osvaldo Simeone , Elif Uysal-Biyikoglu

We study a heavily overloaded single-server queue with abandonment and derive bounds on stationary tail probabilities of the queue length. As the abandonment rate $\gamma \downarrow 0$, the centered-scaled queue length $\tilde{q}$ is known…

Probability · Mathematics 2026-03-20 Zedong Wang , Siva Theja Maguluri

Wireless fading channels suffer from both channel fadings and Additive White Gaussian Noise (AWGN). As a result, it is impossible for fading channels to support a constant rate data stream without using buffers. In this paper, we consider…

Information Theory · Computer Science 2017-12-15 Yunquan Dong , Pingyi Fan

A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that…

Information Theory · Computer Science 2016-11-17 Masoud Ebrahimi , Mohammad A. Maddah-Ali , Amir K. Khandani

A deep understanding of the queuing performance of wireless networks is essential for the advancement of future wireless communications. The stochastic nature of wireless channels in general gives rise to a time varying transmission rate.…

Networking and Internet Architecture · Computer Science 2016-04-05 Sebastian Schiessl , Farshad Naghibi , Hussein Al-Zubaidy , Markus Fidler , James Gross

While the notion of age of information (AoI) has recently emerged as an important concept for analyzing ultra-reliable low-latency communications (URLLC), the majority of the existing works have focused on the average AoI measure. However,…

Networking and Internet Architecture · Computer Science 2019-11-28 Mohamed K. Abdel-Aziz , Chen-Feng Liu , Sumudu Samarakoon , Mehdi Bennis , Walid Saad

In this paper, we propose a framework for cross-layer optimization to ensure ultra-high reliability and ultra-low latency in radio access networks, where both transmission delay and queueing delay are considered. With short transmission…

Information Theory · Computer Science 2017-10-10 Changyang She , Chenyang Yang , Tony Q. S. Quek

With the rise of critical machine-to-machine applications, next generation wireless communication systems must be designed with strict constraints on the latency and reliability. A key question in this context relates to channel state…

Information Theory · Computer Science 2017-06-06 Sebastian Schiessl , Hussein Al-Zubaidy , Mikael Skoglund , James Gross

This paper is motivated by the observation that the average queueing delay can be decreased by sacrificing power efficiency in wireless communications. In this sense, we naturally wonder what is the minimum queueing delay when the available…

Information Theory · Computer Science 2018-07-27 Meng Wang , Juan Liu , Wei Chen , Anthony Ephremides

In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing relay network to better exploit the time diversity and relay…

Information Theory · Computer Science 2009-08-10 Rui Wang , Vincent K. N. Lau , Kaibin Huang
‹ Prev 1 2 3 10 Next ›