Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Some relationships between effective and leftover service curves

Wybrane pełne teksty z tego czasopisma
Warianty tytułu
Języki publikacji
Network service curve plays a fundamental role in the techniques called network calculus. For example, it is very useful in analysis of admission control algorithms and scheduling procedures. Its basic form is assumed to be time-invariant and independent of cross traffic. However, in practice, when cross traffic must be taken into account, another form of this curve has to be used. It is called leftover service curve that depends upon the cross traffic intensity and indicates how much bandwidth is actually left over for through traffic. Outside the field of network calculus, a service curve was also devised that depends upon cross traffic, similarly as the leftover service curve. It was named ∈-effective service curve and proved to be useful for ad hoc networks. In this paper, we discuss the relationships existing between the aforementioned service curves. In particular, we show that under some assumptions the ∈-effective service curve can be viewed as the result of interpolation of the leftover service curve obtained in measurements. The discussions are provided with the relevant derivations.
Opis fizyczny
Bibliogr. 8 poz., rys.
  • Gdynia Maritime University Poland
  • 1. Firoiu V., Le Boudec J.-Y., Towsley D. and Zhang Z.-L., Theories and models for Internet quality of service, Proc. IEEE, vol. 90, no. 9, pp. 1565–1591, May 2002.
  • 2. Le Boudec J.-Y. and Thiran P., Network Calculus. A Theory of Deterministic Queuing Systems for the Internet, Springer Verlag, Berlin, Germany, 2004.
  • 3. Fidler M., A survey of deterministic and stochastic service curve models in the network calculus, IEEE Communications Surveys & Tutorials, vol. 12, no. 1, First Quarter 2010, pp. 59–86.
  • 4. Agrawal R., Cruz R. L., Okino C. and Rajan R., Performance bounds for flow control protocols, IEEE/ACM Trans. Networking, vol. 7, no. 3, pp. 310–323, June 1999.
  • 5. Valaee S. and Li B., Distributed call admission control for ad hoc networks, in Proc. IEEE 56th VTC, Sep. 2002, pp. 1244–1248.
  • 6. Bouillard A., Gaujal B., Lagrange S. and Thierry E., Optimal routing for end-to-end guarantees using Network Calculus, Performance Evaluation, vol. 65, no. 11, pp. 883–906, 2008.
  • 7. Borys A. and Aleksiewicz M., Use of leftover service curve in admission control in ad hoc networks, in Proc. of the 11th IFAC/IEEE International Conference on Programmable Devices and Embedded Systems (PdeS 2012), pp. 33–37, May 2012.
  • 8. Borys A., Some remarks on practical aspects of the effective service curve use in ad hoc networks, Gdynia Maritime University Journal, vol. 1, pp. 26–36, 2015.
Typ dokumentu
Identyfikator YADDA
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.