English
Related papers

Related papers: A fixed-point approximation for a routing model in…

200 papers

We study the distribution of traffic in networks whose users try to minimise their delays by adhering to a simple learning scheme inspired by the replicator dynamics of evolutionary game theory. The stable steady states of these dynamics…

Probability · Mathematics 2010-02-27 Panayotis Mertikopoulos , Aris L. Moustakas

In wireless networks, the knowledge of nodal distances is essential for several areas such as system configuration, performance analysis and protocol design. In order to evaluate distance distributions in random networks, the underlying…

Information Theory · Computer Science 2012-01-24 Sunil Srinivasa , Martin Haenggi

We derive a system of fixed-point equations for the equilibrium transfers in a class of one-to-one matching models with linear transferable utility. We then show that, when the degree of substitution between alternatives is bounded from…

General Economics · Economics 2025-07-09 Esben Scrivers Andersen

We consider a system of $N$ parallel queues with identical exponential service rates and a single dispatcher where tasks arrive as a Poisson process. When a task arrives, the dispatcher always assigns it to an idle server, if there is any,…

Probability · Mathematics 2016-12-14 D. Mukherjee , S. C. Borst , J. S. H. van Leeuwaarden , P. A. Whiting

This note introduces a piecewise-deterministic queueing (PDQ) model to study the stability of traffic queues in parallel-link transportation systems facing stochastic capacity fluctuations. The saturation rate (capacity) of the PDQ model…

Optimization and Control · Mathematics 2018-02-19 Li Jin , Saurabh Amin

We develop a Markovian traffic equilibrium model for ride-hailing in which vehicles, whether empty or hired, make sequential order-acceptance and link-choice decisions over a traffic network to maximize total discounted return in an…

Computer Science and Game Theory · Computer Science 2026-04-24 Song Gao , Hanyu Cheng , Chiwei Yan , Guocheng Jiang

We study a decentralized variant of stochastic approximation, a data-driven approach for finding the root of an operator under noisy measurements. A network of agents, each with its own operator and data observations, cooperatively find the…

Machine Learning · Computer Science 2022-06-17 Sihan Zeng , Thinh T. Doan , Justin Romberg

In this paper, we study stability and latency of routing in wireless networks where it is assumed that no collision will occur. Our approach is inspired by the adversarial queuing theory, which is amended in order to model wireless…

Networking and Internet Architecture · Computer Science 2010-06-08 Vicent Cholvi , Dariusz R. Kowalski

Advances in experimental techniques allow the collection of high-resolution spatio-temporal data that track individual motile entities over time. These tracking data motivate the use of mathematical models to characterise the motion…

Data Analysis, Statistics and Probability · Physics 2025-03-30 Arianna Ceccarelli , Alexander P. Browning , Ruth E. Baker

Robustness of routing policies for networks is a central problem which is gaining increased attention with a growing awareness to safeguard critical infrastructure networks against natural and man-induced disruptions. Routing under limited…

Systems and Control · Computer Science 2012-05-02 Giacomo Como , Ketan Savla , Daron Acemoglu , Munther A. Dahleh , Emilio Frazzoli

We introduce a continuum model describing data losses in a single node of a packet-switched network (like the Internet) which preserves the discrete nature of the data loss process. {\em By construction}, the model has critical behavior…

Networking and Internet Architecture · Computer Science 2009-11-13 A. S. Stepanenko , C. C. Constantinou , I. V. Yurkevich , I. V. Lerner

We investigate the convergence to (quasi--)equilibrium of a density dependent Markov chain in~${\mathbb Z}^d$, whose drift satisfies a system of ordinary differential equations having an attractive fixed point. For a sequence of such…

Probability · Mathematics 2025-08-21 Andrew Barbour , Graham Brightwell , Malwina Luczak

Given a network with a continuum of users at some origins, suppose that the users wish to reach specific destinations, but that they are not indifferent to the time needed to reach their destination. They may have several possibilities (of…

Computer Science and Game Theory · Computer Science 2008-10-15 Frédéric Meunier , Nicolas Wagner

This two-part paper details a theory of solvability for the power flow equations in lossless power networks. In Part I, we derive a new formulation of the lossless power flow equations, which we term the fixed-point power flow. The model is…

Optimization and Control · Mathematics 2017-09-21 John W. Simpson-Porco

This paper presents an algorithm that solves the AC power flow problem for balanced, three-phase transmission systems at steady state. The algorithm extends the "fixed-point power flow" algorithm in the literature to include transmission…

Systems and Control · Electrical Eng. & Systems 2022-10-05 Liangjie Chen , John W. Simpson-Porco

We propose a macroscopic traffic network flow model suitable for analysis as a dynamical system, and we qualitatively analyze equilibrium flows as well as convergence. Flows at a junction are determined by downstream supply of capacity as…

Systems and Control · Computer Science 2015-05-25 Samuel Coogan , Murat Arcak

In this paper, we study a controllable tandem queueing system consisting of two nodes and a controller, in which customers arrive according to a Poisson process and must receive service at both nodes before leaving the system. A decision…

Probability · Mathematics 2015-04-07 Liu Zaiming , Chen Gang , Wu Jinbiao

The unique fluctuation-dissipation theorem for equilibrium stands in contrast with the wide variety of nonequilibrium linear response formulae. Their most traditional approach is "analytic", which, in the absence of detailed balance,…

Statistical Mechanics · Physics 2013-01-21 Marco Baiesi , Christian Maes

We consider a queueing system with $n$ parallel queues operating according to the so-called "supermarket model" in which arriving customers join the shortest of $d$ randomly selected queues. Assuming rate $n\lambda_{n}$ Poisson arrivals and…

Probability · Mathematics 2017-01-19 Patrick Eschenfeldt , David Gamarnik

Two mobile agents, starting from different nodes of a network modeled as a graph, and woken up at possibly different times, have to meet at the same node. This problem is known as rendezvous. We consider deterministic distributed rendezvous…

Data Structures and Algorithms · Computer Science 2023-11-23 Avery Miller , Andrzej Pelc