Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computer Networks

CN 2017: Computer Networks pp 221–235Cite as

The Possibilities and Limitations of the Application of the Convolution Algorithm for Modeling Network Systems

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 718))

Abstract

This article verifies the applicability of the convolution algorithm for modelling multi-service network systems with different call streams, including non-Poissonian streams. The study includes investigations of traffic streams that are state-dependent and independent. The service time is determined by the following distributions: Pareto, uniform, gamma, normal and exponential. 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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Iversen, V.: The exact evaluation of multi-service loss system with access control. In: Seventh Nordic Teletraffic Seminar, Lund, pp. 56–61, August 1987

    Google Scholar 

  2. Ross, K.: Multiservice Loss Models for Broadband Telecommunication Network. Springer, London (1995)

    Book  MATH  Google Scholar 

  3. Głąbowski, M., Kaliszan, A., Stasiak, M.: Asymmetric convolution algorithm for blocking probability calculation in full-availability group with bandwidth reservation. IET Circ. Devices Syst. 2(1), 87 (2008)

    Article  Google Scholar 

  4. Głąbowski, M., Kaliszan, A., Stasiak, M.: Modeling product-form state-dependent systems with BPP traffic. Perform. Eval. 67, 174–197 (2010)

    Article  Google Scholar 

  5. Głąbowski, M., Kaliszan, A., Stasiak, M.: Two-dimensional convolution algorithm for modelling multiservice networks with overflow traffic. Math. Prob. Eng. Article ID 852082, 18 (2013)

    Google Scholar 

  6. Głąbowski, M., Kaliszan, A., Stasiak, M.: Generalized convolution algorithm for modelling state-dependent systems. IET Circ. Devices Syst. 8(5), 378–386 (2014)

    Article  MATH  Google Scholar 

  7. Hanczewski, S., Kaliszan, A., Stasiak, M.: Convolution model of a queueing system with the cFIFO service discipline. Mob. Inf. Syst. 2016, 1–15 (2016)

    Google Scholar 

  8. Moscholios, I., Logothetis, M., Vardakas, J., Boucouvalas, A.: Performance metrics of a multirate resource sharing teletraffic model with finite sources under the threshold and bandwidth reservation policies. IET Netw. 4(3), 195–208 (2015)

    Article  Google Scholar 

  9. Kaufman, J.: Blocking in a shared resource environment. IEEE Trans. Commun. 29(10), 1474–1481 (1981)

    Article  Google Scholar 

  10. Roberts, J.: A service system with heterogeneous user requirements – application to multi-service telecommunications systems. In: Pujolle, G. (ed.) Proceedings of Performance of Data Communications Systems and their Applications, pp. 423–431. North Holland, Amsterdam (1981)

    Google Scholar 

  11. Głąbowski, M.: Recurrent method for blocking probability calculation in multi-service switching networks with BPP traffic. In: Thomas, N., Juiz, C. (eds.) EPEW 2008. LNCS, vol. 5261, pp. 152–167. Springer, Heidelberg (2008). doi:10.1007/978-3-540-87412-6_12

    Chapter  Google Scholar 

  12. Głąbowski, M., Stasiak, M., Weissenberg, J.: Properties of recurrent equations for the full-availability group with BPP traffic. Math. Prob. Eng. (2012)

    Google Scholar 

  13. Delbrouck, L.: On the steady-state distribution in a service facility carrying mixtures of traffic with different peakedness factors and capacity requirements. IEEE Trans. Commun. 31(11), 1209–1211 (1983)

    Article  Google Scholar 

  14. Rácz, S., Gerö, B.P., Fodor, G.: Flow level performance analysis of a multi-service system supporting elastic and adaptive services. Perform. Eval. 49(1–4), 451–469 (2002)

    Article  MATH  Google Scholar 

  15. Vassilakis, V.G., Moscholios, I.D., Logothetis, M.D.: Call-level performance modelling of elastic and adaptive service-classes with finite population. IEICE Trans. Commun. E91.B(1), 151–163 (2008)

    Article  Google Scholar 

  16. Moscholios, I., Vardakas, J., Logothetis, M., Boucouvalas, A.: Congestion probabilities in a batched poisson multirate loss model supporting elastic and adaptive traffic. Ann. Telecommun. - annales des télécommunications 68(5), 327–344(2013)

    Google Scholar 

  17. Moscholios, I.D., Logothetis, M.D., Vardakas, J.S., Boucouvalas, A.C.: Congestion probabilities of elastic and adaptive calls in Elang-Engset multirate loss models under the threshold and bandwidth reservation policies. Comput. Netw. 92, Part 1, 1–23 (2015)

    Article  Google Scholar 

  18. Iversen, V.B.: Reversible Fair Scheduling: The Teletraffic Theory Revisited. Springer, Berlin (2007)

    Google Scholar 

  19. Sobieraj, M., Stasiak, M., Weissenberg, J., Zwierzykowski, P.: Analytical model of the single threshold mechanism with hysteresis for multi-service networks. IEICE Trans. Commun. E95–B(1), 120–132 (2012)

    Article  Google Scholar 

  20. Głąbowski, M., Hanczewski, S., Stasiak, M., Weissenberg, J.: Modeling Erlang’s ideal grading with multi-rate BPP traffic. Math. Prob. Eng. Article ID 456910, 35 (2012)

    Google Scholar 

  21. Głąbowski, M., Kaliszan, A., Stasiak, M.: Modelling overflow systems with distributed secondary resources. Comput. Netw. 108, 171–183 (2016)

    Article  Google Scholar 

  22. Erlang, A.: Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges. Elektrotechnikeren (1917)

    Google Scholar 

  23. Engset, T.: On the calculation of switches in an automatic telephone system. Telektronikk 99–142 (1998)

    Google Scholar 

  24. Wallstrom, B.: A distribution model for telefone traffic with varying call intensity, including overflow traffic. Ericsson Technics (2) 183–202 (1964)

    Google Scholar 

  25. Iversen, V.: Teletraffic Engineering Handbook. ITU-D SG 2/16 and ITC Draft (2001)

    Google Scholar 

  26. Głąbowski, M., Kaliszan, A.: 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 (2007)

    Google Scholar 

  27. Hanczewski, S., Kaliszan, A.: Simulation studies of queueing systems. In: 2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP), pp. 1–6, IEEE, July 2016

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chair of Communication and Computer Networks, Faculty of Electronics and Telecommunications, Poznan University of Technology, Poznań, Poland

    Adam Kaliszan & Maciej Stasiak

Authors
  1. Adam Kaliszan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maciej Stasiak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adam Kaliszan .

Editor information

Editors and Affiliations

  1. Silesian University of Technology, Gliwice, Poland

    Piotr Gaj

  2. Silesian University of Technology, Gliwice, Poland

    Andrzej Kwiecień

  3. Silesian University of Technology, Gliwice, Poland

    Michał Sawicki

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Kaliszan, A., Stasiak, M. (2017). The Possibilities and Limitations of the Application of the Convolution Algorithm for Modeling Network Systems. In: Gaj, P., Kwiecień, A., Sawicki, M. (eds) Computer Networks. CN 2017. Communications in Computer and Information Science, vol 718. Springer, Cham. https://doi.org/10.1007/978-3-319-59767-6_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59767-6_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59766-9

  • Online ISBN: 978-3-319-59767-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation