A stochastic approximation approach for max-min fair adaptive rate control of ABR sessions with MCRs

Abraham, Santosh P.; Kumar, Anurag

doi:10.1109/infcom.1998.662952

Cited by 17 publications

(11 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These results have usually been developed for networks supporting afixed number of connections. Stability, in this context, is usually interpreted as avoiding queue/delay buildups, and/or somewhat loosely as ensuring that transmission rates converge to an equilibrium corresponding to a bandwidth allocation among ongoing connections [2], [3], [6], [29], [19], [1], [16]. An equilibrium bandwidth allocation is usually characterized in terms of its "fairness" to users, e.g., max-min or proportional fairness [4], [15].…”

mentioning

confidence: 99%

Stability and performance analysis of networks supporting services with rate control-could the Internet be unstable?

Veciana

Lee

Konstantopoulos³

1999

IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer A

View full text Add to dashboard Cite

Abstract--We consider the stability and performance of a model for networks supporting services that adapt their transmission to the available bandwidth. Not unlike real networks, in our model, connection arrivals are stochastic, each has a random amount of data to send, and the number of ongoing connections in the system changes over time. Consequently, the bandwidth allocated to, or throughput achieved by, a given connection may change during its lifetime as feedback control mechanisms react to network loads. Ideally, if there were a fixed number of ongoing connections, such feedback mechanisms would reach an equilibrium bandwidth allocation typically characterized in terms of its "fairness" to users, e.g., max-min or proportionally fair. In this paper we prove the stability of such networks when the offered load on each link does not exceed its capacity. We use simulation to investigate performance, in terms of average connection delays, for various fairness criteria. Finally, we pose an architectural problem in TCP/IPs decoupling of the transport and network layer from the point of view of guaranteeing connection-level stability, which we claim may explain congestion phenomena on the Internet.Index Terms--ABR service, bandwidth allocation, Lyapunov functions, performance analysis, proportional fairness, rate control, stability, TCP/IP, weighted max-min fairness.

show abstract

mentioning

confidence: 99%

Stability and performance analysis of networks supporting services with rate control-could the Internet be unstable?

Veciana

Lee

Konstantopoulos³

1999

IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer A

View full text Add to dashboard Cite

show abstract

“…2) Relation to Some Previous Work in ATM Networks: We note that the RCP algorithm, basically that given by (2), shares similarities with some algorithms proposed in the past in the context of Asynchronous Transfer Mode (ATM) networks: see [1], [2], [9], [12] for some algorithms and analysis. The most noticeable difference is that in prior work = 0, and hence they do not consider the impact of feedback based on queue size.…”

Section: ) Model For the Queuementioning

confidence: 83%

“…At the level of interest in this note, we do not propose any explicit functional form for the mean queue length. Different functional forms may be suitable candidates, but our primary focus is to investigate some stability properties of the dynamical system defined by (1)(2)(3)(4).…”

Section: ) Model For the Queuementioning

confidence: 99%

“…Thus far there appears to be no definitive conclusion about the exclusion of feedback based on queue size and so the analysis of system (1)(2)(3)(4) where > 0 is still important. We also highlight the analysis of [5], which develops robust controllers to deal with a regime where, due to queue dynamics, the end systems have to cope with varying delays.…”

Section: ) Model For the Queuementioning

confidence: 99%

“…A key focus of this note is a control theoretic analysis of the system described by (1)(2)(3)(4), with heterogeneous feedback delays. This aspect has not previously been analyzed, and so our analysis presents a step forward.…”

Section: ) Model For the Queuementioning

confidence: 99%

See 2 more Smart Citations

Stability Analysis of a Max-Min Fair Rate Control Protocol (RCP) in a Small Buffer Regime

Voice

Raina

2009

IEEE Trans. Automat. Contr.

View full text Add to dashboard Cite

In this note we analyse various stability properties of a max-min fair Rate Control Protocol (RCP) operating with small buffers. We first tackle the issue of stability for networks with arbitrary topologies. We prove that the max-min fair RCP fluid model is globally stable in the absence of propagation delays, and also derive a set of conditions for local stability when arbitrary heterogeneous propagation delays are present. The network delay stability result assumes that, at equilibrium, there is only one bottleneck link along each route. Lastly, in the simpler setting of a single link, single delay model, we investigate the impact of the loss of local stability via a Hopf bifurcation.Index Terms-Max-min fairness, rate control, small buffers, stability.

show abstract

Stabilization of max–min fair networks without per-flow state

Cobb

Gouda

2011

Theoretical Computer Science

View full text Add to dashboard Cite

Let a flow be a sequence of packets sent from a source computer to a destination computer. Routers at the core of the Internet do not maintain any information about the flows that traverse them. This has allowed for great speeds at the routers, at the expense of providing only best-effort service. In this paper, we consider the problem of fairly allocating bandwidth to each flow. We assume some flows request a constant amount of bandwidth from the network. The bandwidth that remains is distributed fairly among the rest of the flows. The fairness sought after is max-min fairness, which assigns to each flow the largest possible bandwidth that avoids affecting other flows. The distinguishing factor to other approaches is that routers only maintain a constant amount of state, which is consistent with trends in the Internet (such as the proposed Differentiated Services Internet architecture). In addition, due to the need for high fault-tolerance in the Internet, we ensure our protocol is self-stabilizing, that is, it tolerates a wide variety of transient faults.

show abstract

A stochastic approximation approach for max-min fair adaptive rate control of ABR sessions with MCRs

Cited by 17 publications

References 5 publications

Stability and performance analysis of networks supporting services with rate control-could the Internet be unstable?

Stability and performance analysis of networks supporting services with rate control-could the Internet be unstable?

Stability Analysis of a Max-Min Fair Rate Control Protocol (RCP) in a Small Buffer Regime

Stabilization of max–min fair networks without per-flow state

Contact Info

Product

Resources

About