Routing among different nodes where servers break down without losing jobs

Author

Thomas, Nigel ; Mitrani, Isi

Author_Institution

Dept. of Comput. Sci., Newcastle upon Tyne Univ., UK

fYear

1995

fDate

24-26 Apr 1995

Firstpage

246

Lastpage

255

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

Keywords

fault tolerant computing; internetworking; network servers; performance evaluation; queueing theory; gateways; jobs routing; marginal equilibrium queue size distributions; optimal routine; parallel M/M/1 queues; single Poisson source; spectral expansion; Availability; Boundary value problems; Computer aided manufacturing; Concurrent computing; Electric breakdown; History; Intersymbol interference; Network servers; Routing; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Performance and Dependability Symposium, 1995. Proceedings., International

Conference_Location

Erlangen

Print_ISBN

0-8186-7059-2

Type

conf

DOI

10.1109/IPDS.1995.395827

Filename

395827