Network congestion control with Markovian multipath routing

DOI10.1007/S10107-013-0719-ZzbMATH Open1297.90013arXiv1107.2900OpenAlexW2118007118MaRDI QIDQ463729FDOQ463729

Authors: Roberto Cominetti, Cristóbal Guzmán 

Publication date: 17 October 2014

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

Abstract: In this paper we consider an integrated model for TCP/IP protocols with multipath routing. The model combines a Network Utility Maximization for rate control based on end-to-end queuing delays, with a Markovian Traffic Equilibrium for routing based on total expected delays. We prove the existence of a unique equilibrium state which is characterized as the solution of an unconstrained strictly convex program. A distributed algorithm for solving this optimization problem is proposed, with a brief discussion of how it can be implemented by adapting the current Internet protocols.

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

Recommendations

• scientific article; zbMATH DE number 7042555
• Markovian network processes: Congestion-dependent routing and processing
• Optimal congestion control and routing for multipath networks with random losses
• Congestion minimization for multipath routing via multiroute flows
• Congestion control and its stability in networks with delay sensitive traffic
• Congestion Control for Multicast Flows With Network Coding
• Optimal dynamic routing in Markov queueing networks
• Congestion control in compartmental network systems
• Congestion control in multi-source connection-oriented networks with aperiodic feedback
• scientific article; zbMATH DE number 3883905

zbMATH Keywords

network optimizationcongestion controlmultipath routingcross-layer design

Mathematics Subject Classification ID

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

Cites Work

• 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
• Resource pooling in congested networks: Proportional fairness and product form
• A Markovian analysis of additive-increase multiplicative-decrease algorithms
• Markovian traffic equilibrium
• Utility Maximization for Communication Networks With Multipath Routing
• Resource pricing and the evolution of congestion control
• Understanding TCP Vegas, a duality model
• Proportional fairness and its relationship with multi-class queueing networks
• A Minimum Delay Routing Algorithm Using Distributed Computation

Cited In (22)

• Statistical approach for congestion control in gateway routers
• Congested link inference algorithms in dynamic routing IP network
• Control of communication networks: welfare maximization and multipath transfers
• A survey of optimal network congestion control for unicast and multicast transmission
• High-efficient RPL routing protocol for centralized network congestion control
• Multi-path utility maximization and multi-path TCP design
• Fuzzy explicit marking: A unified congestion controller for best-effort and diff-serv networks
• Bottleneck routing with elastic demands
• Bottleneck routing with elastic demands
• Differential delay constrained multipath routing for SDN and optical networks
• Fair resource allocation and stability for communication networks with multipath routing
• Markovian network processes: Congestion-dependent routing and processing
• Fluid models of integrated traffic and multipath routing
• Equilibrium routing under uncertainty
• mReno: a practical multipath congestion control for communication networks
• A SOCIOLOGICAL PERSPECTIVE ON THE REORDERING PROBLEM IN MULTIPATH ROUTING
• Rate-adaptive multipath routing: distributed, centralized, and hybrid architectures
• A hybrid routing model for mitigating congestion in networks
• Optimal congestion control and routing for multipath networks with random losses
• Routing control in IP-networks with the variable performance criterion
• Control of multipath TCP and optimization of multipath routing in the internet
• Optimal Congestion Control with Multipath Routing Using TCP-FAST and a Variant of RIP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463729)