Modelowanie przelewowego ruchu Pascala

• Autorzy: Głąbowski Mariusz , Kmiecik Damian

Identyfikatory

DOI

10.15199/59.2019.7.37

Warianty tytułu

EN

Modelling overflow Pascal traffic

• Konferencja: Krajowe Sympozjum Telekomunikacji i Teleinformatyki (26-28.06.2019 ; Wrocław, Polska)
• Języki publikacji: PL

Abstrakty

PL

W artykule zaprezentowano rezultaty badań dotyczące wpływu zmian własności ruchu oferowanego na dokładność wyznaczania parametrów ruchu przelewanego w hierarchicznych systemach z ruchem wielousługowym. Rozważanym systemom oferowane były strumienie ruchu typu Pascala. Podczas badań określono wpływ zmian ilości źródeł, natężenia ruchu oferowanego przez poszczególne klasy, a także zmian natężenia ruchu oferowanego przez pojedyncze wolne źródło. Wnioski prezentowane w artykule zostały oparte na wyznaczonych błędach względnych wartości ruchu spływającego otrzymanego symulacyjnie oraz na podstawie obliczeń analitycznych.

EN

In this paper, impact of changes in parameters of offered traffic on the accuracy of determining the parameters of overflow traffic in hierarchy systems with multiservice traffic was presented. Pascal type traffic streams were offered to the considered systems. The study investigated the impact of changes in the number of sources, intensity of traffic offered by individual classes, as well as changes in the traffic offered by single free source. The presented results are based on determined relative errors of the values of overflow traffic obtained in simulations and on the basis of calculations.

Słowa kluczowe

PL

ujemny rozkład dwumianowy; ruch Pascala; ruch wielousługowy; system przelewowy

EN

negative binomial distribution; Pascal traffic; multiservice traffic; overflow system

• Wydawca: Wydawnictwo SIGMA-NOT
• Czasopismo: Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne
• Rocznik: 2019
• Tom: nr 7
• Strony: 682--687, CD
• Opis fizyczny: Bibliogr. 50 poz., rys.

Twórcy

autor

Głąbowski Mariusz

• Politechnika Poznańska, Wydział Elektroniki i Telekomunikacji

autor

Kmiecik Damian

• Politechnika Poznańska, Wydział Elektroniki i Telekomunikacji

Bibliografia

