Some Principles of Network Calculus Revisited

• Autorzy: Borys A. , Aleksiewicz M. , Rybarczyk D. , Wasielewska K.
• Języki publikacji: EN

Abstrakty

EN

Network calculus is a mathematical theory dealing with queueing problems in packet-switched computer networks. It provides algorithms to determine resource requirements of traffic flows using arrival and service curves and describes delays and backlogs in network systems. Network calculus framework is based on a min-plus algebra which allows to transform complex network optimization problems into analytically tractable ones. Recently, a fundamental book on principles, tools, techniques, and applications of network calculus, entitled: Network Calculus. A Theory of Deterministic Queuing Systems for the Internet, has been published by J. Y. Le Boudec and P. Thiran. Here, we refer to it in our refinements of proof of one important theorem and its extension. The objective of this paper is twofold. First, we complete one of basic results regarding a network element that is called in network calculus a greedy shaper. Second, we present also the results of some illustrative calculations and measurements of network service curve. They aim in better understanding of its properties.

Słowa kluczowe

EN

greedy shapers; network calculus; service curve

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2011
• Tom: Vol. 57, No. 3
• Strony: 279--284
• Opis fizyczny: Bibliogr. 5 poz., wykr.

Twórcy

autor

Borys A.

• Institute of Radioelectronics, Warsaw University of Technology, Warsaw, Poland

autor

Aleksiewicz M.

• Institute of Radioelectronics, Warsaw University of Technology, Warsaw, Poland

autor

Rybarczyk D.

• OPEN SYSTEM Dariusz Rybarczyk., Bydgoszcz, Poland

autor

Wasielewska K.

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

Bibliografia

• [1] R. L. Cruz, „A calculus for network delay, part i and part ii”, IEEE Trans. Information Theory, vol. 37, no. 1, pp. 114 - 141, Jan 1991.
• [2] J.-Y. L. Boudec and P. Thiran, Network Calculus. A Theory of Deterministic Queuing Systems for the Internet. Berlin, Germany: Springer-Verlag, 2001.
• [3] 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, Feb 2011, pp. 236 - 242.
• [4] 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, Feb 2011, pp. 232 - 235.
• [5] J. Liebeherr, M. Fidler, and S. Valaee, „A system-theoretic approach to bandwidth estimation”, IEEE/ACM Trans. on Networking, vol. 18, no. 4, pp. 1040 - 1053, Aug 2010.