Stability of processor sharing networks with simultaneous resource requirements

Simple item page
dc.creatorHansen, Jennie
dc.creatorReynolds, Cian
dc.creatorZachary, Stan
dc.date2006-05-17
dc.date2007-08-01
dc.date.accessioned2026-07-07T08:21:25Z
dc.date.available2026-07-07T08:21:25Z
dc.descriptionWe study the phenomenon of entrainment in processor sharing networks, whereby, while individual network resources have sufficient capacity to met demand, the requirement for simultaneous availability of resources means that a network may nevertheless be unstable. We show that instability occurs through poor control, and that, for a variety of network topologies, only small modifications to controls are required in order to ensure stability. For controls which possess a natural monotonicity property, we give some new results for the classification of the corresponding Markov processes, which lead to conditions both for stability and for instability.
dc.descriptionminor revisions - corresponds to published version
dc.identifierhttps://arxiv.org/abs/math/0605477
dc.identifierhttp://arxiv.org/abs/math/0605477
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135353
dc.subjectProbability
dc.subjectOptimization and Control
dc.subject60K20
dc.titleStability of processor sharing networks with simultaneous resource requirements
dc.typetext

Files

Collections

arXiv