File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Average waiting time of customers in a priority M/D/k queue with finite buffers

TitleAverage waiting time of customers in a priority M/D/k queue with finite buffers
Authors
KeywordsAverage waiting time
Deterministic service
Finite capacity
Priority queue
Issue Date2002
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/cor
Citation
Computers And Operations Research, 2002, v. 29 n. 4, p. 327-339 How to Cite?
AbstractAnalysis of priority multiserver queues is known to be a difficult problem. In this paper, a priority M/D/k queue with finite buffers is analyzed and an approximate closed-form expression for the average waiting time of customers belonging to different priority classes is obtained. The key assumption is the presence of heavy traffic in the network leading to loss of customers from the service stations. Several interesting numerical results are reported that show the interplay between arrival and service rate of customers, capacity of the buffer, proportion of traffic belonging to each class and probability of loss as experienced by incoming customers. Priority queues with finite buffers are used to model various types of telecommunications and manufacturing situations. These queues are specially useful for modelling high-speed asynchronous transfer mode (ATM) networks that are subject to loss due to overfilling of the buffers. In general, it is difficult to obtain close-form solutions of the various performance measures for these queues. Analysis of such queues with the deterministic service discipline can help provide useful guidelines for designers and developers of telecommunication and manufacturing networks. © 2001 Elsevier Science Ltd. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/85759
ISSN
2015 Impact Factor: 1.988
2015 SCImago Journal Rankings: 2.237
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorBose, Ien_HK
dc.contributor.authorPal, Ren_HK
dc.date.accessioned2010-09-06T09:08:55Z-
dc.date.available2010-09-06T09:08:55Z-
dc.date.issued2002en_HK
dc.identifier.citationComputers And Operations Research, 2002, v. 29 n. 4, p. 327-339en_HK
dc.identifier.issn0305-0548en_HK
dc.identifier.urihttp://hdl.handle.net/10722/85759-
dc.description.abstractAnalysis of priority multiserver queues is known to be a difficult problem. In this paper, a priority M/D/k queue with finite buffers is analyzed and an approximate closed-form expression for the average waiting time of customers belonging to different priority classes is obtained. The key assumption is the presence of heavy traffic in the network leading to loss of customers from the service stations. Several interesting numerical results are reported that show the interplay between arrival and service rate of customers, capacity of the buffer, proportion of traffic belonging to each class and probability of loss as experienced by incoming customers. Priority queues with finite buffers are used to model various types of telecommunications and manufacturing situations. These queues are specially useful for modelling high-speed asynchronous transfer mode (ATM) networks that are subject to loss due to overfilling of the buffers. In general, it is difficult to obtain close-form solutions of the various performance measures for these queues. Analysis of such queues with the deterministic service discipline can help provide useful guidelines for designers and developers of telecommunication and manufacturing networks. © 2001 Elsevier Science Ltd. All rights reserved.en_HK
dc.languageengen_HK
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/coren_HK
dc.relation.ispartofComputers and Operations Researchen_HK
dc.subjectAverage waiting timeen_HK
dc.subjectDeterministic serviceen_HK
dc.subjectFinite capacityen_HK
dc.subjectPriority queueen_HK
dc.titleAverage waiting time of customers in a priority M/D/k queue with finite buffersen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0305-0548&volume=29&spage=327&epage=339&date=2002&atitle=Average+Waiting+Time+Of+Customers+In+A+Priority+M/d/k+Queue+With+Finite+Buffersen_HK
dc.identifier.emailBose, I: bose@business.hku.hken_HK
dc.identifier.authorityBose, I=rp01041en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/S0305-0548(00)00052-6en_HK
dc.identifier.scopuseid_2-s2.0-0036526015en_HK
dc.identifier.hkuros81566en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0036526015&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume29en_HK
dc.identifier.issue4en_HK
dc.identifier.spage327en_HK
dc.identifier.epage339en_HK
dc.identifier.isiWOS:000172112500002-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridBose, I=7003751502en_HK
dc.identifier.scopusauthoridPal, R=55435080500en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats