✦ LIBER ✦

Analysis of MIMD congestion control algorithm for high speed networks

✍ Scribed by E. Altman; K. Avrachenkov; C. Barakat; A.A. Kherani; B.J. Prabhu

Book ID: 108101088
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 489 KB
Volume: 48
Category: Article
ISSN: 1389-1286
DOI: 10.1016/j.comnet.2004.11.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Performance study of congestion control

Performance study of congestion control for high-speed backbone networks

✍ Hiroshi Inai; Kazuhiro Ohtsuki 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 744 KB

Bandwidth management and congestion cont

Bandwidth management and congestion control of high-speed networks

✍ Serge Fdida; Don Towsley 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 176 KB

On delay robustness analysis of a simple

On delay robustness analysis of a simple control algorithm in high-speed networks

✍ Silviu-Iulian Niculescu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 132 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

An adaptive survivability admission cont

An adaptive survivability admission control algorithm using backup path for high-speed networks

✍ Chi-Chun Lo; Bin-Wen Chuang 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

Linear-speed interior-path algorithms fo

Linear-speed interior-path algorithms for distributed control of information networks

✍ Hanhua Feng; Cathy Xia; Zhen Liu; Li Zhang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 509 KB

Many network-based problems are naturally distributed optimization problems. Examples include routing and flow control in wireless sensor networks, congestion pricing on the Internet, and resource allocation in distributed data-processing systems. Most of the distributed solutions provided by existi