Self-adaptive congestion control for multiclass intermittent connections in a communication network

DOI10.1007/S11134-011-9260-ZzbMATH Open1236.90022arXiv1008.3505OpenAlexW1989303055MaRDI QIDQ415643FDOQ415643

Authors: Carl Graham, Philippe Robert 

Publication date: 8 May 2012

Published in: Queueing Systems (Search for Journal in Brave)

Abstract: A Markovian model of the evolution of intermittent connections of various classes in a communication network is established and investigated. Any connection evolves in a way which depends only on its class and the state of the network, in particular as to the route it uses among a subset of the network nodes. It can be either active (ON) when it is transmitting data along its route, or idle (OFF). The congestion of a given node is defined as a functional of the transmission rates of all ON connections going through it, and causes losses and delays to these connections. In order to control this, the ON connections self-adaptively vary their transmission rate in TCP-like fashion. The connections interact through this feedback loop. A Markovian model is provided by the states (OFF, or ON with some transmission rate) of the connections. The number of connections in each class being potentially huge, a mean-field limit result is proved with an appropriate scaling so as to reduce the dimensionality. In the limit, the evolution of the states of the connections can be represented by a non-linear system of stochastic differential equations, of dimension the number of classes. Additionally, it is shown that the corresponding stationary distribution can be expressed by the solution of a fixed-point equation of finite dimension.

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

Recommendations

• Interacting multi-class transmissions in large stochastic networks
• A multi-class mean-field model with graph structure for TCP flows
• Stability properties of networks with interacting TCP flows
• Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm
• Modeling window based congestion control protocols with many flows

zbMATH Keywords

mean-field limitstationary distributionMcKean-Vlasov equationchaoticityflow control algorithmmulticlass systemnonlinear Markov process

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Distributed algorithms (68W15) Communication networks in operations research (90B18) Network protocols (68M12)

Cites Work

• Title not available (Why is that?)
• Applied Probability and Queues
• Title not available (Why is that?)
• General Irreducible Markov Chains and Non-Negative Operators
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Markovian analysis of additive-increase multiplicative-decrease algorithms
• On the long time behavior of the TCP window size process
• Interacting multi-class transmissions in large stochastic networks
• AIMD algorithms and exponential functionals
• Stability properties of networks with interacting TCP flows
• Chaoticity for Multiclass Systems and Exchangeability Within Classes

Cited In (8)

• Analysis of stochastic gradient descent in continuous time
• Symbiotic rate adaptation for time sensitive elastic traffic with interactive transport
• Qualitative properties of certain piecewise deterministic Markov processes
• Interacting multi-class transmissions in large stochastic networks
• Some simple but challenging Markov processes
• Adaptive mechanism-based congestion control for networked systems
• Congestion control based on multiple model adaptive control
• Continuum modeling and control of large nonuniform wireless networks via nonlinear partial differential equations

This page was built for publication: Self-adaptive congestion control for multiclass intermittent connections in a communication network

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