Measurements and analysis of end-to-end Internet dynamics

Paxson, Vern

doi:10.2172/551971

Cited by 411 publications

(315 citation statements)

References 143 publications

(180 reference statements)

Supporting

Mentioning

303

Contrasting

Unclassified

Order By: Relevance

“…Further, it has been observed that OWTT variations (for opposite directions) are generally asymmetric, with different delay distributions. They also seem to be correlated with packet loss rates [19]. Periodic delay spikes and packet losses have been observed, which seem to be a consequence of routing flaps [18].…”

Section: Introductionmentioning

confidence: 87%

See 1 more Smart Citation

On Kleinrock’s Independence Assumption

Popescu

Constantinescu²

2011

Network Performance Engineering

View full text Add to dashboard Cite

Abstract. This chapter is concerned with the impact of traffic correlations on the end-to-end delay of packets in a chain of IP routers represented by an open tandem queueing system. Particular consideration is given to Kleinrock's independence assumption on the performance impact of traffic correlation on packet switched networks with Poisson arrival processes and exponential packet length distributions. According to this assumption, any traffic correlations can be ignored and the effect on delay performance is negligible, subject to sufficient traffic mixing and moderate-to-heavy traffic loads. In this context, results associated with measurements, traffic modeling and delay analysis of an actual chain of IP routers are reported from experiments conducted at the Blekinge Institute of Technology in Karlskrona, Sweden. It is shown that no experimental evidence was found in support of Kleinrock's independence assumption as traffic correlation has an adverse effect on the end-to-end delay of the tandem queueing system.

show abstract

Section: Introductionmentioning

confidence: 87%

“…Several publications report on the e2e delay performance, and both Round-Trip Time (RTT) and One-Way Transit Time (OWTT) are considered [4,6,18,19].…”

Section: Introductionmentioning

confidence: 99%

On Kleinrock’s Independence Assumption

Popescu

Constantinescu²

2011

Network Performance Engineering

View full text Add to dashboard Cite

show abstract

“…This includes two standard speech codecs (G.723.1 and G.729) widely used in those types of networks and a simulation of the packet loss patterns inspired in real-traffic measurements [1,14].…”

Section: Experiments and Resultsmentioning

confidence: 99%

A comparison of front-ends for bitstream-based ASR over IP

et al. 2006

View full text Add to dashboard Cite

Automatic Speech Recognition (ASR) is called to play a relevant role in the provision of spoken interfaces for IP-based applications. However, as a consequence of the transit of the speech signal over these particular networks, ASR systems need to face two new challenges: the impoverishment of the speech quality due to the compression needed to fit the channel capacity and the inevitable occurrence of packet losses.In this framework, bitstream-based approaches that obtain the ASR feature vectors directly from the coded bitstream, avoiding the speech decoding process, have been proposed ([4,7,10,15], among others) to improve the robustness of ASR systems. LSP (Line Spectral Pairs) are the preferred set of parameters for the description of the speech spectral envelope in most of the modern speech coders. Nevertheless, LSP have proved to be unsuitable for ASR, and they must be transformed into cepstrum-type parameters. In this paper we comparatively evaluate the robustness of the most significant LSP to cepstrum transformations in a simulated VoIP (Voice over IP) environment which includes two of the most popular codecs used in that network (G.723.1 and G.729) and several network conditions. In particular, we compare 'pseudocepstrum' [9], an approximated but straightforward transformation of LSP into LP cepstral coefficients, with a more computationally demanding but exact one. Our results show that pseudocepstrum is preferable when network conditions are good or computational resources low, while the exact procedure is recommended when network conditions become more adverse.

show abstract

“…To compute the bottleneck bandwidth, for outbound traffic, we use Sender Based Packet Pair (SBPP) [16]. SBPP estimates the spacing between a pair of back-to-back TCP packets after passing the bottleneck link between local servers and remote clients by examining the arrival times of their corresponding ACKs.…”

Section: Design Of Rampmentioning

confidence: 99%

A tool for RApid model parameterization and its applications

Lan

Heidemann

2003

Proceedings of the ACM SIGCOMM Workshop on Models, Methods and Tools for Reproducible Network Research - MoMeTools '03

View full text Add to dashboard Cite

The utility of simulations and analysis heavily relies on good models of network traffic. However, it is difficult to model and simulate the Internet traffic because of the network's great heterogeneity and rapid change. The statistical properties of Internet traffic not only constantly change over time but also vary in other dimensions such as locations and directions. Previously we have developed a tool RAMP that supports rapid parameterization of traffic models from live network measurements. In this paper, we first extend RAMP to support near-real-time trace-driven simulation. Next, we demonstrate the applications of RAMP via three case studies: generation of realistic traffic model for simulation, generation of high bandwidth synthetic network traces, and analysis and modeling of malicious traffic. Finally, we discuss some lessons we learned from using RAMP for traffic modeling.

show abstract

Measurements and analysis of end-to-end Internet dynamics

Cited by 411 publications

References 143 publications

On Kleinrock’s Independence Assumption

On Kleinrock’s Independence Assumption

A comparison of front-ends for bitstream-based ASR over IP

A tool for RApid model parameterization and its applications

Contact Info

Product

Resources

About