Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

General AIMD with Congestion Window Upper Bound

Full metadata record
DC Field Value Language
dc.contributor.authorDang-Quang Bui-
dc.contributor.author최명길-
dc.contributor.author황원주-
dc.date.available2019-08-20T05:00:16Z-
dc.date.issued2010-
dc.identifier.issn1229-7771-
dc.identifier.urihttps://scholarworks.bwise.kr/cau/handle/2019.sw.cau/34697-
dc.description.abstractTCP 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.extent7-
dc.publisher한국멀티미디어학회-
dc.titleGeneral AIMD with Congestion Window Upper Bound-
dc.title.alternativeGeneral AIMD with Congestion Window Upper Bound-
dc.typeArticle-
dc.identifier.bibliographicCitation멀티미디어학회논문지, v.13, no.12, pp 1798 - 1804-
dc.identifier.kciidART001519687-
dc.description.isOpenAccessN-
dc.citation.endPage1804-
dc.citation.number12-
dc.citation.startPage1798-
dc.citation.title멀티미디어학회논문지-
dc.citation.volume13-
dc.publisher.location대한민국-
dc.subject.keywordAuthorTCP-
dc.subject.keywordAuthorAIMD-
dc.subject.keywordAuthorGeneral AIMD-
dc.subject.keywordAuthorWireless Networks-
dc.subject.keywordAuthorOptimization-
dc.description.journalRegisteredClasskci-
Files in This Item
There are no files associated with this item.
Appears in
Collections
College of Business & Economics > School of Business Administration > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher Choi, Myeong Gil photo

Choi, Myeong Gil
경영경제대학 (경영학부(서울))
Read more

Altmetrics

Total Views & Downloads

BROWSE