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

Caijun Hu

dblp:120/6640 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

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

Computer networks · 1

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
Routing and switching · 54% Network performance modeling · 46%

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

TopicWeightPapersLastEvidence papers
Routing and switching
input-queued switch		 0.011994
Maximum throughput of an input queueing packet switch with two priority classes · IEEE Trans. Commun. 1994
Routing and switching
packet switching		 0.011994
Maximum throughput of an input queueing packet switch with two priority classes · IEEE Trans. Commun. 1994
Network performance modeling › queueing analysis
priority queueing		 0.011994
Maximum throughput of an input queueing packet switch with two priority classes · IEEE Trans. Commun. 1994
Network performance modeling
queueing analysis		 0.011994
Maximum throughput of an input queueing packet switch with two priority classes · IEEE Trans. Commun. 1994
Routing and switching
switch scheduling		 0.011994
Maximum throughput of an input queueing packet switch with two priority classes · IEEE Trans. Commun. 1994

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

simulation · 0.0queueing analysis · 0.0
YearPublicationVenuePosition
1994 Maximum throughput of an input queueing packet switch with two priority classes
abstract
The maximum throughput of an N/spl times/N nonblocking packet switch with input queues and two priority classes is analyzed. Packets are of fixed length and the switch operation is slotted. Packets of both priority classes are queued when waiting for service. High-priority packets preempt low-priority ones and move ahead of all low-priority packets waiting in the queue. A new method of analysis is employed. The calculated results of the maximum throughput obtained are close to the simulation results.>
Lemin Li, Caijun Hu, Pu Liu
 IEEE Trans. Commun.2