Bandwidth estimation has been extensively researched in the past. The majority of existing methods assume either negligible or fluid cross-traffic in the network during the analysis. However, on the present-day Internet, these assumptions do not always hold right. Hence, over such paths the existing bandwidth estimation techniques become inaccurate. In this thesis, we explore the problem assuming arbitrary cross-traffic and develop a new probing method called Envelope, which can simultaneously estimate bottleneck and available bandwidth over an end-to-end path with multiple heavily congested links. Envelope is based on a recursive extension of the stochastic queuing model first proposed by Kang, Liu, Dai and Loguinov (2004), and a modified packet-train methodology. We use two small packets to surround the probing packet-trains and preserve the inter-packet spacing of probe traffic at each router in the path-suffix. The preserved spacings are then used by the receiver to estimate bandwidth. We first reproduce results for a single congested router case using the model proposed by Kang et al. Next, we extend it to the case of multiple congested routers with arbitrary cross-traffic and develop the methodology Envelope. We evaluate the performance of Envelope in various network path topologies and cross-traffic conditions through extensive NS-2 simulations. We also evaluate various probe-traffic parameters which affect the accuracy of this method and obtain the range of values for these parameters that provide good estimation results. Finally, we compare the bandwidth estimation results of our method with the results of other existing methods such as IGI (2003) , Spruce (2003), Pathload (2002), and CapProbe (June 2004) using simulation in Network Simulator (NS-2) with varied network topologies and cross-traffic.

Bandwidth estimation has been extensively researched in the past. The majority of existing methods assume either negligible or fluid cross-traffic in the network during the analysis. However, on the present-day Internet, these assumptions do not always hold right. Hence, over such paths the existing bandwidth estimation techniques become inaccurate. In this thesis, we explore the problem assuming arbitrary cross-traffic and develop a new probing method called Envelope, which can simultaneously estimate bottleneck and available bandwidth over an end-to-end path with multiple heavily congested links. Envelope is based on a recursive extension of the stochastic queuing model first proposed by Kang, Liu, Dai and Loguinov (2004), and a modified packet-train methodology. We use two small packets to surround the probing packet-trains and preserve the inter-packet spacing of probe traffic at each router in the path-suffix. The preserved spacings are then used by the receiver to estimate bandwidth. We first reproduce results for a single congested router case using the model proposed by Kang et al. Next, we extend it to the case of multiple congested routers with arbitrary cross-traffic and develop the methodology Envelope. We evaluate the performance of Envelope in various network path topologies and cross-traffic conditions through extensive NS-2 simulations. We also evaluate various probe-traffic parameters which affect the accuracy of this method and obtain the range of values for these parameters that provide good estimation results. Finally, we compare the bandwidth estimation results of our method with the results of other existing methods such as IGI (2003) , Spruce (2003), Pathload (2002), and CapProbe (June 2004) using simulation in Network Simulator (NS-2) with varied network topologies and cross-traffic.

Mobile networks are in the process of becoming the world’s leading medium for data traffic. This challenge has raised the bar for Quality of Services (QoS) provided by the mobile network operators. It requires methods and tools to verify the Service Level Agreement (SLA) and benchmark competitors by comparing metrics of QoS, e.g. the round-trip time and available bandwidth. For this purpose, Blixt™ has been developed, which is a property of InfoVista Sweden AB. Blixt™ is an Android application which measures the available bandwidth and the round-trip time for the latest generation of mobile networks. Blixt™ approach relies on a time-stamping protocol commonly known as Two-Way Active Measurement Protocol (TWAMP). This research work discusses how the packet probing parameters affect the accuracy of measurements and the level of intrusiveness. The performance of the technique was experimentally tested and compared to other tools and methods, namely, iPerf3, nPerf and FTP test.

