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

Adrian E. Eckberg

dblp:91/3731 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none

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

Computer networks · 4 · 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 architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%
Computer networks
1 paper
Network performance modeling · 77% Routing and switching · 23%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
delay analysis
0.011993
Real-Time High Percentile Tracking of Quasi-Exponential Delays · INFOCOM 1993
Network performance modeling
buffer requirements
0.011988
Effects of output buffer sharing on buffer requirements in an ATDM packet switch · INFOCOM 1988
Performance modeling and evaluation
queueing models
0.011993
Real-Time High Percentile Tracking of Quasi-Exponential Delays · INFOCOM 1993
Routing and switching › switch architecture
packet switch architecture
0.011988
Effects of output buffer sharing on buffer requirements in an ATDM packet switch · INFOCOM 1988

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

quasi-exponential approximation · 0.0queueing analysis · 0.0correlation modeling · 0.0
YearPublicationVenuePosition
1997 Traffic characteristics of on-line services
abstract
This paper presents a statistical characterization of on-line service traffic. The traffic is parameterized by the call holding times, the aggregate number of bytes and the number of packets transferred during the call. Particular attention is paid to modeling the stochastic rate function describing the call arrivals. The time of day and day of the week seasonal features produce long term correlations in the arrival process. In addition, short term correlations are found to exist within the hourly time scale. The arrival rates are in general nonstationary in the mean rate. This is attributed to the daily influx of new subscribers and other exogenous influences such as promotions and advertisements that trigger increased usage. A time series modeling methodology is used to identify and quantify these features. Under suitable transformations, a stationary rendition of the arrival process is derived and characterized by the short and long term correlation coefficients. The second order characterization of the arrival process is used to predict resource usage.
K. Chandra, Adrian E. Eckberg
ISCC2
1993 Real-Time High Percentile Tracking of Quasi-Exponential Delays
abstract
In many applications certain parameters of a system should be set on the basis of some large percentiles of a delay random variable, for which the characteristics may not be known or may change slowly with time. Assuming that sample values of delays are available sequentially, the authors obtain a simple algorithm to track two key statistical characteristics of the delay. Any high percentile then may be approximated as a simple linear function of these parameters. The approach is based on a quasi-exponential assumption concerning the delays.>
Khosrow Sohraby, Adrian E. Eckberg
INFOCOM2
1990 Bandwidth Management: A Congestion Control Strategy for Broadband Packet Networks - Characterizing the Throughput-Burstiness Filter
Adrian E. Eckberg, Daniel T. Luan, David M. Lucantoni
Comput. Networks ISDN Syst.1
1988 Effects of output buffer sharing on buffer requirements in an ATDM packet switch
abstract
Broadband packet switches handling an asynchronous-time-division-multiplexing type protocol format, e.g. Starlite, can achieve buffer efficiencies by sharing buffers between output ports. It is shown that the number of buffers required with sharing, for random traffic, would be overestimated by as much as 30% at 90% traffic load if the negative correlations that naturally exist, for this type of traffic, between packet streams destined for different output ports were not taken into account. In general, the discrepancy increases as the traffic load increases, and decreases as the switch size increases. A general approach is developed for the analysis of set of queues to which the arrival streams are correlated, which could be used to assess the impacts on shared buffer requirements due to other types of stream correlation (e.g. positive correlations) that may result from other traffic assumptions.>
Adrian E. Eckberg, T.-C. Hou
INFOCOM1