Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/1174
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTekin, Salih-
dc.contributor.authorAndradottir, Sigrun-
dc.contributor.authorDown, Douglas G.-
dc.date.accessioned2019-06-26T07:40:35Z
dc.date.available2019-06-26T07:40:35Z
dc.date.issued2012-01-
dc.identifier.citationTekin, S., Andradóttir, S., & Down, D. G. (2012). Dynamic server allocation for unstable queueing networks with flexible servers. Queueing Systems, 70(1), 45-79.en_US
dc.identifier.issn0257-0130-
dc.identifier.urihttps://link.springer.com/article/10.1007%2Fs11134-011-9258-6-
dc.identifier.urihttps://hdl.handle.net/20.500.11851/1174-
dc.description.abstractThis paper is concerned with the dynamic assignment of servers to tasks in queueing networks where demand may exceed the capacity for service. The objective is to maximize the system throughput. We use fluid limit analysis to show that several quantities of interest, namely the maximum possible throughput, the maximum throughput for a given arrival rate, the minimum arrival rate that will yield a desired feasible throughput, and the optimal allocations of servers to classes for a given arrival rate and desired throughput, can be computed by solving linear programming problems. We develop generalized round-robin policies for assigning servers to classes for a given arrival rate and desired throughput, and show that our policies achieve the desired throughput as long as this throughput is feasible for the arrival rate. We conclude with numerical examples that illustrate the points discussed and provide insights into the system behavior when the arrival rate deviates from the one the system is designed for.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofQueueing Systemsen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectMulti-Class Queueing Networksen_US
dc.subjectStabilityen_US
dc.subjectFluid Modelen_US
dc.subjectMaximum Throughputen_US
dc.subjectJackson Networksen_US
dc.titleDynamic Server Allocation for Unstable Queueing Networks With Flexible Serversen_US
dc.typeArticleen_US
dc.departmentFaculties, Faculty of Engineering, Department of Computer Engineeringen_US
dc.departmentFakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.identifier.volume70en_US
dc.identifier.issue1en_US
dc.identifier.startpage45en_US
dc.identifier.endpage79en_US
dc.authorid0000-0002-1697-7559-
dc.identifier.wosWOS:000298880800004-
dc.identifier.scopus2-s2.0-84855348530-
dc.institutionauthorTekin, Salih-
dc.identifier.doi10.1007/s11134-011-9258-6-
dc.authorscopusid48762212600-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.relation.otherNational Science Foundation [CMMI-0856600]; Natural Sciences and Engineering Research Council of Canada-
dc.identifier.scopusqualityQ3-
dc.identifier.wosqualityQ4-
item.fulltextNo Fulltext-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.grantfulltextnone-
crisitem.author.dept02.4. Department of Industrial Engineering-
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

6
checked on Mar 29, 2025

WEB OF SCIENCETM
Citations

6
checked on Mar 15, 2025

Page view(s)

112
checked on Mar 31, 2025

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.