Analiza możliwości zastosowania algorytmów splotowych do modelowania systemów z dowolnymi strumieniami zgłoszeń

• Autorzy: Kaliszan A. , Kmiecik D.

Identyfikatory

DOI

10.15199/59.2017.8-9.30

Warianty tytułu

EN

The study of possibilities of application convolution algotithms for investigating systems with any call streams

• Konferencja: XXXIII Krajowe Sympozjum Telekomunikacji i Teleinformatyki (XXXIII ;13-15.09.2017 ; Warszawa, Polska)
• Języki publikacji: PL

Abstrakty

PL

W pracy zweryfikowano możliwości zastosowania algorytmów splotowych do modelowania wielousłogowych systemów sieciowych z różnymi, w tym niepoissonowskimi, strumieniami zgłoszeń. Badaniom podlegały strumienie zgłoszeń zarówno zależne jak i niezależne od stanu zajętości systemu. Czas pomiędzy kolejnymi zgłoszeniami wyznaczano na podstawie następujących rozkładów prawdopodobieństwa: wykładniczego, równomiernego, normalnego, gamma i Pareto. Rezultaty eksperymentów symulacyjnych zostały porównane w wynikami modelowania na podstawie algorytmu splotowego. Otrzymane rezultaty pozwalają na wskazanie granicznych możliwości zastosowania algorytmu splotowego.

EN

This article verifies the applicability of the convolution algorithm for modelling multi-service network systems with different call streams, including non-Poissonian streams. The paper includes investigations of traffic streams that are state-dependent and independent. The times between calls ware determined by the following distributions: exponential, uniform, normal, gamma and Pareto. The results of the simulation experiments are compared with the results of modelling by convolution algorithm. The results obtained in this study allow limits for the applicability of the convolution algorithm to be determined and identified.

Słowa kluczowe

PL

algorytm splotowy; strumień zgłoszeń; system wielousługowy

EN

convolution algorithm; call stream; multirate system

• Wydawca: Wydawnictwo SIGMA-NOT
• Czasopismo: Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne
• Rocznik: 2017
• Tom: nr 8-9
• Strony: 782--788, CD
• Opis fizyczny: Bibliogr. 26 poz., rys., tab.

Twórcy

autor

Kaliszan A.

• Politechnika Poznańska, Wydział Elektroniki i Telekomunikacji

autor

Kmiecik D.

• Politechnika Poznańska, Wydział Elektroniki i Telekomunikacji

Bibliografia

• [1] Bonald, T., L. Massoulié, A. Proutière, and J. Virtamo (2006). A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Systems 53(1), 65–84.
• [2] Delbrouck, L. (1983). On the steady-state distribution in a service facility carrying mixtures of traffic with different peakedness factors and capacity requirements. IEEE Transactions on Communications 31(11), 1209–1211.
• [3] Engset, T. (1998). On the calculation of switches in an automatic telephone system. Telektronikk, 99–142.
• [4] Erlang, A. (1917). Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges. Elektrotechnikeren.
• [5] Glabowski, M. and A. Kaliszan (2007). Simulator of Full-Availability Group with Bandwidth Reservation and Multi-Rate Bernoulli-Poisson-Pascal Traffic Streams. In EUROCON 2007 - The International Conference on Computer as a Tool, pp. 2271–2277. IEEE.
• [6] Głąbowski, M. (2008). Recurrent method for blocking probability calculation in multi-service switching networks with BPP traffic. In annals of telecommunications - annales des télécommunications, pp. 152–167.
• [7] Głąbowski, M., A. Kaliszan, and M. Stasiak (2007). On the application of the asymmetric convolution algorithm in modeling of full-availability group with bandwidth reservation. In L. Mason, T. Drwiega, and J. Yan (Eds.), Managing Traffic Performance in Converged Networks, Volume 4516 of Lecture Notes in Computer Science, pp. 878–889. Springer Berlin Heidelberg.
• [8] Głąbowski, M., A. Kaliszan, and M. Stasiak (2010, March). Modeling product-form state-dependent systems with BPP traffic. Performance Evaluation 67, 174–197.
• [9] Głąbowski, M., A. Kaliszan, and M. Stasiak (2013). Two-dimensional convolution algorithm for modelling multiservice networks with overflow traffic. Mathematical Problems in Engineering 2013, 18. Article ID 852082.
• [10] Głąbowski, M., A. Kaliszan, and M. Stasiak (2014). Generalized convolution algorithm for modelling state-dependent systems. IET Circuits, Devices & Systems 8(5), 378–386.
• [11] Głąbowski, M. and M. Sobieraj (2014, Sept). Modelling of network nodes with threshold mechanisms and multi-service sources. In Telecommunications Network Strategy and Planning Symposium (Networks), 2014 16th International, pp. 1–7.
• [12] Głąbowski, M., M. Sobieraj, and M. Stasiak (2009). Modelling limited-availability groups with BPP traffic and bandwidth reservation. In Proceedings of the Fifth Advanced International Conference on Telecommunications, Venezia, pp. 89–94. IEEE Computer Society. best paper award.
• [13] Głąbowski, M., M. Sobieraj, and M. Stasiak (2012, July). A full-availability group model with multi-service sources and threshold mechanisms. In Proceedings of the 8th IEEE, IET International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP 2012), Pozna´n, Poland.
• [14] Głąbowski, M., M. Stasiak, and J. Weissenberg (2012). Properties of recurrent equations for the full-availability group with BPP traffic. Mathematical Problems in Engineering.
• [15] Haddad, J.-P. and R. R. Mazumdar (2012). Congestion in large balanced multirate networks. Queueing Systems 74(2), 333–368.
• [16] Hanczewski, S. and A. Kaliszan (2016). Badania symulacyjne wielousługowych systemów kolejkowych. Przegląd Telekomunikacyjny i Wiadomości Telekomunikacyjne.
• [17] Hanczewski, S., A. Kaliszan, and M. Stasiak (2016). Convolution Model of a Queueing System with the cFIFO Service Discipline. Mobile Information Systems 2016, 1–15.
• [18] Iversen, V. (1987, August). The exact evaluation of multi-service loss system with access control. In Seventh Nordic Teletraffic Seminar, Lund, pp. 56–61.
• [19] Iversen, V. (2001). Teletraffic Engineering Handbook. ITU-D SG 2/16 and ITC Draft.
• [20] Kaufman, J. (1981). Blocking in a shared resource environment. IEEE Transactions on Communications 29(10), 1474–1481.
• [21] Moscholios, I., M. Logothetis, J. Vardakas, and A. Boucouvalas (2015). Performance metrics of a multirate resource sharing teletraffic model with finite sources under the threshold and bandwidth reservation policies. IET Networks 4(3), 195–208.
• [22] Roberts, J. (1981). A service system with heterogeneous user requirements — application to multi-service telecommunications systems. In G. Pujolle (Ed.), Proceedings of Performance of Data Communications Systems and their Applications, Amsterdam, pp. 423–431. North Holland.
• [23] Roberts, J. (2011). An erlang formula for the internet. In The First European Teletraffic Seminar, Poznań, Poland.
• [24] Ross, K. (1995). Multiservice Loss Models for Broadband Telecommunication Network. London: Springer.
• [25] Stamatelos, G. M. and V. N. Koukoulidis (1997, June). Reservation-based bandwidth allocation in a radio atm network. IEEE/ACM Transactions on Networking 5(3), 420–428.
• [26] Wallstrom, B. (1964). A distribution model for telefone traffic with varying call intensity, including overflow traffic. Ericsson Technics (2), 183–202.