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

Yan He Fan

dblp:47/4132 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1993
—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
Network performance modeling · 39% Internet architecture and protocols · 30% Network measurement and analytics · 30%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
ATM networks		 0.011993
Interdeparture Processes of Traffic from ATM Networks · INFOCOM 1993
Network performance modeling
queueing analysis		 0.011993
Interdeparture Processes of Traffic from ATM Networks · INFOCOM 1993
Network measurement and analytics
traffic characterization		 0.011993
Interdeparture Processes of Traffic from ATM Networks · INFOCOM 1993
Network performance modeling › queueing analysis
priority queueing		 0.011993
Interdeparture Processes of Traffic from ATM Networks · INFOCOM 1993

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

switched determined process · 0.0batch bernoulli process · 0.0
YearPublicationVenuePosition
1993 Interdeparture Processes of Traffic from ATM Networks
abstract
Interdeparture processes in asynchronous transfer mode (ATM) networks are studied for both real-time traffic and non-real-time traffic. The cell arrival process is assumed to consist of several switched determined processes (SDPs) and a batch Bernoulli process. A priority queue and an ordinary queue are set for real-time traffic and non-real-time traffic, respectively, with the priority queue having higher priority for service. Expressions for the probability densities of the interdeparture times are derived for both kinds of traffic, and some numerical results are given.>
Jian Li Wang, Jiong Pan Zhou, Yan He Fan
 INFOCOM4