Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Measuring bottleneck link speed in packet-switched networks
Performance Evaluation
Measurements and analysis of end-to-end Internet dynamics
Measurements and analysis of end-to-end Internet dynamics
Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
Towards real-time measurement of traffic control parameters
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special Issue: performance modeling and evaluation of ATM networks
On the constancy of internet path properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
A measurement study of available bandwidth estimation tools
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
CapProbe: a simple and accurate capacity estimation technique
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Ten fallacies and pitfalls on end-to-end available bandwidth estimation
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
An integrated experimental environment for distributed systems and networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
The role of PASTA in network measurement
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Adding definition to active probing
ACM SIGCOMM Computer Communication Review
Laboratory-based calibration of available bandwidth estimation tools
Microprocessors & Microsystems
Poisson versus periodic path probing (or, does PASTA matter?)
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
A queueing-theoretic foundation of available bandwidth estimation: single-hop analysis
IEEE/ACM Transactions on Networking (TON)
A stochastic foundation of available bandwidth estimation: multi-hop analysis
IEEE/ACM Transactions on Networking (TON)
Conjugate network calculus: A dual approach applying the Legendre transform
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
Output characterization of constant bit rate traffic in FIFO networks
IEEE Communications Letters
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Comparison of public end-to-end bandwidth estimation tools on high-speed links
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Effective capacity: a wireless link model for support of quality of service
IEEE Transactions on Wireless Communications
Scalable services via egress admission control
IEEE Transactions on Multimedia
Evaluation and characterization of available bandwidth probing techniques
IEEE Journal on Selected Areas in Communications
Analysis of minimal backlogging-based available bandwidth estimation mechanism
Computer Communications
MR-BART: Multi-Rate Available Bandwidth Estimation in Real-Time
Journal of Network and Computer Applications
A calculus for SLA delay properties
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Perspectives on network calculus: no free lunch, but still good value
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Perspectives on network calculus: no free lunch, but still good value
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
A taxonomy of applying filter techniques to improve the available bandwidth estimations
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
Hi-index | 0.00 |
This paper presents a new foundational approach to reason about available bandwidth estimation as the analysis of a min-plus linear system. The available bandwidth of a link or complete path is expressed in terms of a service curve, which is a function that appears in the network calculus to express the service available to a traffic flow. The service curve is estimated based on measurements of a sequence of probing packets or passive measurements of a sample path of arrivals. It is shown that existing bandwidth estimation methods can be derived in the min-plus algebra of the network calculus, thus providing further mathematical justification for these methods. Principal difficulties of estimating available bandwidth from measurements of network probes are related to potential nonlinearities of the underlying network. When networks are viewed as systems that operate either in a linear or in a nonlinear regime, it is argued that probing schemes extract the most information at a point when the network crosses from a linear to a nonlinear regime. Experiments on the Emulab testbed at the University of Utah, Salt Lake City, evaluate the robustness of the system-theoretic interpretation of networks in practice. Multinode experiments evaluate how well the convolution operation of the min-plus algebra provides estimates for the available bandwidth of a path from estimates of individual links.