Demo Data from VLDB 2026 / reviewers in the wild / expert
C. H. C. Leung
dblp:66/1814
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1992
—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 · 61% Internet architecture and protocols · 30% Physical-layer communications · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Transport protocols and congestion control › error control
automatic repeat request |
0.0 | 1 | 1988 | The throughput efficiency of the go-back-N ARQ scheme under Markov and related error structures · IEEE Trans. Commun. 1988 |
Internet architecture and protocols › layered network architecture
data link layer |
0.0 | 1 | 1988 | The throughput efficiency of the go-back-N ARQ scheme under Markov and related error structures · IEEE Trans. Commun. 1988 |
Transport protocols and congestion control › error control › automatic repeat request
go-back-n |
0.0 | 1 | 1988 | The throughput efficiency of the go-back-N ARQ scheme under Markov and related error structures · IEEE Trans. Commun. 1988 |
Physical-layer communications
transmission error |
0.0 | 1 | 1988 | The throughput efficiency of the go-back-N ARQ scheme under Markov and related error structures · IEEE Trans. Commun. 1988 |
Methods — techniques the papers use, named apart from their topics
markov chain analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | A new efficient ARQ scheme for satellite communications
C. H. C. Leung, Y. Kikumoto, Søren-Aksel Sørensen, S. O. Falaki |
Comput. Networks ISDN Syst. | 1 |
| 1988 | The throughput efficiency of the go-back-N ARQ scheme under Markov and related error structuresabstractA formula for the go-back-N ARQ (automatic repeat request) scheme applicable to Markov error patterns is derived. It is a generalization of the well-known efficiency formula p/(p+m(1-p)) (where m is the round trip delay in number of block durations and p is the block transmission success probability), and it has been successfully validated against simulation measurements. It is found that for a given error rate, error patterns having zero correlation between successive transmission generally fare better than those with negative correlation, and that error patterns with positive correlation fare better still. It is shown that the present analysis can be extended in a straightforward manner to cope with error patterns of a more complex nature. Simple procedures for numerical evaluation of efficiency under quite general error structures are presented.> C. H. C. Leung, Y. Kikumoto, Søren-Aksel Sørensen |
IEEE Trans. Commun. | 1 |