English
Related papers

Related papers: Delay Performance and Mixing Times in Random-Acces…

200 papers

Motivated by interest in providing more efficient services in customer service systems, we use statistical learning methods and delay history information to predict the conditional distribution of the customers' waiting times in queueing…

Performance · Computer Science 2019-12-19 Majid Raeis , Ali Tizghadam , Alberto Leon-Garcia

Consider the problem of a multiple access channel in a time dependent environment with a large number of users. In such a system, mostly due to practical constraints (e.g., decoding complexity), not all users can be scheduled together, and…

Information Theory · Computer Science 2018-11-07 Ori Shmuel , Asaf Cohen , Omer Gurewitz

In this paper, we analyze a shared access network with a fixed primary node and randomly distributed secondary nodes whose distribution follows a Poisson point process (PPP). The secondaries use a random access protocol allowing them to…

Networking and Internet Architecture · Computer Science 2016-03-30 Zheng Chen , Nikolaos Pappas , Marios Kountouris , Vangelis Angelakis

Modern networks exhibit a high degree of variability in link rates. Cellular network bandwidth inherently varies with receiver motion and orientation, while class-based packet scheduling in datacenter and service provider networks induces…

Networking and Internet Architecture · Computer Science 2022-02-10 Prateesh Goyal , Mohammad Alizadeh , Thomas E. Anderson

As the mobile application landscape expands, wireless networks are tasked with supporting different connection profiles, including real-time traffic and delay-sensitive communications. Among many ensuing engineering challenges is the need…

Information Theory · Computer Science 2014-03-31 Fatemeh Hamidi-Sepehr , Jean-Francois Chamberland , Henry D. Pfister

This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fraction of packets must be transmitted before the end of the deadline.…

Networking and Internet Architecture · Computer Science 2010-07-12 Juan Jose Jaramillo , R. Srikant , Lei Ying

We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees, defined by instantaneous throughput and hard packet deadlines. Using a network slicing model to decouple the queueing dynamics between flows,…

Networking and Internet Architecture · Computer Science 2026-04-21 Nicholas Jones , Eytan Modiano

In this paper, we consider the performance of a random-access time-slotted wireless network with a single access point and a mix of half- and full- duplex stations. Full-duplex transmissions involve data transmitted simultaneously in both…

Information Theory · Computer Science 2014-07-15 Vaneet Aggarwal , N. K. Shankaranarayanan

The back-pressure algorithm is a well-known throughput-optimal algorithm. However, its delay performance may be quite poor even when the traffic load is not close to network capacity due to the following two reasons. First, each node has to…

Networking and Internet Architecture · Computer Science 2010-05-31 Loc Bui , R. Srikant , Alexander Stolyar

In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput "epsilon-close" to the optimal throughput in multi-hop wireless networks with a tradeoff of O(1/epsilon) in delay guarantees. The algorithm aims to…

Information Theory · Computer Science 2011-01-26 Dongyue Xue , Eylem Ekici

We consider the problem of distributed scheduling in wireless networks where heterogeneously delayed information about queue lengths and channel states of all links are available at all the transmitters. In an earlier work (by Reddy et al.…

Networking and Internet Architecture · Computer Science 2016-01-12 Srinath Narasimha , Joy Kuri , Albert Sunny

In this paper, we introduce novel coding schemes for wireless networks with random transmission delays. These coding schemes obviate the need for synchronicity, reduce the number of transmissions and achieve the optimal rate region in the…

Information Theory · Computer Science 2015-03-04 Niv Voskoboynik , Haim H. Permuter , Asaf Cohen

Control of wireless multihop networks, while simultaneously meeting end-to-end mean delay requirements of different flows is a challenging problem. Additionally, distributed computation of control parameters adds to the complexity. Using…

Networking and Internet Architecture · Computer Science 2017-11-06 Ashok Krishnan K. S. , Vinod Sharma

Quality of service (QoS) provisioning in next-generation mobile communications systems entails a deep understanding of the delay performance. The delay in wireless networks is strongly affected by the traffic arrival process and the service…

Information Theory · Computer Science 2018-04-23 Marios Kountouris , Nikolaos Pappas , Apostolos Avranas

Network traffic model is a critical problem for urban applications, mainly because of its diversity and node density. As wireless sensor network is highly concerned with the development of smart cities, careful consideration to traffic…

Networking and Internet Architecture · Computer Science 2014-06-23 Trista Lin , Hervé Rivano , Frédéric Le Mouël

This work addresses the problem of deriving fundamental trade-off bounds for a 1-relay and a 2-relay wireless network when multiple performance criteria are of interest. It proposes a simple MultiObjective (MO) performance evaluation…

Networking and Internet Architecture · Computer Science 2012-11-15 Qi Wang , Katia Jaffrès-Runser , Claire Goursaud , Jean-Marie Gorce

As the next-generation wireless networks thrive, full-duplex and relay techniques are combined to improve the network performance. Random linear network coding (RLNC) is another popular technique to enhance the efficiency and reliability of…

Information Theory · Computer Science 2022-11-04 Rina Su , Qifu Tyler Sun , Zhongshan Zhang , Zongpeng Li

In this work, we address the delay optimal scheduling problem for wireless transmission with fixed modulation over multi-state fading channels. We propose a stochastic scheduling policy which schedules the source to transmit with…

Information Theory · Computer Science 2015-09-18 Juan Liu , Wei Chen , Khaled B. Letaief

We investigate optimal resource allocation for delay-limited cooperative communication in time varying wireless networks. Motivated by real-time applications that have stringent delay constraints, we develop a dynamic cooperation strategy…

Information Theory · Computer Science 2009-10-08 Rahul Urgaonkar , Michael J. Neely

This paper considers optimization of power and delay in a time-varying wireless link using rateless codes. The link serves a sequence of variable-length packets. Each packet is coded and transmitted over multiple slots. Channel conditions…

Information Theory · Computer Science 2015-10-13 Xiaohan Wei , Michael J. Neely