Efficiently and accurately estimating bandwidths in packet networks is a problem that has intrigued researchers for years. There is no simple manner for estimating bandwidths in IPv4 networks that is accurate, efficient, flexible, and suitable for a variety of applications. Many of the available estimation techniques suffer from inherent flaws such as inaccuracy due to simple assumptions about the network or an overall high complexity that makes it inappropriate in all but a few highly specific situations. The next generation Internet Protocol, IP version 6, has the functionality necessary to implement feedback mechanisms to assist in accurate bandwidth estimations. This thesis proposes a timestamp hop-by-hop option for IPv6 and then applies this option to create a new bandwidth estimation technique. Instead of passive observations, the network infrastructure actively assists in bandwidth measurements resulting in a bandwidth estimation technique that is accurate, efficient, flexible, and suitable for many different applications and scenarios. Both analytical and simulation analysis show that the IPv6 bandwidth estimation technique outperforms a comparable IPv4 estimation method.

Available bandwidth is a time-dependant variable that defines the spare bandwidth in an end-to-end network path. Currently, there is significant focus in the research community on the design and development of Available Bandwidth Estimation Tools (ABETs), and a few tools have resulted from this research. However, there is no comprehensive evaluation of these tools and the research work in this thesis attempts to fill that gap. A performance evaluation of important ABETs like Pathload, IGI and pathChirp in terms of their accuracy, convergence time and intrusiveness is conducted in several scenarios. A 2k factorial design is carried out to analyze the importance of the size of probe packets, number of probe packets per train, number of trains, and frequency of runs in these performance metrics. ABETs are very important because of their potential in solving many network research problems. For example, ABETs can be used in congestion control in transport layer protocols, network management tools, route selection and configuration in overlay networks, SLA verification, topology building in peer to peer networks, call admission control, dynamic encoding rate modification in streaming applications, traffic engineering, capacity planning, intelligent routing systems, etc. This thesis looks at applying ABETs in the congestion control of transmission control protocol (TCP).Current implementations of TCP in the Internet perform reasonably well in terms of containing congestion, but their sending rate adjustment algorithm is unaware of the accurate network conditions and available resources. TCP's Additive Increase Multiplicative Decrease (AIMD) congestion control algorithm cannot efficiently utilize the available bandwidth to the full potential and this is especially true in high bandwidth networks.

Home networks are evolving vigorously and are also becoming more and more heterogeneous and complex. Home networks contain new services and numerous devices with wired and wireless links. At the same time, users demand high levels of quality of service for many new applications. Hence, the supervision of links quality tends to be mandatory in emergent home networks, to trigger QoS mechanisms. In this context, this dissertation proposes the utilization of the available bandwidth as a performance indicator in hybrid home networks (e.g. for remote service-evaluation, diagnosis and fault detection) and as link-state metric for a number of QoS mechanisms (e.g., admission control, path selection and load balancing). In this dissertation, we firstly explain why available bandwidth probing is a fundamental tool in the new QoS architectures for hybrid home networks and we explore different use cases. We investigate the networking constraints that affect bandwidth probing in hybrid home networks. We explain why most tools to measure available bandwidth on Internet paths are not very efficient on home networks. We make a taxonomic study of a number of state-of-the-art probing techniques and probing tools for available bandwidth. At that aim, we propose a functional framework, called Metrics Profile Capture Filter and Feedback (MPCFF). Based on these studies, we choose Iperf in TCP mode as an attractive tool to estimate available bandwidth. Then, we conduct a performance evaluation on an experimental test bed, to compare Iperf in lightweight TCP-mode vs. various state-of-the-art tools (Wbest, Pathchirp, Pathload and IGI/PTR). We show that Iperf in lightweight TCP mode is superior in terms of accuracy and speed of convergence. Finally, we integrate Iperf in lightweight TCP mode into a path selection protocol using the Inter-MAC software (developed in the Omega European project). We show, on a test bed, how Iperf in lightweight TCP mode enhances the Inter-MAC path selection by eliminating performance deterioration due to time-varying capacity links. Our results show that Iperf in lightweight TCP mode, accurately, triggers path selection and load balancing mechanisms, to adapt the network resources to the strong degradation of WiFi and PLC links. Available bandwidth probing detects and helps to control real-time deviations of the quality of experience, associated of sensitive applications. At the same time, available-bandwidth probing helps the service provider to isolate failures and to monitor the end-to-end residential service, on demand or on long-term periodicity basis.