Network congestion control with Markovian multipath routing

DOI10.1007/s10107-013-0719-zzbMath1297.90013arXiv1107.2900OpenAlexW2118007118MaRDI QIDQ463729

Cristóbal Guzmán, Roberto Cominetti

Publication date: 17 October 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.2900

zbMATH Keywords

network optimizationcongestion controlmultipath routingcross-layer design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Optimality conditions and duality in mathematical programming (90C46) Communication networks in operations research (90B18) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (3)

Bottleneck Routing with Elastic Demands ⋮ Bottleneck routing with elastic demands ⋮ Equilibrium routing under uncertainty

Cites Work

• Proportional fairness and its relationship with multi-class queueing networks
• Resource pricing and the evolution of congestion control
• Resource pooling in congested networks: Proportional fairness and product form
• Markovian traffic equilibrium
• On the severity of Braess's paradox: designing networks for selfish users is hard
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Understanding TCP Vegas
• A Minimum Delay Routing Algorithm Using Distributed Computation
• A Markovian analysis of additive-increase multiplicative-decrease algorithms
• Utility Maximization for Communication Networks With Multipath Routing

This page was built for publication: Network congestion control with Markovian multipath routing