Routing among different nodes where servers break down without losing jobs

  • Authors:
  • Affiliations:
  • Venue:
  • IPDS '95 Proceedings of the International Computer Performance and Dependability Symposium on Computer Performance and Dependability Symposium
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

Abstract: Jobs generated by a single Poisson source can be routed through N alternative gateways, modelled as parallel M/M/1 queues. The servers are subject to random breakdowns which leave their corresponding queues intact, but may affect the routing of jobs during the subsequent repair periods. The marginal equilibrium queue size distributions are determined by spectral expansion. This can be done, at least in principle, for any number of queues. Several routing strategies are evaluated and compared empirically. Numerical results, including optimal routine are presented and possible generalizations are considered.