Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ji-Cheol Moon

dblp:70/6527 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Transport protocols and congestion control · 77% Wireless networking · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control
TCP performance
0.112006
Rate-adaptive snoop: a TCP enhancement scheme over rate-controlled lossy links · IEEE/ACM Trans. Netw. 2006
Wireless networking
wireless link
0.012006
Rate-adaptive snoop: a TCP enhancement scheme over rate-controlled lossy links · IEEE/ACM Trans. Netw. 2006

Methods — techniques the papers use, named apart from their topics

rate adaptation · 0.1
YearPublicationVenuePosition
2006 Rate-adaptive snoop: a TCP enhancement scheme over rate-controlled lossy links
Ji-Cheol Moon, Byeong Gi Lee
IEEE/ACM Trans. Netw.1
2001 Rate adaptive packet dropping scheme for TCP traffic over rate-controlled links
abstract
We study a gateway congestion control scheme for TCP traffic in an internetwork consisting of both rate-controlled and non-rate-controlled links. In this network scenario, TCP window-based congestion control and rate-based congestion control at a rate-controlled link may not interact in a harmonious way. So, we present a packet dropping scheme called rate adaptive dropping (RAD) as a means for reconciling the mismatch between window-based and rate-based congestion controls. The main idea of RAD is to drop arriving packets depending on the rate feedback information so that dropped packets may notify TCP sources of incipient congestion before the gateway buffer overflows. We compare the performance of RAD with that of tail drop in terms of goodput and drop ratio. Results from simulations show that RAD achieves significant improvements over tail drop, especially when the gateway buffer size is around the bandwidth delay product or less.
Ji-Cheol Moon, Byeong Gi Lee
ICC1