A new approach for asynchronous distributed rate control of elastic sessions in integrated packet networks

Abraham, Santosh P.; Kumar, Anurag

doi:10.1109/90.909021

Cited by 14 publications

(11 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They consider the problem for a wired network and do not take into account the wireless shared medium and energy consumption. Abraham et al introduce a new class of asynchronous distributed algorithms for explicit flow control in an integrated packet network [28]. Kucera et al analyze power and rate control for wireless ad hoc networks with stochastic channels and propose a game-theory based asynchronous distributed algorithm.…”

Section: Related Workmentioning

confidence: 99%

Utility-based asynchronous flow control algorithm for wireless sensor networks

Chen

et al. 2010

IEEE J. Select. Areas Commun.

143

View full text Add to dashboard Cite

Abstract-In this paper, we formulate a flow control optimization problem for wireless sensor networks with lifetime constraint and link interference in an asynchronous setting. Our formulation is based on the network utility maximization framework, in which a general utility function is used to characterize the network performance such as throughput. To solve the problem, we propose a fully asynchronous distributed algorithm based on dual decomposition, and theoretically prove its convergence. The proposed algorithm can achieve the maximum utility. Extensive simulations are conducted to demonstrate the efficiency of our algorithm and validate the analytical results.

show abstract

Section: Related Workmentioning

confidence: 99%

Utility-based asynchronous flow control algorithm for wireless sensor networks

Chen

et al. 2010

IEEE J. Select. Areas Commun.

143

View full text Add to dashboard Cite

show abstract

“…Consider the vector process (2) This process is hard to analyze directly. Instead, we study an embedded process, which with suitable approximations, turns out to be analytically tractable.…”

Section: B Analysis Of the Queueing Modelmentioning

confidence: 99%

“…Thus, the bandwidth available to elastic traffic is time varying and stochastic. Effective rate-control mechanisms for ABR can be designed even with stochastic variations in bottleneck bandwidth (see [2]). TCP has an adaptive window-control mechanism where the window size oscillates periodically, even when the network capacity does not change.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

TCP performance over end-to-end rate control and stochastic available capacity

Shakkottai

Kumar

Karnik

et al. 2001

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

Motivated by TCP over end-to-end ABR, we study the performance of adaptive window congestion control, when it operates over an explicit feedback rate-control mechanism, in a situation in which the bandwidth available to the elastic traffic is stochastically time varying. It is assumed that the sender and receiver of the adaptive window protocol are colocated with the rate-control endpoints. The objective of the study is to understand if the interaction of the rate-control loop and the window-control loop is beneficial for end-to-end throughput, and how the parameters of the problem (propagation delay, bottleneck buffers, and rate of variation of the available bottleneck bandwidth) affect the performance.The available bottleneck bandwidth is modeled as a two-state Markov chain. We develop an analysis that explicitly models the bottleneck buffers, the delayed explicit rate feedback, and TCP's adaptive window mechanism. The analysis, however, applies only when the variations in the available bandwidth occur over periods larger than the round-trip delay. For fast variations of the bottleneck bandwidth, we provide results from a simulation on a TCP testbed that uses Linux TCP code, and a simulation/emulation of the network model inside the Linux kernel.We find that, over end-to-end ABR, the performance of TCP improves significantly if the network bottleneck bandwidth variations are slow as compared to the round-trip propagation delay. Further, we find that TCP over ABR is relatively insensitive to bottleneck buffer size. These results are for a short-term average link capacity feedback at the ABR level (INSTCAP). We use the testbed to study EFFCAP feedback, which is motivated by the notion of the effective capacity of the bottleneck link. We find that EFFCAP feedback is adaptive to the rate of bandwidth variations at the bottleneck link, and thus yields good performance (as compared to INSTCAP) over a wide range of the rate of bottleneck bandwidth variation. Finally, we study if TCP over ABR, with EFFCAP feedback, provides throughput fairness even if the connections have different round-trip propagation delays.

show abstract

“…The basic approach is to work with primal-dual decomposition so that only one price (Lagrange multiplier) needs to be kept updated at each link for the solution of the primal problem [KEL98,ABR01,LOW99]. Such framework based on convex duality uses the fundamental assumption that utility functions are all concave.…”

Section: Related Workmentioning

confidence: 99%