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

Gunnar F. W. Fredrikson

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

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

Computer networks · 2 · 2 first-author

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
2 papers
Network performance modeling · 77% Wireless networking · 23%

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

TopicWeightPapersLastEvidence papers
Wireless networking
channel assignment
0.011974
Analysis of Channel Utilization in Traffic Concentrators · IEEE Trans. Commun. 1974
Network performance modeling › queueing analysis › queueing models of computer systems
discrete-time queue
0.011974
Buffer Behavior for Binomial Input and Constant Service · IEEE Trans. Commun. 1974
Network performance modeling
queueing analysis
0.011974
Buffer Behavior for Binomial Input and Constant Service · IEEE Trans. Commun. 1974

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

queueing analysis · 0.0imbedded markov chains · 0.0
YearPublicationVenuePosition
1974 Analysis of Channel Utilization in Traffic Concentrators
abstract
The behavior of line concentrators in a data communication system has been analyzed for different channel allocation strategies. The users (terminals) are divided into classes according to their transmission rate requirements. The different bit rate classes (BRC) can be separated by dividing the network into subnets or, alternatively, they can share one concentrator which forms outgoing channels from a common quantity of channels of a basic speed, or by splitting a high speed channel into two or more channels with lower transmission rate. The equations of state and analytical expressions for the time congestion factors have been developed for the different system models. The numerical results show that a joint concentrator arrangement requires less channel capacity than a separated concentrator system for a fixed value of the congestion probability. The results of this investigation may serve as background material for planning future data networks.
Gunnar F. W. Fredrikson
IEEE Trans. Commun.1
1974 Buffer Behavior for Binomial Input and Constant Service
abstract
An analysis of the discrete-time queuing problem: binomial input, constant message length, infinite queue length, one server, is carried out. The state probabilities are calculated using the method of imbedded Markov chains, and the results are applied to the problem of determining characteristic features in the performance of a traffic concentrator. The results are compared to the direct numerical solution of the equations of state for a finite buffer queue concentrator.
Gunnar F. W. Fredrikson
IEEE Trans. Commun.1