Skip to main content
SpringerLink
Log in

Numerical methods for analysis of multiflow queuing systems with virtual partition of a common buffer

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A new approach is proposed to studying queuing systems with request-specific channels and a common finite buffer for requests of different types. For sharing the common buffer, a virtual partitioning strategy is used. Explicit formulas for blocking probabilities of different requests are derived and optimization problems are solved. The results of numerical experiments are presented.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. F. Kamoun and L. Kleinrock, “Analysis of shared finite storage in a computer networks node environment under general traffic conditions,” IEEE Trans. Commun., 28, No.7, 992–1003 (1980).

    MATH  MathSciNet  Google Scholar 

  2. T. P. Yum and C. Dou, “Buffer allocation strategies with blocking requirements,” Perform. Eval., 4, No.4, 285–295 (1984).

    MathSciNet  Google Scholar 

  3. M. Irland, “Buffer management in a packet switch,” IEEE Trans. Commun., 26, 328–337 (1978).

    MATH  Google Scholar 

  4. G. Latouch, “Exponential servers sharing a finite storage: comparison of space allocation politics,” IEEE Trans. Commun., 28, 910–915 (1980).

    Google Scholar 

  5. X. Cheng and A. Akyildiz, “A finite buffer two class queue with different scheduling and push-out schemes,” in: Proc. IEEE INFOCOM 92, May 1992 (1992), pp. 231–241.

  6. N. Endo, “Shared buffer memory switch for an ATM exchange,” IEEE Trans. Commun., 41, 237–245 (1993).

    MathSciNet  Google Scholar 

  7. S. Fong and S. Sing, “Performance evaluation of shares-buffer ATM switches under self-similar traffic, ” in: IEEE Int. Performance, Computing and Comm. Conf., Feb. 1997 (1997), pp. 252–258.

  8. A. K. Choudhury and E. L. Hahne, “Dynamic queue length thresholds for shared-memory packet switch,” IEEE/ACM Trans. on Networking, 6, 130–140 (1998).

    Google Scholar 

  9. R. Guerin and V. Peris, “Quality-of-service in a packet networks: Basic mechanism and directions,” Comp. Networks, 31, 1927–1933 (1999).

    Google Scholar 

  10. M. Arpaci and J. A. Copeland, “Buffer management for shared-memory ATM switches,” IEEE Commun. Surveys and Tutorials, 3, No.1 (2000).

    Google Scholar 

  11. A. K. Thareja and A. K. Agrawala, “On the design of optimal policy for sharing finite buffers,” IEEE Trans. Commun., 32, 737–741 (1984).

    Article  Google Scholar 

  12. I. Cidon, L. Georgiadis, R. Guerin, and A. Khamisy, “Optimal buffer sharing,” IEEE J. Select. Areas in Commun., 13, 1229–1240 (1995).

    Google Scholar 

  13. G. L. Wu and J. W. Mark, “A buffer allocation scheme for ATM networks: complete sharing based on virtual partition,” IEEE/ACM Trans. on Networking, 3, 660–670 (1995).

    Google Scholar 

  14. S. Sharma and Y. Viniotis, “Optimal buffer management policies for shared-buffer ATM switching,” IEEE/ACM Trans. on Networking, 7, 575–587 (1999).

    Google Scholar 

  15. V. S. Korolyuk, Stochastic Models of Systems [in Russian], Naukova Dumka, Kiev (1989).

    MATH  Google Scholar 

  16. A. Z. Melikov and M. I. Fattakhova, “Computational algorithms to optimization of buffer allocation strategies in a packet switching networks,” Appl. Comput. Math. (Baku), 1, No.1, 51–58 (2002).

    Google Scholar 

  17. A. Z. Melikov and M. I. Fattakhova, “An approximate analysis of service quality of demands in the nodes of integral networks,” Avtom. Vych. Tekhn. No. 2, 41–48 (2002).

    Google Scholar 

  18. L. A. Ponomarenko, A. Z. Melikov, and M. I. Fattakhova, “The generalized algorithm for calculation of the characteristics of Kleinrok-Kamoun strategies for buffer allocation in packet switching networks,” System Research and Information Technologies, No. 2, 63–72 (2002).

  19. A. Z. Melikov and M. I. Fattakhova, “Optimization problems for service quality parameters in integration network nodes,” Avtom. Vych. Tekhn., No. 1, 67–73 (2003).

  20. A. Z. Melikov and F. N. Nagiev, “Approximate calculation of the characteristic of the push-out access strategy in integration network nodes,” Izv. NAN Azerb., Informatika i Probl. Upravl., No. 2–3, 10–15 (2002).

  21. A. G. Greenberg, R. Srikant, and W. Whitt, “Resource sharing for book-ahead and instantaneous-request calls,” IEEE/ACM Trans. on Networking, 7, 10–22 (1999).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NVK “Kiev Institute of Automation”, Kiev, Ukraine

    L. A. Ponomarenko

  2. Institute of Cybernetics, National Academy of Sciences of Azerbaijan, Baku, Azerbaijan

    A. Z. Melikov & M. I. Fattakhova

Authors
  1. L. A. Ponomarenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Z. Melikov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. I. Fattakhova
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 162–172, November–December 2004.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ponomarenko, L.A., Melikov, A.Z. & Fattakhova, M.I. Numerical methods for analysis of multiflow queuing systems with virtual partition of a common buffer. Cybern Syst Anal 40, 928–935 (2004). https://doi.org/10.1007/s10559-005-0032-9

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-005-0032-9

Keywords

Search

Navigation