PL EN


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

The influence of an SRD structure of LRD traffic on a drop probability

Autorzy
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
This paper investigates the influence of different SRD structures on a maximum delay value for queued LRD traffic with the usage of an envelope analysis. A FARIMA process is used as a traffic model since it can model both SRD and LRD structures independently. A FGN process is used as a reference of LRD traffic due to its relative simplicity. A drop probability is computed as a function of a buffer size that, in turn, is determined as a maximum delay function. All computations are performed with a support of an envelope process theory. A similarity between theoretical and simulations trends has been shown. The influence of an SRD structure for two different FARIMA models has been analysed for different network parameters.
Słowa kluczowe
EN
self-similarity   QoS   LRD   SRD   FARIMA  
Czasopismo
Rocznik
Strony
89--96
Opis fizyczny
Bibliogr. 23 poz., wykr.
Twórcy
autor
autor
  • Department of telecommunications, AGH University of Science and Technology, al. Mickiewicza 30, 30-059 Cracow, Poland, janowski@kt.agh.edu.pl
Bibliografia
  • [1] Beran J., Statistic for Long-Memory Processes, New York, Chapman & Hall 1994.
  • [2] Box G.E.P, Jenkins G., Time Series Analysis: Forecasting and Control, HoldenDay 1976.
  • [3] Chang C.-S., Thomas J.A., Effective bandwidth in high speed digital networks, IEEE Journal on Selected Areas in Communications, Vol. 13, No. 6, August 1995, pp. 1091-1100.
  • [4] Czachórski T., Modele kolejkowe w ocenie efektywności i systemów komputerowych, Wydawnictwo Politechniki Śląskiej 1999.
  • [5] Duffield N., O’Connell N., Large deviations and overflow probabilities for the general single-server queue, with applications. Math. Proc. Cambr. Phil. Soc., Vol. 118, 1995, pp. 363-374.
  • [6] Embrechts P., Maejima M., Setfsimilar Processes, Princeton Ser. App. Math., Princeton University Press, New Jersey (USA) 2002.
  • [7] Erramilli A., Narayan O., Willinger W., Experimental queiteing analysis with long range dependent packet traffic, IEEE/ACM Trans. Networking, Vol. 4, 1996, pp. 209-223.
  • [8] Erramilli A., Roughan M., Veitch D., Willinger W., Self-similar traffic and network dynamics, Proc. IEEE, 90(5), 2002, pp. 800-819.
  • [9] Fonseca N., Mayor G., Neto C., On the equivalent bandwidth of self-similar sources, ACM Trans. Modeling and Computer Simulation (TOMACS), Vol. 10, No. 2, 2000, pp. 104-124.
  • [10] Harmantzis F.C., Hatzinakos D., Lambadaris I., Effective bandwidths and tail probabilities for Gaussian and stable self-similar traffic, ICC 2003 - IEEE Int. Conf. Commun., Vol. 26, No. 1, 2003, pp. 1515-1520.
  • [11] Hosking J.R.M., Fractional differencing, Biometrika Great Britain, Vol. 68, 1981, pp. 165-176.
  • [12] Jakubowski J., Sztencel R., Wstęp do teorii prawdopodobieństwa, SCRIPT, Warszawa 2000.
  • [13] Janowski L., Papir Z., Analysis of a Burstiness Curve for FBM Traffic and Token Bucket Shaping Algorithm, Proc. 8th Int. Conf. Telecommunications, 2005, pp. 439-42.
  • [14] Kelly P.P., Notes on Effective Bandwidths, Stochastic Networks: Theory and Applications, Vol. 4, 1996, pp. 141-168.
  • [15] Kumar A., Manjunath D., Kuri J., Communication Networking - an Analytical Approach, Elsevier 2004.
  • [16] Leland W.E., Taqqu M.S., Willinger W., Wilson D.V., On the Self-Similar Nature of Ethernet Traffic (Extended Version), IEEE Trans. Networking, Vol. 2, 1994, pp. 1-15.
  • [17] Massoulie L., Simonian A., Large buffer asymptotes for the queue with FBM input, J. Appl. Prob, Vol. 36, 1999, pp. 894-906.
  • [18] Mayor G., Silvester J., Time Scale Analysis of an ATM Queueing System with Long-Range Dependent Traffic, Proc. Infocom., 1997, pp. 205-212.
  • [19] Muscariello L., Mellia M., Meo M., Ajmone Marsan M., Cigno R. Lo., A Simple Markovian Approach to Model Internet Traffic at Edge Routers, COST279 Tech. Rep., talk in the COST279 meeting in Karlskrona. Sweden, May 2003.
  • [20] Narayan O., Exact asymptotic queue length distribution for fractional Brownian traffic. Advances in Perf. Analysis. Vol. I, 1998, pp. 39-63.
  • [21] Norros I. A Storage Model with Self-similar Input. Queueing Systems. Vol. 16. 1994. pp. 387-396.
  • [22] Papir Z., Ruch telekomunikacyjny i przeciążenia sieci pakietowych. WKiŁ, Warszawa 2001.
  • [23] Stallings W., High-Speed Networks: TCP/IP and ATM Design Principles. Prentice Hall 1998.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BAT5-0027-0075
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ć.