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

Kelvin K. Lee

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

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

Computer networks · 4 · 4 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
2 papers
Physical-layer communications · 70% Network performance modeling · 30%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding
0.122006
Analysis of a Delay-Constrained Hybrid ARQ Wireless System · IEEE Trans. Commun. 2006
Analysis of a Delay-Constrained Hybrid ARQ Wireless System · IEEE Trans. Commun. 2006
Physical-layer communications › channel coding
hybrid ARQ
0.122006
Analysis of a Delay-Constrained Hybrid ARQ Wireless System · IEEE Trans. Commun. 2006
Analysis of a Delay-Constrained Hybrid ARQ Wireless System · IEEE Trans. Commun. 2006
Network performance modeling › packet loss
packet loss probability
0.122006
Analysis of a Delay-Constrained Hybrid ARQ Wireless System · IEEE Trans. Commun. 2006
Analysis of a Delay-Constrained Hybrid ARQ Wireless System · IEEE Trans. Commun. 2006
Physical-layer communications › wireless communication systems
wireless system performance
0.122006
Analysis of a Delay-Constrained Hybrid ARQ Wireless System · IEEE Trans. Commun. 2006
Analysis of a Delay-Constrained Hybrid ARQ Wireless System · IEEE Trans. Commun. 2006
Network performance modeling › quality-of-service guarantees
effective bandwidth
0.022006
Analysis of a Delay-Constrained Hybrid ARQ Wireless System · IEEE Trans. Commun. 2006
Analysis of a Delay-Constrained Hybrid ARQ Wireless System · IEEE Trans. Commun. 2006

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

markov chain · 0.1delay model · 0.1
YearPublicationVenuePosition
2006 Analysis of a Delay-Constrained Hybrid ARQ Wireless System
abstract
A real-time wireless system using hybrid automatic repeat request to correct errors is analyzed. Packet errors are modeled by a two-state Markov chain, and batch packet arrivals are allowed. Packets are dropped at the sender if their delays exceed a time limit, possibly after a number of retransmissions. Using the delay-model approach, a closed-form expression of packet-loss probability (PLP) and an approximate formula of wireless effective bandwidth (WEB) satisfying the quality of service requirements have been derived. If Bose–Chaudhuri–Hocquengem codes are used, an expression estimating the number of correctable bits to minimize the PLP has also been obtained. Moreover, the WEB is found to be independent of the packet size, and the PLP decreases exponentially as the WEB increases.
Kelvin K. Lee, Samuel T. Chanson
IEEE Trans. Commun.1
2006 Analysis of a Delay-Constrained Hybrid ARQ Wireless System
abstract
A real-time wireless system using hybrid automatic repeat request to correct errors is analyzed. Packet errors are modeled by a two-state Markov chain, and batch packet arrivals are allowed. Packets are dropped at the sender if their delays exceed a time limit, possibly after a number of retransmissions. Using the delay-model approach, a closed-form expression of packet-loss probability (PLP) and an approximate formula of wireless effective bandwidth (WEB) satisfying the quality of service requirements have been derived. If Bose-Chaudhuri-Hocquenghem codes are used, an expression estimating the number of correctable bits to minimize the PLP has also been obtained. Moreover, the WEB is found to be independent of the packet size, and the PLP decreases exponentially as the WEB increases
Kelvin K. Lee, Samuel T. Chanson
IEEE Trans. Commun.1
1996 Dynamic behavior analysis of cell loss control mechanisms in ATM networks
Kelvin K. Lee, Samuel T. Chanson
Comput. Commun.1
1995 Transient analysis of cell loss control mechanisms in ATM networks
abstract
A new technique is developed to analyze the cell loss behavior of individual connections in finite intervals for ATM networks. The technique is applied to partial buffer sharing (PBS) in deriving formulae for calculating cell loss rate and queue length distributions for each cell class in a single connection in finite intervals. To maximize network utilization, a new and more flexible cell loss control mechanism called threshold-based loss balancing (TLB) is proposed which restricts the violation probability of each cell class. Comparisons of TLB and PBS on selected operating conditions reveal that TLB can accept more connections under the same workload conditions. PBS is shown to be a special case of TLB.
Kelvin K. Lee, Samuel T. Chanson
ICCCN1