✦ LIBER ✦

Local bifurcation analysis of some dual congestion control algorithms

✍ Scribed by Raina, G.

Book ID: 120528400
Publisher: IEEE
Year: 2005
Tongue: English
Weight: 697 KB
Volume: 50
Category: Article
ISSN: 0018-9286
DOI: 10.1109/TAC.2005.852566

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Delay induced Hopf bifurcation in a dual

Delay induced Hopf bifurcation in a dual model of Internet congestion control algorithm

✍ Dawei Ding; Jie Zhu; Xiaoshu Luo; Yuliang Liu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 980 KB

This paper focuses on the delay induced Hopf bifurcation in a dual model of Internet congestion control algorithms which can be modeled as a time-delay system described by a one-order delay differential equation (DDE). By choosing communication delay as the bifurcation parameter, we demonstrate that

Oscillation deduced from the Neimark-Sac

Oscillation deduced from the Neimark-Sacker bifurcation in a discrete dual Internet congestion control algorithm

✍ Yingguo Li 📂 Article 📅 2013 🏛 Springer International Publishing AG 🌐 English ⚖ 283 KB

Theoretical analysis of the SABUL conges

Theoretical analysis of the SABUL congestion control algorithm

✍ Phoemphun Oothongsap; Yannis Viniotis; Mladen Vouk 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 396 KB

Analysis and design of AIMD congestion c

Analysis and design of AIMD congestion control algorithms in communication networks

✍ R.N. Shorten; D.J. Leith; J. Foy; R. Kilduff 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 380 KB

Some observations on the dynamics of a c

Some observations on the dynamics of a congestion control algorithm

✍ Schenker, Scott; Zhang, Lixia; Clark, David D. 📂 Article 📅 1990 🏛 Association for Computing Machinery 🌐 English ⚖ 671 KB

Some observations on the dynamics of a c

Some observations on the dynamics of a congestion control algorithm

✍ Schenker, Scott; Zhang, Lixia; Clark, David D. 📂 Article 📅 1990 🏛 Association for Computing Machinery 🌐 English ⚖ 671 KB

We use simulation to make some observations about the behavior of the congestion control algorithm currently embedded in the 4.3-Tahoe BSD TCP implementation. We investigate a simple case of a few TCP connections, originating and terminating at the same pair of hosts, using a single bottleneck link.