View Item 

Show simple item record

Queueing Networks of Random Link Topology: Stationary Dynamics of Maximal Throughput Schedules

dc.contributor.authorBambos, Nicholasen_US
dc.contributor.authorMichailidis, Georgeen_US
dc.date.accessioned2006-09-11T19:13:21Z
dc.date.available2006-09-11T19:13:21Z
dc.date.issued2005-05en_US
dc.identifier.citationBambos, Nicholas; Michailidis, George; (2005). "Queueing Networks of Random Link Topology: Stationary Dynamics of Maximal Throughput Schedules." Queueing Systems 50(1): 5-52. <http://hdl.handle.net/2027.42/47640>en_US
dc.identifier.issn0257-0130en_US
dc.identifier.issn1572-9443en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/47640
dc.description.abstractIn this paper, we study the stationary dynamics of a processing system comprised of several parallel queues and a single server of constant rate. The connectivity of the server to each queue is randomly modulated, taking values 1 (connected) or 0 (severed). At any given time, only the currently connected queues may receive service. A key issue is how to schedule the server on the connected queues in order to maximize the system throughput. We investigate two dynamic schedules, which are shown to stabilize the system under the highest possible traffic load, by scheduling the server on the connected queue of maximum backlog (workload or job number). They are analyzed under stationary ergodic traffic flows and connectivity modulation. The results also extend to the more general case of random server rate.en_US
dc.format.extent1177600 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherKluwer Academic Publishers; Springer Science + Business Media, Inc.en_US
dc.subject.otherEconomics / Management Scienceen_US
dc.subject.otherComputer Communication Networksen_US
dc.subject.otherSystems Theory, Controlen_US
dc.subject.otherProbability Theory and Stochastic Processesen_US
dc.subject.otherOperation Research/Decision Theoryen_US
dc.subject.otherProduction/Logisticsen_US
dc.subject.otherQueueing Networksen_US
dc.subject.otherRandom Topologyen_US
dc.subject.otherModulation Processen_US
dc.subject.otherOptimal Resource Allocationen_US
dc.titleQueueing Networks of Random Link Topology: Stationary Dynamics of Maximal Throughput Schedulesen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelManagementen_US
dc.subject.hlbsecondlevelIndustrial and Operations Engineeringen_US
dc.subject.hlbsecondlevelEconomicsen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.subject.hlbtoplevelBusinessen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Statistics, The University of Michigan, Ann Arboren_US
dc.contributor.affiliationotherDepartment of Management Science & Engineering and Department of Electrical Engineering, Stanford University, USAen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/47640/1/11134_2005_Article_858.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/s11134-005-0858-xen_US
dc.identifier.sourceQueueing Systemsen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
11134_2005_Article_858.pdf
Size:
1.123MB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.