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

Dirk Abendroth

dblp:24/4337 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2005
—ORCID · none

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

Computer networks · 4 · 4 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 optimization and economics · 56% Internet architecture and protocols · 28% Network measurement and analytics · 8%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics
admission control
0.012002
Intelligent Shaping: Well Shaped throughout the entire Network? · INFOCOM 2002
Network optimization and economics › network design › network planning
resource dimensioning
0.012002
Intelligent Shaping: Well Shaped throughout the entire Network? · INFOCOM 2002
Internet architecture and protocols
traffic shaping
0.012002
Intelligent Shaping: Well Shaped throughout the entire Network? · INFOCOM 2002
Network performance modeling › point process
poisson arrival
0.012002
Intelligent Shaping: Well Shaped throughout the entire Network? · INFOCOM 2002
Network measurement and analytics
traffic characterization
0.012002
Intelligent Shaping: Well Shaped throughout the entire Network? · INFOCOM 2002

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

queueing model · 0.0nonparametric test · 0.0
YearPublicationVenuePosition
2005 A Multiple Time-Scale Model for TCP Bandwidth Sharing Under User Heterogeneity
Dirk Abendroth, Hans van den Berg, Michel Mandjes
NETWORKING1
2005 Effective bandwidth shaping: a framework for resource dimensioning - extended version
Dirk Abendroth, Ulrich Killat
Comput. Commun.1
2002 The interaction between TCP and traffic shapers - clever alternatives to the leaky bucket
abstract
The Differentiated Services (DiffServ) architecture has been defined for implementing scalable service differentiation in the Internet. DiffServ edge routers employ traffic conditioners that contain meter, marker and shaper functionalities. The way of traffic shaping in traffic conditioners is an open issue and we believe, using intelligent shaping algorithms instead of leaky bucket algorithms (LBA) could increase the network performance significantly. We present two new shaping algorithms for variable packet size networks that emit packet streams which behave in a certain sense better than Poisson streams and compare them to the leaky bucket algorithm (LBA). The introduced shaping algorithms are proven to perform better than LBA and furthermore provide a means to network providers to answer the questions of network dimensioning.
Dirk Abendroth, Kai Below, Ulrich Killat
GLOBECOM1
2002 Intelligent Shaping: Well Shaped throughout the entire Network?
abstract
In this article we present a new class of traffic shapers that make up the shaping decision whether to delay or pass a packet by comparing a measured distribution specifying the arrival stream to a given reference distribution. Rather than simply comparing average values this shaper emits data streams with property 'better than reference distribution' by employing a kind of nonparametric test. If all incoming data streams of the network considered are shaped according to 'better than Poisson', network dimensioning is simplified in the sense that multiplexer performance can be predicted conservatively by assuming Poisson arrivals, hence, admission control and resource dimensioning can be based on a simple M/D/1 queueing model. The presented shaping algorithm thereby provides an analytical tool for network providers to calculate upper bounds on the load in a network fed with accordingly shaped streams only. Our simulations show that the shaper presented emits data streams with corresponding distribution function almost identical to (or better than) reference distribution independent of the input arrival process but on the other hand introduces no serious delays if the arriving stream is already 'better than reference'. Moreover the shaper is mostly robust in terms of shaping parameters and initial conditions and has the capability to remove correlations of the passing stream.
Dirk Abendroth, Ulrich Killat
INFOCOM1