Multiple Approximate Dynamic Programming Controllers for Congestion Control

Authors:
Yanping Xiang;Jianqiang Yi;Dongbin Zhao
Affiliations:
Key Lab of Complex Systems and Intelligence Science, Institute of Automation, Chinese Academy of Sciences, 95 Zhongguancun East Road, Haidian District, Beijing 100080, China;Key Lab of Complex Systems and Intelligence Science, Institute of Automation, Chinese Academy of Sciences, 95 Zhongguancun East Road, Haidian District, Beijing 100080, China;Key Lab of Complex Systems and Intelligence Science, Institute of Automation, Chinese Academy of Sciences, 95 Zhongguancun East Road, Haidian District, Beijing 100080, China
Venue:
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks
Year:
2007

Citing 3
Cited 0

Optimization flow control—I: basic algorithm and convergence

IEEE/ACM Transactions on Networking (TON)
Dynamic Programming

Dynamic Programming
End-to-end congestion control schemes: utility functions, random losses and ECN marks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A communication network is a highly complex nonlinear dynamical system. To avoid congestion collapse and keep network utilization high, many congestion control methods have been proposed. In this paper, a new framework, using Adaptive Critic Designs (ACD) based on Approximate Dynamic Programming (ADP) theory, is presented for network congestion control. At the present time, almost all ACD controllers are designed for centralized control system. In the new frame, the whole network is considered as a multiple non-cooperative ACDs control system, wherein, each source controller is governed by an ACD. This frame provides a new approach to solve the congestion control problem of the networks.