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.

Allan T. Andersen

dblp:77/2098 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2000
—ORCID · none

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

Computer networks · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 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
1 paper
Network performance modeling · 93% Network measurement and analytics · 7%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Network performance modeling › traffic modeling
long-range dependence
0.011998
A Markovian approach for modeling packet traffic with long-range dependence · IEEE J. Sel. Areas Commun. 1998
Network performance modeling › point process
markov modulated poisson process
0.011998
A Markovian approach for modeling packet traffic with long-range dependence · IEEE J. Sel. Areas Commun. 1998
Network performance modeling › traffic modeling
self-similar traffic
0.011998
A Markovian approach for modeling packet traffic with long-range dependence · IEEE J. Sel. Areas Commun. 1998
Network performance modeling
traffic modeling
0.011998
A Markovian approach for modeling packet traffic with long-range dependence · IEEE J. Sel. Areas Commun. 1998
Performance modeling and evaluation › queueing models
markovian arrival process
0.011997
An Application of Superpositions of Two-State Markovian Sources to the Modelling of Self-Similar Behaviour · INFOCOM 1997
Performance modeling and evaluation
queueing models
0.011997
An Application of Superpositions of Two-State Markovian Sources to the Modelling of Self-Similar Behaviour · INFOCOM 1997
Performance modeling and evaluation
workload characterization
0.011997
An Application of Superpositions of Two-State Markovian Sources to the Modelling of Self-Similar Behaviour · INFOCOM 1997
Network measurement and analytics › traffic characterization
packet traffic characterization
0.011998
A Markovian approach for modeling packet traffic with long-range dependence · IEEE J. Sel. Areas Commun. 1998

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

superposition · 0.0markov-modulated poisson process · 0.0interrupted poisson process superposition · 0.0autocorrelation fitting · 0.0
YearPublicationVenuePosition
2000 On the statistical implications of certain random permutations in Markovian arrival processes (MAPs) and second-order self-similar processes
Allan T. Andersen, Bo Friis Nielsen
Perform. Evaluation1
1998 A Markovian approach for modeling packet traffic with long-range dependence
abstract
We present a simple Markovian framework for modeling packet traffic with variability over several time scales. We present a fitting procedure for matching second-order properties of counts to that of a second-order self-similar process. Our models essentially consist of superpositions of two-state Markov modulated Poisson processes (MMPPs). We illustrate that a superposition of four two-state MMPPs suffices to model second-order self-similar behavior over several time scales. Our modeling approach allows us to fit to additional descriptors while maintaining the second-order behavior of the counting process. We use this to match interarrival time correlations.
Allan T. Andersen, Bo Friis Nielsen
IEEE J. Sel. Areas Commun.1
1997 An Application of Superpositions of Two-State Markovian Sources to the Modelling of Self-Similar Behaviour
abstract
We present a modelling framework and a fitting method for modelling second order self-similar behaviour with the Markovian arrival process (MAP). The fitting method is based on fitting to the autocorrelation function of counts a second order self-similar process. It is shown that with this fitting algorithm it is possible closely to match the autocorrelation function of counts for a second order self-similar process over 3-5 time-scales with 8-16 state MAPs with a very simple structure, i.e. a superposition of 3 and 4 interrupted Poisson processes (IPP) respectively and a Poisson process. The fitting method seems to work well over the entire range of the Hurst (1951) parameter.
Allan T. Andersen, Bo Friis Nielsen
INFOCOM1