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

David L. Jagerman

dblp:67/4009 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2008
—ORCID · none

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

Systems, architecture and hardware · 2Theory of computation · 2 · 2 first-authorComputer 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 measurement and analytics · 44% Network performance modeling · 44% Internet architecture and protocols · 13%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Network measurement and analytics › traffic characterization
burstiness measure
0.011997
Peakedness Measures for Traffic Characterization in High-Speed Networks · INFOCOM 1997
Network performance modeling › queueing analysis
fluid model
0.011997
Peakedness Measures for Traffic Characterization in High-Speed Networks · INFOCOM 1997
Network performance modeling
statistical multiplexing
0.011997
Peakedness Measures for Traffic Characterization in High-Speed Networks · INFOCOM 1997
Network measurement and analytics
traffic characterization
0.011997
Peakedness Measures for Traffic Characterization in High-Speed Networks · INFOCOM 1997
Internet architecture and protocols
ATM networks
0.011997
Peakedness Measures for Traffic Characterization in High-Speed Networks · INFOCOM 1997
Internet architecture and protocols › ATM networks
variable bit rate traffic
0.011997
Peakedness Measures for Traffic Characterization in High-Speed Networks · INFOCOM 1997
Information theory › signal processing › sampling theory
sampling theorem
0.011956
Some general aspects of the sampling theorem · IRE Trans. Inf. Theory 1956
Information theory › signal processing
sampling theory
0.011956
Some general aspects of the sampling theorem · IRE Trans. Inf. Theory 1956

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

stochastic modeling · 0.0queueing analysis · 0.0lagrange polynomial · 0.0fourier-stieltjes representation · 0.0
YearPublicationVenuePosition
2008 Merging and splitting autocorrelated arrival processes and impact on queueing performance
Baris Balcioglu, David L. Jagerman, Tayfur Altiok
Perform. Evaluation2
2008 M/G/1 queue with deterministic reneging times
David L. Jagerman, Tayfur Altiok
Perform. Evaluation2
1997 Peakedness Measures for Traffic Characterization in High-Speed Networks
abstract
In high-speed networks based on asynchronous transfer mode (ATM), variable bit rate (VBR) sources generate bursty cell streams which share the link bandwidth wherever multiplexing occurs. In theory, the bandwidth requirement per stream to support a given quality-of-service at a multiplexer should generally decrease as the number of streams increases. In practice, high statistical multiplexing gain is difficult to achieve because good traffic characterizations are usually not available. This paper proposes the use of peakedness-based measures to capture the statistical information from traffic streams needed to determine bandwidth allocations. The standard definition of peakedness applies only to point process models of traffic. Yet fluid models of traffic have certain advantages in terms of tractability. Hence, we introduce a new measure called modified peakedness, which encompasses point process and fluid models under a common framework. We develop some of its properties and specialize it to several common traffic models. Finally, we study the effectiveness of the peakedness/modified peakedness as burstiness measures for real-time traffic.
Brian L. Mark, David L. Jagerman, Gopalakrishnan Ramamurthy
INFOCOM2
1995 Spectral Analysis of Basic TES Processes
abstract
This paper studies the spectral properties of a class of stochastic sequences generated by basic TES (Transform-Expand-Sample) methods, as well as transformed TES sequences. A TES sequence is obtained as a marginally uniform process from an autoregressive scheme with modulo-1 reduction, followed by additional transformations. We derive formulas for the spectral density function and the spectral distribution function which are suitable for efficient numerical computation. A set of examples is calculated and exhibited for TES processes with uniform and exponential marginals. The results contribute to the understanding of TES sequences as models of autocorrelated sequences, particularly in a Monte Carlo simulation context. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
David L. Jagerman, Benjamin Melamed
INFORMS J. Comput.1
1956 Some general aspects of the sampling theorem
abstract
The sampling theorem is recognized as an interpolation formula. Starting from the Lagrange Polynomial, this theorem is developed under conditions which are of broader applicability than those usually stated. Such a view point indicates the essential unity of temporal and frequency domain application. It will also be shown that the theorem is applicable as an exact interpolation formula throughout the complex plane. The basic theorem is extended to include sampling of the first derivative of the function. The concept of band-limited functions is introduced through use of Fourier-Stieltjes representations. This is then shown to be subsumed under the general class of functions which is considered in connection with the interpolation theorems developed. This approach, as presented, readily leads to the establishment of many sampling theorems. It is hoped that this paper will aid the formulation of particularly applicable sampling theorems for specific problems.
David L. Jagerman, Lawrence J. Fogel
IRE Trans. Inf. Theory1