M/M/n/m queuing model under non-preemptive limited-priority
Pages 228 - 232
Abstract
Concerning the problem of network congestion risk of computer network service system with transmitted priority, a method about non-preemptive limited-priority M/M/n/m queuing system model is proposed. Firstly, by introducing the parameter r of limited-priority into the model, the priority is converted to a limited priority system, then the system state is divided into r+1 kinds of state. Secondly, by computing the transition probability of different states based on Markov transfer theory, three results of the model: the average waiting time, the average dwelling time and the average queue length are obtained. Lastly, by considering the fairness of the order in which different priority queues receive services, the risk of data service in network system can be greatly reduced. Experimental results show that under the limited-priority, the network system yields better stability.
References
[1]
Morgan, Dennis R. Random-Access Channel Queuing Model. [J]. IEEE Transactions on Vehicular Technology, 2016, 65(4): 2522--2527.
[2]
Vijay Prasad, Badshah V.H, Tariq Ahmad Koka. Mathematical analysis of single queue multi server and multi queue multi server queuing models: comparison study[J]. Global Journal of Mathematical Analysis, 2015, 3(3): 97--104.
[3]
Yuriy E, Obzherin. Semi-Markovian Model of Two-Line Queuing System with Losses [J]. Intelligent Information Management, 2016, 8(2): 17--26.
[4]
Uzunoglu Kocer, Ozkar. M/C2/c/K queuing model and optimization for a geriatric care center[J]. Applied Stochastic Models in Business and Industry, 2015, 31(6): 892--911.
[5]
Oliver C. Ibe. M/G/1 Vacation Queueing Systems with Server Timeout[J]. Journal of American Journal of Operations Research, 2015, 5 (2): 77--88.
[6]
Krishna Reedy G V, Nadarajan R. A nonpreemptive priority multiserver queueing system with general bulk Service and hertergeneous arrivals[J]. Journal of Computer Operations Research, 1993, 20 (4) :447--453.
[7]
Del Re E, Fantaccir. Performance evaluation of input and output queuing techniques in ATM switching systems[J]. IEEE Transactions on Commun, 1993, 41(10): 1565--1575.
[8]
Mustafa Saima, un Nisa S. A comparison of single server and multiple server queuing models in different departments of hospitals. [J]. Punjab Univ. J. Math. (Lahore), 2015,47(1):73--80.
[9]
Hourvash Akbari Haghighinejad, Erfan Kharazmi, etal. Using Queuing Theory and Simulation Modelling to Reduce Waiting Times in An Iranian Emergency Department[J]. Int J Community Based Nurs Midwifery, 2016, 4(1): 11--26.
[10]
Smaranda Belciuga;Florin Gorunescub. Improving hospital bed occupancy and resource utilization through queuing modeling and evolutionary computation[J] Journal of Biomedical Informatics,2015,53(1):261--269.
[11]
Davide Cerotti, Marco Gribaudo, Pietro Piazzolla, etal. Multi-Class Queuing Networks Models for Energy Optimization[J]. EAI Endorsed Transactions on Energy Web, 2015,2(6) :1--8.
[12]
Yuning Dong, Panpan Du. Cross-Layer Design of 2D Queuing Model for Multi-hop Wireless Networks[J]. Wireless Personal Communications, 2014, 77(3): 1815--1832.
[13]
Cecília A.C. César;Solon V. Carvalho. A queuing model for distributed scheduling in IEEE 802.16 wireless mesh networks[J]. International Journal of Communication Systems, 2015, 28(5): 910--927.
[14]
Yewen Huang, Shenfen Kuang, Rongling Yang, etal. M/G/1 queuing model under nonpreemptive limited-priority [J]. Journal of computer applications, 2016, 36(7): 1179--1183.
[15]
Yewen Huang, Hong Wu, Yuanshi Wang. M/M/1 queuing model under nonpreemptive limited-priority[J] Journal of Computer engineering and applications, 2013, 49(13): 80--84.
[16]
Chuanlai Lu. Queuing theory(second edition)[M]. Beijing:Beijing University of Posts and Telecommunications press, 2009: 148--195.
Index Terms
- M/M/n/m queuing model under non-preemptive limited-priority
Recommendations
(N,n)-preemptive priority queues
In this paper, we propose a new priority discipline, called the (N,n)-preemptive priority discipline. Under this discipline, the preemption of the service of a low-class customer is determined by two thresholds N and n of the queue length of high-class ...
On the Mx/G/1 queue with feedback and optional server vacations based on a single vacation policy
We study a single server queue with batch arrivals and general (arbitrary) service time distribution. The server provides service to customers, one by one, on a first come, first served basis. Just after completion of his service, a customer may leave ...
Preemptive Priority Queues
Customers of different priorities arrive at a counter in accordance with a Poisson process. The customers are served by a single server in order of priority and for each priority in order of arrival. Preemptive discipline is assumed. Three service ...
Comments
Information & Contributors
Information
Published In
February 2017
339 pages
Copyright © 2017 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 26 February 2017
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
ICSCA 2017
ICSCA 2017: 2017 6th International Conference on Software and Computer Applications
February 26 - 28, 2017
Bangkok, Thailand
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 116Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 07 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in