Dergiler / Turkish Journal of Electrical Engineering and Computer Science / 2004 / Cilt: 12 - Sayı: 3

Global Stability Analysis of an End-to-End Congestion Control Scheme for General Topology Networks with Delay

Sayfa
151–166
Yayın Tarihi
2004-03-01
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

We further demonstrate the stability of the algorithm numerically for various delays, user numbers, and topologies

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:We analyze the stability properties of an end-to-end congestion control scheme under fixed heterogeneous delays, and for general network topologies.
📊
Temel Bulgular & Veri:The scheme analyzed is based on the congestion control game of [1], with the starting point being the unique Nash equilibrium of that game.
💡
Sonuç & Katkı:We further demonstrate the stability of the algorithm numerically for various delays, user numbers, and topologies
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Turk. J. Elec. Eng. & Comp. Sci. · (2004) · 151-166. Full text: pdf Other articles published in the same issue: Turk. J. Elec. Eng. & Comp. Sci.

Özet

We analyze the stability properties of an end-to-end congestion control scheme under fixed heterogeneous delays, and for general network topologies. The scheme analyzed is based on the congestion control game of [1], with the starting point being the unique Nash equilibrium of that game. We prove global stability of this solution (and hence of the congestion control algorithm) under a mild symmetricity condition. We further demonstrate the stability of the algorithm numerically for various delays, user numbers, and topologies

Abstract

We analyze the stability properties of an end-to-end congestion control scheme under fixed heterogeneous delays, and for general network topologies. The scheme analyzed is based on the congestion control game of [1], with the starting point being the unique Nash equilibrium of that game. We prove global stability of this solution (and hence of the congestion control algorithm) under a mild symmetricity condition. We further demonstrate the stability of the algorithm numerically for various delays, user numbers, and topologies

🔖

Bu Makaleye Atıf Yap

ALPCAN, T., BAŞAR, T. (2004). Global Stability Analysis of an End-to-End Congestion Control Scheme for General Topology Networks with Delay. Turkish Journal of Electrical Engineering and Computer Science, Cilt: 12 - Sayı: 3, 151–166. https://ajindex.com/articles/189005

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...