English
Related papers

Related papers: Buffered Aloha with K-Exponential Backoff -- Part …

200 papers

We study the effect of communication delays on distributed consensus algorithms. Two ways to model delays on a network are presented. The first model assumes that each link delivers messages with a fixed (constant) amount of delay, and the…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-07-26 Konstantinos I. Tsianos , Michael G. Rabbat

For general multi-hop queueing networks, delay optimal network control has unfortunately been an outstanding problem. The dynamic backpressure (BP) algorithm elegantly achieves throughput optimality, but does not yield good delay…

Information Theory · Computer Science 2015-04-22 Ying Cui , Edmund M. Yeh , Ran Liu

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, we study and analyze fundamental throughput and delay tradeoffs in cooperative multiple access for cognitive radio systems. We focus on the class of randomized cooperative policies, whereby the secondary user (SU) serves…

Networking and Internet Architecture · Computer Science 2014-04-25 Mahmoud Ashour , Amr A. El-Sherif , Tamer ElBatt , Amr Mohamed

The purpose of this paper is to analyze the so-called back-off technique of the IEEE 802.11 protocol in broadcast mode with waiting queues. In contrast to existing models, packets arriving when a station (or node) is in back-off state are…

Performance · Computer Science 2018-12-05 Guy Fayolle , Paul Muhlethaler

Energy efficiency and transmission delay are very important parameters for wireless multi-hop networks. Previous works that study energy efficiency and delay are based on the assumption of reliable links. However, the unreliability of the…

Networking and Internet Architecture · Computer Science 2008-07-30 Ruifeng Zhang , Jean-Marie Gorce , Katia Jaffrès-Runser

In this paper, I develop a generalized method to approximate end-to-end delay (average delay, jitter and density functions) in packet-switched networks (PSNs) of any size under 1) Kleinrock's independence assumption (KIA) and 2) when packet…

Networking and Internet Architecture · Computer Science 2021-03-23 Yu Chen

In this paper, we aim to minimize the average file transmission delay via bandwidth allocation and cache placement in two-tier heterogeneous networks with limited storage capacity, which consists of cache capacity and buffer capacity. For…

Information Theory · Computer Science 2019-07-19 Zhaohui Yang , Cunhua Pan , Yijin Pan , Yongpeng Wu , Wei Xu , Mohammad Shikh-Bahaei , Ming Chen

In this paper, wireless video transmission over full-duplex channels under total bandwidth and minimum required quality constraints is studied. In order to provide the desired performance levels to the end-users in real-time video…

Information Theory · Computer Science 2017-07-27 Chuang Ye , M. Cenk Gursoy , Senem Velipasalar

Caching is crucial for system performance, but the delayed hit phenomenon, where requests queue during lengthy fetches after a cache miss, significantly degrades user-perceived latency in modern high-throughput systems. While prior works…

Networking and Internet Architecture · Computer Science 2025-05-22 Bowen Jiang , Chaofan Ma

The proportionally fair sharing of the capacity of a Poisson network using Spatial-Aloha leads to closed-form performance expressions in two extreme cases: (1) the case without topology information, where the analysis boils down to a…

Networking and Internet Architecture · Computer Science 2013-08-01 François Baccelli , Bartlomiej Blaszczyszyn , Chandramani Singh

This paper studies the Ethernet Passive Optical Network (EPON) with gated-limited service. The transmission window (TW) is limited in this system to guaranteeing a bounded delay experienced by disciplined users, and to constrain malicious…

Networking and Internet Architecture · Computer Science 2017-05-29 Huanhuan Huang , Tong Ye , Tony T. Lee , Weisheng Hu

This paper considers a class of multi-channel random access algorithms, where contending devices may send multiple copies (replicas) of their messages to the central base station. We first develop a hypothetical algorithm that delivers a…

Information Theory · Computer Science 2017-05-15 Olga Galinina , Andrey Turlikov , Sergey Andreev , Yevgeni Koucheryavy

To meet the ever-increasing demands on higher throughput and better network delay performance, 60 GHZ networking is proposed as a promising solution for the next generation of wireless communications. To successfully deploy such networks,…

Performance · Computer Science 2016-08-09 Guang Yang , Ming Xiao , James Gross , Hussein Al-Zubaidy , Yongming Huang

Random access schemes in modern wireless communications are generally based on the framed-ALOHA (f-ALOHA), which can be optimized by flexibly organizing devices' transmission and re-transmission. However, this optimization is generally…

Networking and Internet Architecture · Computer Science 2020-02-19 Nan Jiang , Yansha Deng , Arumugam Nallanathan

In this paper, we consider a simple network consisting of a source, a half-duplex decode-and-forward relay, and a destination. We propose a new relaying protocol employing adaptive link selection, i.e., in any given time slot, based on the…

Information Theory · Computer Science 2015-03-20 Nikola Zlatanov , Robert Schober , Petar Popovski

We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation…

Information Theory · Computer Science 2012-10-03 Čedomir Stefanović , Kasper F. Trilingsgaard , Nuno K. Pratas , Petar Popovski

Recent studies have shown that retransmissions can cause heavy-tailed transmission delays even when packet sizes are light-tailed. Moreover, the impact of heavy-tailed delays persists even when packets size are upper bounded. The key…

Information Theory · Computer Science 2012-02-22 Yang Yang , Jian Tan , Ness B. Shroff , Hesham El-Gamal

In this paper, we consider multiple-antenna $K$-user interference channels with backhaul collaboration in one side (among the transmitters or among the receivers) and investigate the trade-off between the rate in the channel versus the…

Information Theory · Computer Science 2018-07-24 Borna Kananian , Mohammad Ali Maddah-ali , Babak Hossein Khalaj

A well-known inner bound of the stability region of the slotted Aloha protocol on the collision channel with n users assumes worst-case service rates (all user queues non-empty). Using this inner bound as a feasible set of achievable rates,…

Information Theory · Computer Science 2016-05-06 Nan Xie , Steven Weber
‹ Prev 1 4 5 6 7 8 10 Next ›