English
Related papers

Related papers: Network stability under max--min fair bandwidth sh…

200 papers

We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain…

Information Theory · Computer Science 2011-12-05 Qiao Li , Rohit Negi

We consider performance deterioration of interconnected linear dynamical networks subject to exogenous stochastic disturbances. The focus of this paper is on first-order and second-order linear consensus networks. We employ the expected…

Optimization and Control · Mathematics 2014-12-19 Milad Siami , Nader Motee

This paper considers max-min fair rate allocation and routing in energy harvesting networks where fairness is required among both the nodes and the time slots. Unlike most previous work on fairness, we focus on multihop topologies and…

Networking and Internet Architecture · Computer Science 2016-06-10 Jelena Marasevic , Cliff Stein , Gil Zussman

We present in this article traffic flow and control models for the train dynamics in metro lines. The first model, written in the max-plus algebra, takes into account minimum running, dwell and safety time constraints, without any control…

Optimization and Control · Mathematics 2018-01-09 Nadir Farhi , Cyril Nguyen Van Phu , Habib Haj-Salem , Jean-Patrick Lebacque

Recent experimental studies confirm the prevalence of the widely known performance anomaly problem in current Wi-Fi networks, and report on the severe network utility degradation caused by this phenomenon. Although a large body of work…

Networking and Internet Architecture · Computer Science 2015-05-20 Paul Patras , Andres Garcia-Saavedra , David Malone , Douglas J. Leith

In this paper, we consider the problem of scheduling real-time traffic in wireless networks under a conflict-graph interference model and single-hop traffic. The objective is to guarantee that at least a certain fraction of packets of each…

Networking and Internet Architecture · Computer Science 2020-01-16 Christos Tsanikidis , Javad Ghaderi

We construct a generic, simple, and efficient scheduling policy for stochastic processing networks, and provide a general framework to establish its stability. Our policy is randomized and prioritized: with high probability it prioritizes…

Probability · Mathematics 2012-10-02 Antonius B. Dieker , Jinwoo Shin

We study, possibly distributed, robust weight control policies for DC power networks that change link susceptances, or weights in response to balanced disturbances to the supply-demand vector. The margin of robustness for a given control…

Optimization and Control · Mathematics 2016-10-19 Qin Ba , Ketan Savla

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

We consider single-hop topologies with saturated transmitting nodes, using IEEE~802.11 DCF for medium access. However, unlike the conventional WiFi, we study systems where one or more of the protocol parameters are different from the…

Networking and Internet Architecture · Computer Science 2016-07-26 Abhijit Bhattacharya , Anurag Kumar

We revisit an algorithm for distributed consensus optimization proposed in 2010 by J. Wang and N. Elia. By means of a Lyapunov-based analysis, we prove input-to-state stability of the algorithm relative to a closed invariant set composed of…

Optimization and Control · Mathematics 2022-04-22 Michelangelo Bin , Ivano Notarnicola , Thomas Parisini

The concept of spectrum or bandwidth sharing has gained significant global attention as a means to enhance the efficiency of real-time traffic management in wireless networks. Effective bandwidth sharing enables optimal utilization of…

Networking and Internet Architecture · Computer Science 2025-06-12 Sushi Anna George , Vinay Joseph

We study a minimal model of traffic flows in complex networks, simple enough to get analytical results, but with a very rich phenomenology, presenting continuous, discontinuous as well as hybrid phase transitions between a free-flow phase…

Statistical Mechanics · Physics 2015-05-13 Daniele De Martino , Luca Dall'Asta , Ginestra Bianconi , Matteo Marsili

This paper considers max-min fairness for wireless energy transfer in a downlink multiuser communication system. Our resource allocation design maximizes the minimum harvested energy among multiple multiple-antenna energy harvesting…

Information Theory · Computer Science 2014-04-08 Derrick Wing Kwan Ng , Robert Schober

We develop link rate control policies to minimize the queueing delay of packets in overloaded networks. We show that increasing link rates does not guarantee delay reduction during overload. We consider a fluid queueing model that…

Networking and Internet Architecture · Computer Science 2024-11-07 Xinyu Wu , Dan Wu , Eytan Modiano

Given a wireless network where some pairs of communication links interfere with each other, we study sufficient conditions for determining whether a given set of minimum bandwidth Quality of Service (QoS) requirements can be satisfied. We…

Information Theory · Computer Science 2009-06-23 Ashwin Ganesan

The packet is the fundamental unit of transportation in modern communication networks such as the Internet. Physical layer scheduling decisions are made at the level of packets, and packet-level models with exogenous arrival processes have…

Networking and Internet Architecture · Computer Science 2010-03-05 Ciamac Moallemi , Devavrat Shah

We consider the delay properties of max-weight opportunistic scheduling in a multi-user ON/OFF wireless system, such as a multi-user downlink or uplink. It is well known that max-weight scheduling stabilizes the network (and hence yields…

Optimization and Control · Mathematics 2009-01-02 Michael J. Neely

A novel distributed algorithm for estimating the maximum of the node initial state values in a network, in the presence of additive communication noise is proposed. Conventionally, the maximum is estimated locally at each node by updating…

Signal Processing · Electrical Eng. & Systems 2019-09-27 Gowtham Muniraju , Cihan Tepedelenlioglu , Andreas Spanias

Congestion control is an indispensable component of transport protocols to prevent congestion collapse. As such, it distributes the available bandwidth among all competing flows, ideally in a fair manner. However, there exists a constantly…

Networking and Internet Architecture · Computer Science 2019-05-20 Jan Rüth , Ike Kunze , Oliver Hohlfeld