Path stitching: Scalable and systematic internet-wide path and delay estimation from existing measurements (original) (raw)
Related papers
Scalable and systematic Internet-wide path and delay estimation from existing measurements
Computer Networks, 2011
Internet-wide services and applications depend on accurate information about the internal network state to deliver good performance to end-users. However, today's Internet does not provide such information explicitly and a number of systems have been recently proposed and implemented to provide a shared measurement infrastructure for distributed applications. The goal of this work is to demonstrate that without any new measurement infrastructure or active probing we obtain composite performance estimates from AS-by-AS segments and the estimates are as good as (or even better than) those from existing estimation methodologies that use on-demand, customized active probing. The key idea behind scaling measurements to the size of the Internet is to take advantage of the known underlying structure of the network.
Path Stitching: Internet-Wide Path and Delay Estimation from Existing Measurements
2010 Proceedings IEEE INFOCOM, 2010
Abstract Many measurement systems have been proposed in recent years to shed light on the internal performance of the Internet. Their common goal is to allow distributed applications to improve end-user experience. A common hurdle they face is the need to deploy yet another measurement infrastructure. In this work, we demonstrate that without any new measurement infrastructure or active probing we obtain composite performance estimates from AS-by-AS segments and the estimates are as good as (or even better than) ...
Towards DisNETPerf: a Distributed Internet Paths Performance Analyzer
2015
For more than 25 years now, traceroute has demonstrated its supremacy for network-path measurement, becoming the most widely used Internet path diagnosis tool today. A major limitation of traceroute when the destination is not controllable by the user is its inability to measure reverse paths, i.e., the path from a destination back to the source. Proposed techniques to address this issue rely on IP address spoong, which might lead to security concerns. In this paper we introduce and evaluate DisNETPerf, a new tool for locating probes that are the closest to a distant server. Those probes are then used to collect data from the server point-of-view to the service user for path performance monitoring and troubleshooting purposes. We propose two techniques for probe location, and demonstrate that the reverse path can be measured with very high accuracy in certain scenarios.
Measuring Bandwidth Signatures of Network Paths
Lecture Notes in Computer Science, 2007
In this paper, we propose a practical and efficient technique, Forecaster, to estimate (1) the end-toend available bandwidth, and (2) the speed of the most congested (tight) link along an Internet path. Forecaster is practical since it does not assume any a priori knowledge about the measured path, does not make any simplifying assumptions about the nature of cross-traffic, does not assume the ability to capture accurate packet dispersions or packet queuing delays, and does not try to preserve interpacket spacing along path segments. It merely relies on a simple binary test to estimate whether each probe packet has queued in the network or not. Pulse is efficient as it only requires two streams of probe packets that are sent end-to-end at rates that are much lower than the available bandwidth of the investigated path, thus avoiding path saturation. Theoretical analysis and experimental results validate the efficacy of the proposed technique.
2 Locating Disruptions on Internet Paths through End-to-End Measurements
2016
In backbone networks carrying heavy traffic loads, unwanted and unusual end-to-end delay changes can happen, though possibly rarely. In order to understand and manage the network to potentially avoid such abrupt changes, it is crucial and challenging to locate where in the network lies the cause of such delays so that some corresponding actions may be taken. To tackle this challenge, the present paper proposes a simple and novel approach. The proposed approach relies only on end-to-end measurements, unlike literature approaches that often require a distributed and possibly complicated monitoring / measurement infrastructure. Here, the key idea of the proposed approach is to make use of compressed sensing theory to estimate delays on each hop between the two nodes where end-to-end delay measurement is conducted, and infer critical hops that contribute to the abrupt delay increases. To demonstrate its effectiveness, the proposed approach is applied to a real network. The results are encouraging, showing that the proposed approach is able to locate the hops that have the most significant impact on or contribute the most to abrupt increases on the end-to-end delay.
2009 5th International Conference on Testbeds and Research Infrastructures for the Development of Networks & Communities and Workshops, 2009
There is a long line of research on measuring the Quality of Service (QoS) path characteristics of the Internet, such as available bandwidth, path capacity, packets reordering, delay and jitter. Most of the measurement techniques are based on active probing using pairs or trains of packets. The packets are either transmitted back-to-back or at a desired spacing (e.g., to achieve a certain rate). In most cases, one-way active probing techniques are preferred over round trip measurements as they gather less measurement noise.
Locating disruptions on an Internet path through end-to-end measurements
2013 IEEE Symposium on Computers and Communications (ISCC), 2013
In backbone networks carrying heavy traffic loads, unwanted and unusual end-to-end delay changes can happen, though possibly rarely. In order to understand and manage the network to potentially avoid such abrupt changes, it is crucial and challenging to locate where in the network lies the cause of such delays so that some corresponding actions may be taken. To tackle this challenge, the present paper proposes a simple and novel approach. The proposed approach relies only on end-to-end measurements, unlike literature approaches that often require a distributed and possibly complicated monitoring / measurement infrastructure. Here, the key idea of the proposed approach is to make use of compressed sensing theory to estimate delays on each hop between the two nodes where end-to-end delay measurement is conducted, and infer critical hops that contribute to the abrupt delay increases. To demonstrate its effectiveness, the proposed approach is applied to a real network. The results are encouraging, showing that the proposed approach is able to locate the hops that have the most significant impact on or contribute the most to abrupt increases on the end-to-end delay.
Measurements and analysis of end-to-end Internet dynamics
1997
Accurately characterizing end-to-end Internet dynamics-the performance that a user actually obtains from the lengthy series of network links that comprise a path through the Internet-is exceptionally difficult, due to the network's immense heterogeneity. It can be impossible to gauge the generality of findings based on measurements of a handful of paths, yet logistically it has proven very difficult to obtain end-to-end measurements on larger scales.
A Simulation Study of the Measurement of Queueing Delay over End-to-End Paths
IEEE Open Journal of the Computer Society, 2020
Determining the qualitative states of the Internet requires an accurate knowledge of queueing delay over an end-to-end path. However, the measurement of queueing delay in a large network is still considered a complex and open problem. Existing schemes that measure queueing delay compensate for this complexity using a high infrastructural support and administrative access to the path under test even though their feasibility and accuracy on the Internet are low. In this paper, we propose an active scheme, called COMPRESS: COMpound Probe compRESSion, to measure queueing delay on all routers over an end-to-end path. The proposed scheme performs per-hop measurement using UDP-based probing packets. It is both simple and self-sufficient in comparison to the existing schemes. We have implemented the proposed scheme in a simulation environment to present a controlled performance evaluation under different levels (e.g., light, moderate, and heavy) and types (e.g., symmetric and asymmetric) of queueing delays over single-and multiple-hop paths. Our simulation results show that the scheme is sensitive to the induced queueing delays and consistently provides a high measurement accuracy. Overall, the scheme has an average measurement error of around 20% or below over the simulated paths.
NetLets: measurement-based routing daemons for low end-to-end delays over networks
Computer Communications, 2003
Routing in the Internet is based on the best-effort mechanism, wherein the routers generally forward packets to minimize the number of hops to the destination. Furthermore, all packets of a type are treated the same independent of their size. We propose the framework of NetLets to enable the applications to send data packets to the destination with certain guarantees on the end-to-end delay. NetLets employ in situ instruments to measure the effective bandwidth and propagation delays on the links, and compute the paths with minimum measured endto-end delay for data packets of various sizes. Based on experiments over local area networks, the paths selected by NetLets indeed achieve the minimum end-to-end delay, and our method outperformed the best-effort mechanism based on the hop count. We also describe an implementation of NetLets over the Internet to illustrate their viability for wide-area networks. q 2002 Published by Elsevier Science B.V.