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

Tak-Shing P. Yum

dblp:271/5154 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1984
—ORCID · none

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

Computer networks · 2 · 2 first-authorSystems, architecture and hardware · 1 · 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
2 papers
Routing and switching · 77% Network performance modeling · 15% Network optimization and economics · 8%

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

TopicWeightPapersLastEvidence papers
Routing and switching
adaptive routing		 0.011981
The Join-Biased-Queue Rule and Its Application to Routing in Computer Communication Networks · IEEE Trans. Commun. 1981
Routing and switching › routing algorithms
deterministic routing		 0.011981
The Design and Analysis of a Semidynamic Deterministic Routing Rule · IEEE Trans. Commun. 1981
Routing and switching
routing algorithms		 0.011981
The Design and Analysis of a Semidynamic Deterministic Routing Rule · IEEE Trans. Commun. 1981
Network performance modeling
delay analysis		 0.011981
The Join-Biased-Queue Rule and Its Application to Routing in Computer Communication Networks · IEEE Trans. Commun. 1981
Network performance modeling
delay performance		 0.011981
The Design and Analysis of a Semidynamic Deterministic Routing Rule · IEEE Trans. Commun. 1981

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

stochastic routing comparison · 0.0stochastic routing analysis · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
1984 Buffer allocation strategies with blocking requirements
Tak-Shing P. Yum, C. Dou
 Perform. Evaluation1
1981 The Design and Analysis of a Semidynamic Deterministic Routing Rule
abstract
The best deterministic rule, newly proposed in this paper is similar in nature to the best stochastic rule [3], except that 1) a maximum traffic bifurcation flow distribution is chosen and 2) deterministic routing sequences are used. Analysis shows that the best deterministic rule always gives better delay performance than the best stochastic rule. A semidynamic version of this rule is introduced for use in a varying traffic rate environment.
Tak-Shing P. Yum
 IEEE Trans. Commun.1
1981 The Join-Biased-Queue Rule and Its Application to Routing in Computer Communication Networks
abstract
A routing rule similar in nature to delta-routing [8] is studied in this paper. The approach is to superimpose, local adaptivity on top of a fixed traffic flow distribution. The fixed flow distribution we choose is obtained from the best stochastic (BS) rule [3]. The adaptive part is called the join-biased-queue (JBQ) rule. The resultant JBQ-BS rule is analyzed on small networks and is shown to provide 10-27 percent delay improvement over the BS rule.
Tak-Shing P. Yum, Mischa Schwartz
 IEEE Trans. Commun.1