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

C. Y. Lo

dblp:123/8876 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1990
—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 · 87% Routing and switching · 13%

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

TopicWeightPapersLastEvidence papers
Network performance modeling › queueing analysis
priority queueing
0.011990
Mean message delays for two packet-FIFO queueing disciplines · IEEE Trans. Commun. 1990
Network performance modeling
queueing analysis
0.011990
Mean message delays for two packet-FIFO queueing disciplines · IEEE Trans. Commun. 1990
Routing and switching
packet switching
0.011990
Mean message delays for two packet-FIFO queueing disciplines · IEEE Trans. Commun. 1990

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

queueing theory · 0.0analytic modeling · 0.0
YearPublicationVenuePosition
1990 Mean message delays for two packet-FIFO queueing disciplines
abstract
Expressions are derived for the mean message delay, as a function of message length, when data messages of different lengths arrive asynchronously at a trunk and are divided, as they come in, into packets of some maximum length. The packets of different messages are intermingled and are put onto the trunk either from a single first-in-first-out (FIFO) queue, or from a high-priority and a low-priority queue for single-packet and multiple-packet messages, respectively. The results are compared to the case in which messages enter service in order of arrival and each message is served to completion without interruption, so that the mean message delay is independent of message length.>
Samuel P. Morgan, C. Y. Lo
IEEE Trans. Commun.2