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

E. D.-S. Ho

dblp:30/42 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1987
—ORCID · none

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

Computer networks · 1Software engineering, systems software and programming languages · 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% Physical-layer communications · 13%

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

TopicWeightPapersLastEvidence papers
Network performance modeling › queueing analysis
buffer overflow probability
0.011987
Engineering Calculation of Overflow Probabilities in Buffers with Markov-Interrupted Service · IEEE Trans. Commun. 1987
Network performance modeling
queueing analysis
0.011987
Engineering Calculation of Overflow Probabilities in Buffers with Markov-Interrupted Service · IEEE Trans. Commun. 1987
Physical-layer communications
fading channels
0.011987
Engineering Calculation of Overflow Probabilities in Buffers with Markov-Interrupted Service · IEEE Trans. Commun. 1987

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

tail approximation · 0.0markov-modulated service · 0.0m/g/1 approximation · 0.0
YearPublicationVenuePosition
1987 Engineering Calculation of Overflow Probabilities in Buffers with Markov-Interrupted Service
abstract
Interrupted service, which may occur in fading radio channels, in low-priority channels which can be preempted or in systems with failures may make severe demands on buffer size if overflow is to be avoided. This paper analyzes a buffer with a Markov-interrupted timeslotted server, generalizing earlier work on independent random interruptions. An equivalent service distribution is defined for use in an approximateM/G/1model, which in turn gives buffer probabilities and overflow probabilities. For very small overflow probabilities, the necessary buffer size is found from a further analytic approximation to the tail of the buffer size distribution. The accuracy of the two approximations together is good, shown by an example of a fading radio channel.
C. Murray Woodside, E. D.-S. Ho
IEEE Trans. Commun.2
1986 An "Active Server" model for the performance of parallel programs written using rendezvous
C. Murray Woodside, E. Neron, E. D.-S. Ho, B. Mondoux
J. Syst. Softw.3