JOURNAL BROWSE
Search
Advanced SearchSearch Tips
A Space Merging Approach to the Analysis of the Performance of Queueing Models with Finite Buffers and Priority Jumps
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
A Space Merging Approach to the Analysis of the Performance of Queueing Models with Finite Buffers and Priority Jumps
Oh, Youngjin; Kim, Chesoong; Melikov, Agassi;
  PDF(new window)
 Abstract
This paper proposes a space merging approach to studying the queuing models with finite buffers and jump priorities. Upon the arrival of a call with low priority, one call of such kind is assumed to be transferred to the end of the queue of high priority calls. The transfer probabilities depend on the state of the queue of the heterogeneous calls. We developed the algorithms to calculate the quality of service metrics of such queuing models, and the results of the numerical experiments are shown.
 Keywords
Space Merging;Queueing;Performance;Priority Jumps Style;
 Language
English
 Cited by
 References
1.
Bruneel, H., Steyaert, B., Desmet, E., and Petit, G. H. (1994), Analytic derivation of tail probabilities for queue lengths and waiting times in ATM multiserver queues, European Journal of Operational Research, 76(3), 563-572. crossref(new window)

2.
Demoor, T., Fiems, D., Walraevens, J., and Brunnel, H. (2011), Partially shared buffers with full or mixed priority, Journal of Industrial and Management Optimization, 7(3), 735-751. crossref(new window)

3.
Kim, C. S., Melikov, A. Z., and Ponomarenko, L. A. (2007), Approximation method for performance analysis of queuing systems with multimedia traffics, Applied and Computational Mathematics, 6(2), 218-226.

4.
Kleinrock, L. (1964), A delay dependent queue discipline, Naval Research Logistics Quarterly, 11(3-4), 329-341. crossref(new window)

5.
Kleinrock, L. (1976), Queuing Systems. Volume II: Computer Applications, John Wiley and Sons, New York, NY.

6.
Lee, Y. and Choi, B. D. (2001), Queuing system with multiple delay and loss priorities for ATM networks, Information Sciences, 138(1-4), 7-29. crossref(new window)

7.
Lim, Y. and Kobza, J. E. (1990), Analysis of a delaydependent priority discipline in an integrated multiclass traffic fast packet switch, IEEE Transactions on Communications, 38(5), 659-665. crossref(new window)

8.
Maertens, T., Walraevens J., and Bruneel, H. (2007), A modified HOL priority scheduling discipline: performance analysis, European Journal of Operational Research, 180(3), 1168-1185. crossref(new window)

9.
Maertens, T., Walraevens, J., and Bruneel, H. (2006a), On priority queues with priority jumps, Performance Evaluation, 63(12), 1235-1252. crossref(new window)

10.
Maertens, T., Walraevens, J., and Bruneel, H. (2008), Performance comparison of several priority schemes with priority jumps, Annals of Operations Research, 162(1), 109-125. crossref(new window)

11.
Maertens, T., Walraevens, J., Moeneclaey, M., and Bruneel, H. (2006b), A new dynamic priority scheme: performance analysis, Proceedings of the 13th International Conference on Analytical and Stochastic Modeling Techniques and Applications, Bonn, Germany, 77-84.

12.
Melikov, A. Z., Feyziev, V. S., and Rustamov, A. M. (2006), Analysis of model of data packet processing in ATM networks with multiple space and time priorities, Automatic Control and Computer Sciences, 40(6), 38-45.

13.
Ponomarenko, L., Kim, C. S., and Melikov, A. (2010), Performance Analysis and Optimization of Multi-Traffic on Communication Networks, Springer, New York, NY.

14.
Walraevens, J., Steyaert, B., and Bruneel, H. (2003), Performance analysis of single-server ATM queue with priority scheduling, Computers and Operations Research, 30(12), 1807-1829. crossref(new window)

15.
Wolff, R. W. (1992), Poisson arrivals see time averages, Operations Research, 30(2), 223-231.