Available bandwidth measurement as simple as running wget (original) (raw)
Through the Diversity of Bandwidth-Related Metrics, Estimation Techniques and Tools: An Overview
I. J. Computer Network and Information Security, 2018
The knowledge of bandwidth in communication networks can be useful in various applications. Some popular examples are validation of service level agreements, traffic engineering and capacity planning support, detection of congested or underutilized links, optimization of network route selection, dynamic server selection for downloads and visualizing network topologies, to name just a few. Following these various motivations, a variety of bandwidth estimation techniques and tools have been proposed in the last decade and still, several new ones are currently being introduced. They all show a wide spectrum of different assumptions, characteristics, advantages and limitations. In this paper, the bandwidth estimation literature is reviewed, with focus on introducing four specific bandwidth-related metrics including capacity, available bandwidth, achievable throughput and bulk transfer capacity (BTC); describing the main characteristics, strengths and weaknesses of major bandwidth estimation techniques as well as classifying the respective tool implementations. Also, the fundamental challenges, practical issues and difficulties faced by designing and implementing bandwidth estimation techniques are addressed.
Bandwidth estimation: metrics, measurement techniques, and tools
IEEE Network, 2003
In a packet network, the terms bandwidth and throughput often characterize the amount of data that the network can transfer per unit of time. Bandwidth estimation is of interest to users wishing to optimize end-to-end transport performance, overlay network routing, and peer-to-peer file distribution. Techniques for accurate bandwidth estimation are also important for traffic engineering and capacity planning support. Existing bandwidth estimation tools measure one or more of three related metrics: capacity, available bandwidth, and bulk transfer capacity. Currently available bandwidth estimation tools employ a variety of strategies to measure these metrics. In this survey we review the recent bandwidth estimation literature focusing on underlying techniques and methodologies as well as open source bandwidth measurement tools.
Techniques for available bandwidth measurement in IP networks: A performance comparison
Computer Networks, 2006
As the Internet grows in scale and complexity, the need for accurate traffic measurement increases. Among the different parameters relevant to traffic measurement, the paper pays attention to the available bandwidth of a path. In particular, a performance comparison of three different techniques, devoted to available bandwidth measurement, is attained under different operating conditions. The comparison is based on the outcomes of an extensive experimental activity. Experimental tests are not limited to the mere execution of the software tools that implement the techniques under test; indeed, a proper measurement station comprising a digital counter has been set up by the authors with the aim of gaining a reference value to be compared with results provided by the considered tools. The adoption of a performance evaluation methodology relying on the use of electronic instrumentation for time measurement represents a good example of crossfertilization between two distinct research areas: networking on one side and electronic measurements on the other. The tools have been tested under different cross-traffic conditions and their performance has been evaluated in terms of the following metrics: concurrence, repeatability, bias, and time. For each cross-traffic scenario and with reference to every performance metric, the paper identifies the tool that provides the best results. Furthermore, an optimal setting for the parameters of each tool has been identified thanks to the extensive experimental activity that has been performed.
Available bandwidth measurement using poisson probing on the internet
IEEE International Conference on Performance, Computing, and Communications, 2004, 2004
In this paper, we investigated a non-intrusive probing methodology for available bandwidth measurement based on the analysis of the departure process of an active Poisson probing stream. Unlike the self-congestion based available bandwidth measurement, non intrusive techniques are meant to infer the available bandwidth along a path without congesting the path. We propose to probe the end-to-end path using small size packets with exponentially distributed time between consecutive probing packets. Of particular interest to our investigations, is the Squared Coefficient of Variation (SCV) of the interdeparture process of the probing stream. The Internet is modelled as single server queue with two concurrent streams, the probing traffic stream and the cross traffic, we rely on the results on M 1 + M 2 /GI i /1 queueing system and a heavy traffic approximation model to analyze the departure process of the probing stream. Thus, in a real measurement system, given the measured SCV of the probing stream, inverting the approximation helps inferring the load of the cross traffic on an end-to-end path.
Several tools have been designed for measuring end-to-end available bandwidth (AB) of a path by injecting probe traffic on the path and inferring AB based on the end-to-end delays observed. While the algorithmic aspects of designing probe streams and inferring AB have received considerable attention, most tool designs have ignored an important aspect of measuring AB-that of the sampling timescales and strategies used. In this paper, we address this issue by studying the impact of the measurement time-scale, tool run-time, sampling strategy, and sampling intensity, on the accuracy, variability, and predictability of the estimated AB. We passively analyze link-level packet traces collected from 15 Internet links (8 different locations). Our analysis intentionally ignores the tool-specific algorithmic aspects of designing probe streams and inferring AB-our conclusions, therefore, are applicable to a wide variety of AB estimation tools. We use our analysis to derive several guidelines for tool design.
A Proposed Framework for Calibration of Available Bandwidth Estimation Tools
11th IEEE Symposium on Computers and Communications (ISCC'06), 2006
Examining the validity or accuracy of proposed available bandwidth estimation tools remains a challenging problem. A common approach consists of evaluating a newly developed tool using a combination of simple nstype simulations and feasible experiments in situ (i.e., using parts of the actual Internet). In this paper, we argue that this strategy tends to fall short of establishing a reliable "ground truth," and we advocate an alternative in vitro-like methodology for calibrating available bandwidth estimation tools that has not been widely used in this context. Our approach relies on performing controlled laboratory experiments and using tools to visualize and analyze the relevant tool-specific traffic dynamics. We present a case study of how two canonical available bandwidth estimation tools, SPRUCE and PATHLOAD, respond to increasingly more complex cross traffic and network path conditions. We expose measurement bias and algorithmic omissions that lead to poor tool calibration. As a result of this evaluation, we designed a calibrated available bandwidth estimation tool called YAZ that builds on the insights of PATHLOAD. We show that in head to head comparisons with SPRUCE and PATHLOAD, YAZ is significantly and consistently more accurate with respect to ground truth, and reports results more quickly with a small number of probes.
Eureka: A methodology for measuring bandwidth usage of networked applications
Multimedia and Expo ( …
This paper presents Eureka: a generic methodology of measuring the instantaneous (per second) bandwidth usage of networked games and applications in run time. Eureka starts with constructing a priority queue and sending low priority traffic through it. Then, the application under study is started with its packets marked as high priority. These packets therefore displace the previously existing low priority packets on the priority queue. We can measure this displacement and thus, the bandwidth used by the application. Unlike tcpdump this can be done while the application is running and without knowing any application specific data. In this paper we use Eureka to study the bandwidth usage of Massive Multiplayer Online Games (MMOGs), BZFlag and World of Warcraft-Trial, along with the 3D multi-site collaborative environments. A major strength of our methodology is that it provides run-time estimations of the bandwidth usage without interfering with the application, the environment, or the server/peer data. Moreover, Eureka is independent of the application and new infrastructure or tools are not required.
Available Bandwidth Estimation Tools Metrics, Approaches and Performance
Int. J. Commun. Networks Inf. Secur., 2018
The estimation of the available bandwidth (av bw) between two end nodes through the Internet, is an area that has motivated researchers around the world in the last twenty years, to have faster and more accurate tools; Due to the utility it has in various network applications; Such as routing management, intrusion detection systems and the performance of transport protocols. Different tools use different estimation techniques but generally only analyze the three most used metrics as av bw, relative error and estimation time. This work expands the information regarding the evaluation literature of the current Available Bandwidth Estimation Tools (ABET’s), where they analyze the estimation techniques, metrics, different generation tools of cross-traffic and evaluation testbed; Concentrating on the techniques and estimation methodologies used, as well as the challenges faced by open-source tools in high-performance networks of 10Gbps or higher.
The Measurement of Bandwidth: A Simulation Study
This chapter presents a simulation framework for studying bandwidth quantisation and measurement. It does not represent any specific technology but rather an interconnection of generic FIFO queuing nodes which can approximate the behaviour of real networks. The reader is invited to experiment with the C++ source-code which is available online. The four algorithms investigated were PPTD, SLoPS, Idle Rate and TOPP. A fifth approach is Variable Packet Size (VPS) probing: This measures round-trip-times for a series of probe packets to each intermediate node (Prasad et al, 2003) using ICMP messages to signal back to the sender. By varying the packet size L , the serializdation delay L C can be separated from the independent propagation-time and the effects of queuing delay minimised by taking the minimum of several measurements. Though this can provide quite detailed information, it assumes Layer 3 functionality in all congestible links. The technique has therefore not been included in t...