General AIMD with Congestion Window Upper Bound
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dang-Quang Bui | - |
dc.contributor.author | 최명길 | - |
dc.contributor.author | 황원주 | - |
dc.date.available | 2019-08-20T05:00:16Z | - |
dc.date.issued | 2010 | - |
dc.identifier.issn | 1229-7771 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/34697 | - |
dc.description.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. | - |
dc.format.extent | 7 | - |
dc.publisher | 한국멀티미디어학회 | - |
dc.title | General AIMD with Congestion Window Upper Bound | - |
dc.title.alternative | General AIMD with Congestion Window Upper Bound | - |
dc.type | Article | - |
dc.identifier.bibliographicCitation | 멀티미디어학회논문지, v.13, no.12, pp 1798 - 1804 | - |
dc.identifier.kciid | ART001519687 | - |
dc.description.isOpenAccess | N | - |
dc.citation.endPage | 1804 | - |
dc.citation.number | 12 | - |
dc.citation.startPage | 1798 | - |
dc.citation.title | 멀티미디어학회논문지 | - |
dc.citation.volume | 13 | - |
dc.publisher.location | 대한민국 | - |
dc.subject.keywordAuthor | TCP | - |
dc.subject.keywordAuthor | AIMD | - |
dc.subject.keywordAuthor | General AIMD | - |
dc.subject.keywordAuthor | Wireless Networks | - |
dc.subject.keywordAuthor | Optimization | - |
dc.description.journalRegisteredClass | kci | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.