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

Lars O. G. Kristiansson

dblp:273/0718 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1974
—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 · 100%

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

TopicWeightPapersLastEvidence papers
Network performance modeling › queueing analysis
buffer overflow probability
0.011974
The Behavior of a Hold-and-Forward Concentrator for a Type of Dependent Interarrival Statistics · IEEE Trans. Commun. 1974
Network performance modeling
queueing analysis
0.011974
The Behavior of a Hold-and-Forward Concentrator for a Type of Dependent Interarrival Statistics · IEEE Trans. Commun. 1974

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

hold-and-forward concentrator model · 0.0dependent interarrival statistics · 0.0
YearPublicationVenuePosition
1974 The Behavior of a Hold-and-Forward Concentrator for a Type of Dependent Interarrival Statistics
abstract
Up till now (Chu [1], Rudin [3]), the overflow probabilities of a hold-and-forward concentrator have been determined assuming that the pooled traffic of a number of terminal users at the input of the concentrator has a completely independent interarrival statistic between the characters. A closer analysis of the data going from one user to a computer shows that the user burst segments are separated in time by the total sum of idle time, computer burst segment time, and think time. Therefore, the interarrival statistic between two user burst segments cannot be of the negative exponential type. Starting from a more realistic interarrival statistic, it then follows that the interarrivals for the pooled user traffic are dependent. With this new model, the overflow probabilities have been determined as a function of the number of user terminals, traffic intensity, buffer capacity, and user terminal statistics.
G. C. Groenendaal, Lars O. G. Kristiansson, J. B. H. Peek
IEEE Trans. Commun.2