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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Jun-Kyun Choi

dblp:82/11511 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · none

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

Computer networks · 2 · 1 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 · 91% Routing and switching · 9%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › error control
acknowledgement schemes		 0.011989
On acknowledgement schemes of sliding window flow control · IEEE Trans. Commun. 1989
Transport protocols and congestion control
flow control		 0.011989
On acknowledgement schemes of sliding window flow control · IEEE Trans. Commun. 1989
Transport protocols and congestion control › flow control
sliding window flow control		 0.011989
On acknowledgement schemes of sliding window flow control · IEEE Trans. Commun. 1989
Routing and switching › packet switching
x.25 protocol		 0.011989
On acknowledgement schemes of sliding window flow control · IEEE Trans. Commun. 1989

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

simulation · 0.0queueing analysis · 0.0
YearPublicationVenuePosition
2012 Ant colony based self-adaptive energy saving routing for energy efficient Internet
Hea-Sook Park, Jun-Kyun Choi, Hong-Shik Park
 Comput. Networks4
1989 On acknowledgement schemes of sliding window flow control
abstract
An investigation is conducted of two acknowledgment schemes for sliding window flow control in packet communications: the delayed acknowledgment (D-ACK) scheme and the window acknowledgment (W-ACK) scheme. It is shown that the acknowledgment scheme of the link layer of the X.25 protocol can be modeled by the D-ACK scheme and that of the packet layer by the W-ACK scheme. The efficiencies of these acknowledgment schemes are shown by the mean number of acknowledgment control frames generated for the transmission of a single information frame, the transmission blocking probability, and the mean transmission time of data frames. Numerical and simulation results showing that the D-ACK scheme with an appropriately selected value of predetermined waiting time is better than the W-ACK scheme are presented.>
Jun-Kyun Choi, Chong Kwan Un
 IEEE Trans. Commun.1