A Contribution to the System : Theoretic Approach to Bandwidth Estimation

• Autorzy: Borys A. , Wasielewska K. , Rybarczyk D.

Identyfikatory

DOI

10.2478/eletel-2013-0017

• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

network calculus; rate chirps; bandwidth estimation; nonlinear and/or linear parametric traffic systems

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2013
• Tom: Vol. 59, No. 2
• Strony: 141--149
• Opis fizyczny: Bibliogr. 11 poz., wykr.

Twórcy

autor

Borys A.

• Institute of Telecommunications, Faculty of Telecommunications and Electrical Engineering, University of Technology and Life Sciences, Bydgoszcz, Poland

autor

Wasielewska K.

• Institute of Applied Informatics, The State School of Higher Professional Education in Elbląg, Poland

autor

Rybarczyk D.

• OPEN SYSTEM Dariusz Rybarczyk, Bydgoszcz, Poland

Bibliografia

• [1] 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.
• [2] 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.
• [3] 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.
• [4] 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.
• [5] 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.
• [6] J.-Y. L. Boudec and P. Thiran, Network Calculus. A Theory of Deterministic Queuing Systems for the Internet. Berlin, Germany: Springer-Verlag, 2001.
• [7] 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.
• [8] 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.
• [9] 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, Poznań, Poland, February 2011, pp. 236-242.
• [10] 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, Poznań, Poland, February 2011, pp. 232-235.
• [11] 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.