Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
General AIMD with Congestion Window Upper BoundGeneral AIMD with Congestion Window Upper Bound
- Authors
- Dang-Quang Bui; 최명길; 황원주
- Issue Date
- 2010
- Publisher
- 한국멀티미디어학회
- Keywords
- TCP; AIMD; General AIMD; Wireless Networks; Optimization
- Citation
- 멀티미디어학회논문지, v.13, no.12, pp 1798 - 1804
- Pages
- 7
- Journal Title
- 멀티미디어학회논문지
- Volume
- 13
- Number
- 12
- Start Page
- 1798
- End Page
- 1804
- ISSN
- 1229-7771
- Abstract
- 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.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.