Modelling Pascal traffic in overflow systems

• Autorzy: Głąbowski Mariusz , Kmiecik Damian

Identyfikatory

DOI

10.24425/ijet.2020.131857

• Języki publikacji: EN

Abstrakty

EN

In this paper, impact of changes in parameters of offered traffic on the accuracy of determining the parameters of overflow traffic in hierarchical systems with multi-service 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 a 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

EN

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

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2020
• Tom: Vol. 66, No. 1
• Strony: 155--160
• Opis fizyczny: Bibliogr. 49 poz., schem., wykr.

Twórcy

autor

Głąbowski Mariusz

• Faculty of Electronics and Telecommunications, Poznan University of Technology, Poland

autor

Kmiecik Damian

• Faculty of Electronics and Telecommunications, Poznan University of Technology, Poland

Bibliografia

• [1] M. Stasiak, M. Głąbowski, A. Wiśniewski, and P. Zwierzykowski, Modeling and Dimensioning of Mobile Networks. Wiley, 2011.
• [2] R. I. Wilkinson, “Theories of toll traffic engineering in the USA,” Bell System Technical Journal, vol. 40, pp. 421–514, 1956.
• [3] G. Bretschneider, “Extension of the equivalent random method to smooth traffics, ”in Proceedings of 7th International Teletraffic Congress. Stockholm: Organizing Committee, 1973.
• [4] A. Fredericks, “Congestion in blocking systems – a simple approximation technique,” Bell System Technical Journal, vol. 59, no. 6, pp. 805–827, July–August 1980. [Online]. Available: http://onlinelibrary.wiley.com/doi/10.1002/j.1538-7305.1980.tb03034.x/abstract
• [5] U. Herzog and A. Lotze, “Das RDA-Verfahren, ein Streuwertverfahren für unvollkommene Bündel,” Nachrichtentechnische Zeitung (NTZ), vol. 11, pp. 640–646, 1966.
• [6] V. Iversen, Ed., Teletraffic Engineering Handbook. Geneva: ITU-D, Study Group 2, Question 16/2, Jan. 2005.
• [7] A. Kuczura, “The interrupted Poisson process as an overflow process,” Bell System Technical Journal, vol. 52, no. 3, pp. 437–448, 1973. [Online]. Available: http://dx.doi.org/10.1002/j.1538-7305.1973.tb01971.x
• [8] Y. Rapp, “Planning of junction network in a multi-exchange area,” in Proceedings of 4th International Teletraffic Congress. London: Organizing Committee, 1964, p. 4.
• [9] R. Schehrer, “On the calculation of overflow systems with a finite number of sources and full availiable groups,” IEEE Transactions on Communications, vol. 26, no. 1, pp. 75–82, Jan. 1978.
• [10] J. F. Shortle, “An equivalent random method with hyper-exponential service,” Journal of Performance Evaluation, vol. 57, no. 3, pp. 409– 422, 2004.
• [11] B. Wallström, “A distribution model for telefone traffic with varying call intensity, including overflow traffic,” Ericsson Technics, vol. 20, no. 2, pp. 183–202, 1964.
• [12] E. W. M. Wong, A. Zalesky, Z. Rosberg, and M. Zukerman, “A new method for approximating blocking probability in overflow loss networks,” Computer Networks, vol. 51, no. 11, pp. 2958–2975, 2007.
• [13] 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.
• [14] M. Wang, S. Li, E. Wong, and M. Zukerman, “Performance analysis of circuit switched multi-service multi-rate networks with alternative routing,” Journal of Lightwave Technology, vol. 32, no. 2, pp. 179–200, Jan 2014.
• [15] S. Fernandes and A. Karmouch, “Vertical mobility management architectures in wireless networks: A comprehensive survey and future directions,” IEEE Communications Surveys Tutorials, vol. 14, no. 1, pp. 45–63, First 2012.
• [16] M. Głąbowski, S. Hanczewski, and M. Stasiak, “Modelling of cellular networks with traffic overflow,” Mathematical Problems in Engineering, vol. 2015, 2015, article ID 286490, 15 pages. [Online]. Available: http://dx.doi.org/10.1155/2015/286490
• [17] Q. Huang, K.-T. Ko, and V. B. Iversen, “Approximation of loss calculation for hierarchical networks with multiservice overflows,” IEEE Transactions on Communications, vol. 56, no. 3, pp. 466–473, Mar. 2008.
• [18] S. Li, D. Grace, J. Wei, and D. Ma, “Guaranteed handover schemes for a multilayer cellular system,” in Proceedings of 7th International Symposium on Wireless Communication Systems. York: IEEE, Sept 2010, pp. 300–304.
• [19] Y.-B. Lin, L.-F. Chang, and A. Noerpel, “Modeling hierarchical microcell/macrocell pcs architecture,” in International Conference on Communications, vol. 1. Seattle: IEEE, Jun 1995, pp. 405–409.
• [20] A. Sgora and D. Vergados, “Handoff prioritization and decision schemes in wireless cellular networks: a survey,” IEEE Communications Surveys Tutorials, vol. 11, no. 4, pp. 57–77, Fourth 2009.
• [21] N. Tripathi, J. Reed, and H. VanLandinoham, “Handoff in cellular systems,” IEEE Personal Communications, vol. 5, no. 6, pp. 26–37, Dec 1998.
• [22] M. Głąbowski, A. Kaliszan, and M. Stasiak, “Modelling overflow systems with distributed secondary resources,” Computer Networks, vol. 108, pp. 171–183, 2016. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S1389128616302675
• [23] M. Głąbowski, S. Hanczewski, and M. Stasiak, “Erlang’s Ideal Grading in DiffServ modelling,” in Proceedings of IEEE Africon 2011. Livingstone: IEEE, Sep. 2011, pp. 1–6. [Online]. Available: http://dx.doi.org/10.1109/AFRCON.2011.6072139
• [24] M. Głąbowski, D. Kmiecik, and M. Stasiak, “Overflow of elastic traffic,” in Proceedings of International Conference on Broadband Communications for Next Generation Networks and Multimedia Applications. Graz: IEEE, 2016.
• [25] R. Fortet, Systeme Pentaconta Calcul d’orange. Paris: LMT, 1961.
• [26] 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.
• [27] M. Głąbowski and M. D. Stasiak, “Multiservice switching networks with overflow links and resource reservation,” Mathematical Problems in Engineering, vol. 2016, 2016, article ID 4090656, 17 pages. [Online]. Available: http://www.hindawi.com/journals/mpe/2016/4090656/
• [28] P. Kühn and M. E. Mashaly:, “Multi-server, finite capacity queuing system with mutual overflow,” in Proceedings of 2nd European Teletraffic Seminar, M. Fiedler, Ed. Karlskrona: Blekinge Institute of Technology, Sep. 2013.
• [29] P. Clapson, “Improving the access time for random access files,” Commun. ACM, vol. 20, pp. 127–135, 1977.
• [30] M. Mashaly and P. J. Kühn, “Load balancing in cloud-based content delivery networks using adaptive server activation/deactivation,” in Proceedings of 24th International Teletraffic Congress. International Teletraffic Congress, 2012, pp. 21:1–21:3. [Online]. Available: http://dl.acm.org/citation.cfm?id=2414276.2414302
• [31] G. Soni and M. Kalra, “A novel approach for load balancing in cloud data center,” in International Advance Computing Conference. Gurgaon: IEEE, Feb 2014, pp. 807–812.
• [32] P. J. Kühn, “Systematic classification of self-adapting algorithms for power-saving operation modes of ICT systems,” in Proceedings of 2nd International Conference on Energy-Efficient Computing and Networking. New York: ACM, 2011, pp. 51–54. [Online]. Available: http://doi.acm.org/10.1145/2318716.2318724
• [33] M. Yoshino, N. Nishibe, M. Oba, and N. Komoda, “Classification of energy-saving operations from the perspective of system management,” in 8th International Conference on Industrial Informatics. Osaka: IEEE, July 2010, pp. 651–656.
• [34] J. Kaufman, “Blocking in a shared resource environment,” IEEE Transactions on Communications, vol. 29, no. 10, pp. 1474–1481, 1981.
• [35] J. Roberts, “A service system with heterogeneous user requirements – application to multi-service telecommunications systems,” in Proceedings of Performance of Data Communications Systems and their Applications, G. Pujolle, Ed. Amsterdam: North Holland, 1981, pp. 423–431.
• [36] 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.
• [37] M. Głąbowski, M. Stasiak, and J. Weissenberg, “Properties of recurrent equations for the full-availability group with BPP traffic,” Mathematical Problems in Engineering, vol. 2012, 2012, article ID 547909, 17 pages.
• [38] M. Głąbowski, D. Kmiecik, and M. Stasiak, “Overflows in multiservice systems,” IEICE Transactions on Communications, vol. E102.B, no. 5, pp. 958–969, 2019.
• [39] 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, vol. 2018, 2018, article ID 7870164, 17 pages. [Online]. Available: https://doi.org/10.1155/2018/7870164
• [40] 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. [Online]. Available: http://dx.doi.org/10.1002/ecja.4410640610
• [41] J.A.Morrison,“Analysis of some overflow problem swith queuing,” Bell System Technical Journal, vol. 59, no. 8, pp. 1427–1462, 1980. [Online]. Available: http://dx.doi.org/10.1002/j.1538-7305.1980.tb03373.x
• [42] Yongjian 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.
• [43] D. Kmiecik and A. Kaliszan, “System z przelewem ruchu oraz kolejkami w zasobach pierwotnych oraz wtórnych,” Przegląd Telekomunikacyjny – Wiadomości Telekomunikacyjne, vol. 2018, no. 8–9, 2018
• [44] G. Bretschneider, “Die Berechnung von Leitungsgruppen für berfließenden Verkehr in Fernsprechwählanlagen,” Nachrichtentechnische Zeitung (NTZ), vol. 11, pp. 533–540, 1956.
• [45] V. Iversen, “Teletraffic engineering handbook,” Technical University of Denmark, Lyngby, Tech. Rep., 2010.
• [46] C. Park and S.-Y. Ryu, “Comparison of loss formulas for a circuit group with overflow traffic,” in 2011 17th Asia-Pacific Conference on Communications, 2011, pp. 422–427.
• [47] M. Głąbowski, D. Kmiecik, and M. Stasiak, “Modelling multi-service overflow Pascal traffic,” in Proceedings of the 2018 IEICE General Conference, vol. 2018. Japan: IEICE, mar 2018, pp. S–70–S–71, paper BS-2-36.
• [48] V. Iversen, “The internet erlang formula,” in Internet of Things, Smart Spaces, and Next Generation Networking, ser. Lecture Notes in Computer Science, S. Andreev, S. Balandin, and Y. Koucheryavy, Eds. Berlin Heidelberg: Springer, 2012, vol. 7469, pp. 328–337. [Online]. Available: http://dx.doi.org/10.1007/978-3-642-32686-8_30
• [49] V. Paxson and S. Floyd, “Wide-area traffic: The failure of traffic modeling,” in Proceedings of SIGCOMM Conference. London: ACM, Aug. 1994, pp. 257–268.

Uwagi

Artykuł kończy się na stronie 161