A Contribution to the System-Theoretic Approach to Bandwidth Estimation

Andrzej Borys, Katarzyna Wasielewska, Dariusz Rybarczyk


The network calculus provides a theoretical background for description of traffic in computer networks. Using this tool in explanation of the so-called pathchirp method of measuring the available bandwidth, the validity and range of application of some relationships exploited are verified in this paper. The derivations are carried out in a wider context than that considered in a recent paper by Liebeherr et al. published in IEEE/ACM Transactions on Networking on network bandwidth estimation, providing thereby new insights and outcomes. These results, summarized in a table, show a means of bounding the service curve, depending upon its convexity or non-convexity property assumed and upon the linearity or non-linearity of a network considered. Moreover, it is shown here that the nonlinear network example analyzed by Liebeherr et al. can be viewed equivalently as a linear parametric network. For this network, the behaviour of the cross traffic is considered in a more detail, too.

Full Text:



N. Hu and P. Steenkiste, “Evaluation and Characterization of Available Bandwidth Techniques,” in IEEE JSAC Special Issue in Internet and WWW Measurement, Mapping, and Modeling, 2003.

V. J. Ribeiro, R. H. Riedi, R. G. Baraniuk, J. Navratil, and L. Cottrell, “PathChirp: Effcient Available Bandwidth Estimation for Network Paths,” in Passive and Active Measurement Workshop, 2003.

M. Jain and C. Dovrolis, “Pathload: A Measurement Tool for End-to- End Available Bandwidth,” in Passive and Active Measurements, Fort Collins, CO, March 2002.

B. Melander, M. Bjorkman, and P. Gunningberg, “A New End-to-End Probing and Analysis Method for Estimating Bandwidth Bottlenecks,” in Global Internet Symposium, 2000.

J. Liebeherr, M. Fidler, and S. Valaee, “A system-theoretic approach to bandwidth estimation,” IEEE/ACM Transactions on Networking, vol. 18, no. 4, pp. 1040-1053, August 2010.

J.-Y. L. Boudec and P. Thiran, Network Calculus. A Theory of Deterministic Queuing Systems for the Internet. Berlin, Germany: Springer- Verlag, 2001.

B. Melander, M. Bjorkman, and P. Gunningberg, “First-come-first-served packet dispersion and implications for TCP,” Proceedings of IEEE GLOBECOM, vol. 3, pp. 2170-2174, November 2002.

R. L. Cruz, “A calculus for network delay, part I and part II,” IEEE Transactions on Information Theory, vol. 37, no. 1, pp. 114-141, January 1991.

A. Borys and K. Wasielewska, “On characterization and properties of greedy shapers, and variable versus fixed delay,” in Proceedings of The First European Teletraffic Seminar, Poznan, Poland, February 2011, pp. 236-242.

A. Borys, M. Aleksiewicz, and D. Rybarczyk, “On understanding the service curve and its measurement-based estimation,” in Proceedings of The First European Teletraffic Seminar, Poznan, Poland, February 2011, pp. 232-235.

M. Fidler, “A Survey of Deterministic and Stochastic Service Curve Models in the Network Calculus,” IEEE Communications Surveys and Tutorials, vol. 12, no. 1, pp. 59-86, 2010.


  • There are currently no refbacks.

International Journal of Electronics and Telecommunications
is a periodical of Electronics and Telecommunications Committee
of Polish Academy of Sciences

eISSN: 2300-1933