<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
<channel rdf:about="http://dyuthi.cusat.ac.in:80/xmlui/handle/purl/2039">
<title>Dr. A Krishnamoorthy</title>
<link>http://dyuthi.cusat.ac.in:80/xmlui/handle/purl/2039</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://dyuthi.cusat.ac.in:80/xmlui/handle/purl/2040"/>
</rdf:Seq>
</items>
<dc:date>2013-05-23T07:01:08Z</dc:date>
</channel>
<item rdf:about="http://dyuthi.cusat.ac.in:80/xmlui/handle/purl/2040">
<title>OPTIMAL UTILIZATION OF SERVICE FACILITY FOR A k-OUT-OF-n SYSTEM WITH REPAIR BY EXTENDING SERVICE TO EXTERNAL CUSTOMERS IN A RETRIAL QUEUE</title>
<link>http://dyuthi.cusat.ac.in:80/xmlui/handle/purl/2040</link>
<description>OPTIMAL UTILIZATION OF SERVICE FACILITY FOR A k-OUT-OF-n SYSTEM WITH REPAIR BY EXTENDING SERVICE TO EXTERNAL CUSTOMERS IN A RETRIAL QUEUE
Krishnamoorthy, A; Vishwanath C, Narayanan; Deepak, T G
In this paper, we study a k-out-of-n system with single server&#13;
who provides service to external customers also. The system consists of&#13;
two parts:(i) a main queue consisting of customers (failed components of&#13;
the k-out-of-n system) and (ii) a pool (of finite capacity M) of external&#13;
customers together with an orbit for external customers who find the pool&#13;
full. An external customer who finds the pool full on arrival, joins the orbit&#13;
with probability &#13;
 and with probability 1−&#13;
 leaves the system forever. An&#13;
orbital customer, who finds the pool full, at an epoch of repeated attempt,&#13;
returns to orbit with probability   (&lt; 1) and with probability 1 −  leaves&#13;
the system forever. We compute the steady state system size probability.&#13;
Several performance measures are computed, numerical illustrations are&#13;
provided.
</description>
<dc:date>2007-01-01T00:00:00Z</dc:date>
</item>
</rdf:RDF>
