General AIMD with Congestion Window Upper Bound

General AIMD with Congestion Window Upper Bound

초록

TCP with AIMD mechanism, one of the most popular protocols in internet, can solve congestion control in wired networks. This protocol, however, is not efficient in wireless networks. This paper proposes a new mechanism namely General AIMD with Congestion Window Upper Bound in which congestion window is limited by an upper bound. By applying optimization theory, we find an optimal policy for congestion window upper bound to maximize network throughput.

키워드

TCP; AIMD; General AIMD; Wireless Networks; Optimization
제목
General AIMD with Congestion Window Upper Bound
제목 (타언어)
General AIMD with Congestion Window Upper Bound
저자
Dang-Quang Bui; 최명길; 황원주
발행일
2010
저널명
멀티미디어학회논문지
권
13
호
12
페이지
1798 ~ 1804