• [1] Bengt Wallström. 1964. A distribution model for telefone traffic with varying call intensity, including overflow traf-fic. Ericsson Technics, 20(2):183–202.
• [2] Eric W. M. Wong, Andrew Zalesky, Zvi Rosberg, and Moshe Zukerman. 2007. A new method for approximating blocking probability in overflow loss networks. Computer Networks, 51(11):2958–2975.
• [3] G. Soni and M. Kalra, “A novel approach for load balancing in cloud data center,” Advance Computing Conference (IACC), 2014 IEEE International, pp.807–812, Feb 2014.
• [4] J. Roberts, “A service system with heterogeneous user requirements—application to multi-service telecommunications systems,” Proceedings of Performance of Data Communications Systems and their Applications, ed. G. Pujolle, Amsterdam, pp.423–431, North Holland, 1981.
• [5] John F. Shortle. 2004. An equivalent random method with hyper-exponential service. Journal of Performance Evalua-tion, 57(3):409–422.
• [6] J.A. Morrison, “Analysis of some overflow problems with queuing,” Bell System Technical Journal, vol.59, no.8, pp.1427–1462, 1980.
• [7] Y. Zhao and E. Gambe, “Analysis on partial overflow queueing systems with two kinds of calls,” IEEE Transactions on Communications, vol.35, no.9, pp.942–949, Sep 1987.
• [8] Qian Huang, King-Tim Ko, and Villy Bæk Iversen. 2008. Approximation of loss calculation for hierarchical networks with multiservice overflows. IEEE Transactions on Communications, 56(3):466–473.
• [9] J. Kaufman, “Blocking in a shared resource environment,” IEEE Transactions on Communications, vol.29, no.10, pp.1474–1481, 1981.
• [10] M. Yoshino, N. Nishibe, M. Oba, and N. Komoda, “Classification of energy-saving operations from the perspective of system management,” 8th IEEE International Conference on Industrial Informatics (INDIN), pp.651–656, July 2010.
• [11] C.G. Park and D.H. Han, “Comparisons of loss formulas for a circuit group with overflow traffic,” J. Appl. Math. and Informatics, vol.30, no.1–2, pp.135–145, 2012.
• [12] A. Fredericks, “Congestion in blocking systems – a simple approximation technique,” Bell System Technical Journal, vol.59, no.6, pp.805–827, July August 1980.
• [13] U. Herzog and A. Lotze. 1966. Das RDAVerfahren, ein Streuwertverfahren für unvollkommene Bündel. Na-chrichtentechnische Zeitung (NTZ), 11:640–646.
• [14] G. Bretschneider, “Die Berechnung von Leitungsgruppen für berfließenden Verkehr in Fernsprechwählanlagen,” Nachrichtentechnische Zeitung (NTZ), no.11, pp.533–540, 1956.
• [15] Mariusz Głąbowski, Sławomir Hanczewski, and Maciej Stasiak. 2011. Erlang’s Ideal Grading in DiffServ model-ling. In Proceedings of IEEE Africon 2011, pages 1–6, Liv-ingstone, Zambia, IEEE.
• [16] G. Bretschneider. Extension of the equivalent random method to smooth traffics. 1973. In Proceedings of 7th In-ternational Teletraffic Congress, Stockholm.
• [17] Shufeng Li, David Grace, Jibo Wei, and Dongtang Ma. 2010. Guaranteed handover schemes for a multilayer cellu-lar system. In 7th International Symposium on Wireless Communication Systems, pages 300–304.
• [18] A. Sgora and D.D. Vergados. 2009. Handoff prioritization and decision schemes in wireless cellular networks: a sur-vey. Communications Surveys Tutorials, IEEE, 11(4):57–77.
• [19] C. Gauger, P. Kühn, E. Breusegem, M. Pickavet, and P. Demeester, “Hybrid optical network architectures: bringing packets and circuits together,” IEEE Communications Magazine, vol.44, no.8, pp.36–42, 2006.
• [20] P. Clapson, “Improving the access time for random access files,” Commun. ACM, vol.20, no.3, pp.127–135, March 1977.
• [21] T. Bonald and J. Roberts. 2012. Internet and the Erlang Formula. In ACM Computer Communications Review, volume 42, pages 23 – 30.
• [22] M. Mashaly and P.J. Kühn, “Load balancing in cloud-based content delivery networks using adaptive server activation/deactivation,” Proceedings of the 24th International Teletraffic Congress, ITC ’12, pp.21:1–21:3, International Teletraffic Congress, 2012.
• [23] Maciej Stasiak, Mariusz Głąbowski, Arkadiusz Wiśniewski, and Piotr Zwierzykowski. 2011. Modeling and Dimen-sioning of Mobile Networks. Wiley.
• [24] Yi-Bing Lin, Li-Fang Chang, and A. Noerpel. 1995. Modeling hierarchical microcell/macrocell pcs architecture. In Communications, 1995. ICC ’95 Seattle, ’Gateway to Globalization’, 1995 IEEE International Conference on, volume 1, pages 405–409 vol.1.
• [25] M. Głąbowski, A. Kaliszan, and M. Stasiak, “Modeling product-form state-dependent systems with BPP traffic,” Performance Evaluation, vol. 67, pp. 174–197, Mar. 2010.
• [26] Mariusz Głąbowski, Damian Kmiecik, Maciej Stasiak, "Modelling multi-service overflow Pascal traffic", Proceedings of the 2018 IEICE General Conference
• [27] Mariusz Głąbowski, Sławomir Hanczewski, and Maciej Stasiak. 2015. Modelling of cellular networks with traffic overflow. Mathematical Problems in Engineering, 2015:15. Article ID 286490.
• [28] M. Głąbowski, D. Kmiecik, and M. Stasiak, “Modelling of multiservice networks with separated resources and overflow of adaptive traffic,” Wireless Communications and Mobile Computing, 2018. accepted for publication.
• [29] M. Głąbowski and M.D. Stasiak, “Modelling of multiservice switching networks with overflow links for any traffic class,” IET Circuits, Devices & Systems, vol.8, no.5, pp.358–366, 2014.
• [30] M. Głąbowski, “Modelling of state-dependent multi-rate systems carrying BPP traffic,” Annals of Telecommunications, vol.63, no.7-8, pp.393–407, Aug. 2008.
• [31] M. Głąbowski, A. Kaliszan, and M. Stasiak, “Modelling overflow systems with distributed secondary resources,” Computer Networks, vol.108, pp.171–183, 2016.
• [32] P. Kühn and M.E. Mashaly:, “Multi-server, finite capacity queuing system with mutual overflow,” Proceedings of 2nd European Teletraffic Seminar, ed. M. Fiedler, Karlskrona, pp.n/a–n/a, Sept. 2013.
• [33] M. Głąbowski and M.D. Stasiak, “Multiservice switching networks with overflow links and resource reservation,” Mathematical Problems in Engineering, vol.2016, no.Article ID 4090656, p.17 pages, 2016.
• [34] Rudolf Schehrer. 1978. On the calculation of overflow systems with a finite number of sources and full availiable groups. IEEE Transactions on Communications, 26(1):75–82.
• [35] Mariusz Głąbowski, Damian Kmiecik, and Maciej Stasiak. 2016. Overflow of elastic traffic. In 2016 International Conference on Broadband Communications for Next Gen-eration Networks and Multimedia Applications (CoBCom).
• [36] Mariusz Głąbowski, Damian Kmiecik, Maciej Stasiak, "Overflows in multiservice systems", IEICE Transactions on Communications, 2018
• [37] M.Wang, S. Li, E.Wong, and M. Zukerman, “Performance analysis of circuit switched multiservice multi-rate networks with alternative routing,” Journal of Lightwave Technology, vol.32, no.2, pp.179–200, Jan 2014.
• [38] Y. Rapp. 1964. Planning of junction network in a mul-tiexchange area. In Proceedings of 4th International Tel-etraffic Congress, page 4, London.
• [39] M. Głąbowski, M. Stasiak, and J. Weissenberg, “Properties of recurrent equations for the fullavailability group with BPP traffic,” Mathematical Problems in Engineering, vol.2012, p.17, 2012. Article ID 547909.
• [40] Adam Kaliszan, Damian Kmiecik, "System z przelewem ruchu oraz kolejkami w zasobach pierwotnych oraz wtórnych", Przegląd Telekomunikacyjny – Wiadomości Telekomunikacyjne nr 8-9/2018
• [41] P.J. Kühn, “Systematic classification of selfadapting algorithms for power-saving operation modes of ICT systems,” Proceedings of the 2nd International Conference on Energy-Efficient Computing and Networking, e-Energy ’11, New York, NY, USA, pp.51–54, ACM, 2011.
• [42] R. Fortet, Systeme Pentaconta Calcul d’orange, LMT, Paris, 1961.
• [43] V. Iversen, “Teletraffic engineering handbook,” tech. rep., Technical University of Denmark, 2010.
• [44] V.B. Iversen. 2005. Teletraffic Engineering Handbook. ITU-D, Study Group 2, Question 16/2, Geneva.
• [45] Anatol Kuczura. 1973. The interrupted Poisson process as an overflow process. Bell System Technical Journal, 52(3):437–448.
• [46] J. Matsumoto and Y.Watanabe, “Theoretical method for the analysis of queueing system with overflow traffic,” Electronics and Communications in Japan (Part I: Communications), vol.64, no.6, pp.74–83, 1981.
• [47] R.I. Wilkinson, “Theories of toll traffic engineering in the USA,” Bell System Technical Journal, vol.40, pp.421–514, 1956.
• [48] N.D. Tripathi, J.H. Reed, and H.F. 1998. Van-Landinoham. Handoff in cellular systems. Personal Communications, IEEE, 5(6):26–37.
• [49] S. Fernandes and A. Karmouch. 2012. Vertical mobility management architectures in wireless networks: A compre-hensive survey and future directions. Communications Surveys Tutorials, IEEE, 14(1):45–63.
• [50] V. Paxon and S. Floyd. 1994. Wide-Area Traffic: The Failure of Traffic Modeling. In Proceedings of the 1994 SIGCOMM Conference, pages 257–268.

Uwagi

PL

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2019).