Dynamic Reliability of a Cluster Server


  •  Andrzej Korzeniowski    
  •  Rachel Traylor    

Abstract

Suppose a single server has $K$ channels, each of which performs a different task. Customers arrive to the server via a nonhomogenous Poisson process with intensity $\lambda(t)$ and select $0$ to $K$ tasks for the server to perform. Each channel services the tasks in its queue independently, and the customer's job is complete when the last task selected is complete. The stress to the server is a constant multiple $\eta$ of the number of tasks selected by each customer, and thus the stress added to the server by each customer is random. Under this model, we provide the survival function for such a server in both the case of independently selected channels and correlated channels. A numerical comparison of expected lifetimes for various arrival rates is given, and the relationship between the dependency of channel selection and expected server lifetime is presented.


This work is licensed under a Creative Commons Attribution 4.0 License.
  • Issn(Print): 1927-7032
  • Issn(Onlne): 1927-7040
  • Started: 2012
  • Frequency: bimonthly

Journal Metrics

Google-based Impact Factor (2018): 2.7

  • h-index (August 2018): 11
  • i10-index (August 2018): 15
  • h5-index (August 2018): 9
  • h5-median(August 2018): 16

( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )

Contact