Skip to main content
SpringerLink
Log in

Optimal assignment of dynamic priorities in queuing systems with two types of customers

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

We consider queuing systems with two types of customers. For such systems, we develop numerical procedures for computation of optimal dynamic priorities in the case of multiplicative priority functions. The optimality criterion is based on the total queue length for customers of both types. Our technique allows one to take into account waiting-time bounds. The optimization problem is formulated in the language of linear-fractional programming. To illustrate our technique, we present some numerical results at the end of the paper.

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. Pitts, J.M. and Schormans, J.A., Introduction to ATM design and performance. New York: John Wiley & Sons, 1997.

    Google Scholar 

  2. Chao, H.J. and Peckan, I.H., Queue management with multiple delays and loss priorities for ATM switches, in Proc. ICC’94, 1994, pp. 1184–189.

  3. Lee, Y. and Choi, B.D., Queuing systems with multiple delays and loss priorities for ATM networks, Information systems, 2001, vol. 138, pp. 7–29.

    MATH  MathSciNet  Google Scholar 

  4. Kim, C.S., Melikov, A.Z., and Ponomarenko, L.A., Approximation method for performance analysis of queuing systems with multimedia traffics, Applied and Computational Mathematics, 2007, vol. 6, no. 2, pp. 218–226.

    MathSciNet  Google Scholar 

  5. Ponomarenko, L.A., Melikov, A.Z., Ismailov, B.G., Structure optimization for networks of information transmission, Problemy informatizatsii i upravleniya, KMUGA, Kiev, 1997, vol. 1, pp. 155–160.

    Google Scholar 

  6. Melikov, A.Z. and Ismailov, B.G., Optimization of hierarchical structures in networks of information transmission, Izv. NANA, Seriya fiziko-tekhnicheskikh I matematicheskikh nauk, 1997, no. 6, pp. 69–73.

  7. Ismailov, B.G., Distributed networks design for serving gas extraction and preparation sites, Gazovaya promyshlennost, 2001, no. 1, pp. 29–35.

  8. Kleinrok, L., Communication Nets: Stochastic Message Flow and Design, McGraw-Hill, 1964.

Download references

Author information

Authors and Affiliations

  1. Sangji University, Sangji, South Korea

    Che Soong Kim

  2. Institute of Cybernetics, Azerbaijan National Academy of Sciences, 9 F. Agayev street, AZ 1141, Baku, Azerbaijan

    A. Z. Melikov

  3. Sumgait State University, Block 43, AZ 5008, Sumgait, Azerbaijan

    B. G. Ismailov

Authors
  1. Che Soong Kim
    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. B. G. Ismailov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Che Soong Kim.

Additional information

Original Russian Text © Che Soong Kim, A.Z. Melikov, B.G. Ismailov, 2008, published in Avtomatika i Vychislitel’naya Tekhnika, 2008, No. 6, pp. 57–65.

About this article

Cite this article

Kim, C.S., Melikov, A.Z. & Ismailov, B.G. Optimal assignment of dynamic priorities in queuing systems with two types of customers. Aut. Conrol Comp. Sci. 42, 320–326 (2008). https://doi.org/10.3103/S0146411608060072

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411608060072

Key words

Search

Navigation