• Title/Summary/Keyword: M/G/1 retrial queue

Search Result 12, Processing Time 0.014 seconds

ANALYSIS OF AN M/G/1 QUEUEING SYSTEM WITH DISGRUNTLED JOBS AND DIFFERENT TYPES OF SERVICE RATE

  • M. KANNAN;V. POONGOTHAI;P. GODHANDARAMAN
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.6
    • /
    • pp.1155-1171
    • /
    • 2023
  • This paper investigates a non Markovian M/G/1 queue with retrial policy, different kind of service rates as well as unsatisfied clients which is inspired by an example of a transmission medium access control in wireless communications. The server tends to work continuously until it finds at least one client in the system. The server will begin its maintenance tasks after serving all of the clients and if the system becomes empty. Provisioning periods in regular working periods and maintenance service periods should be evenly divided. Using supplementary variable technique, the amount of clients in the system as well as in the orbit were found. Further few performance measures of the system were demonstrated numerically.

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.;Narayanan, Viswanath C.;Deepak, T.G.
    • Journal of applied mathematics & informatics
    • /
    • v.25 no.1_2
    • /
    • pp.389-405
    • /
    • 2007
  • In this paper, we study a k-out-of-n system with single server who provides service to external customers also. The system consists of two parts:(i) a main queue consisting of customers (failed components of the k-out-of-n system) and (ii) a pool (of finite capacity M) of external customers together with an orbit for external customers who find the pool full. An external customer who finds the pool full on arrival, joins the orbit with probability ${\gamma}$ and with probability $1-{\gamma}$ leaves the system forever. An orbital customer, who finds the pool full, at an epoch of repeated attempt, returns to orbit with probability ${\delta}\;(<\;1)$ and with probability $1-{\delta}$ leaves the system forever. We compute the steady state system size probability. Several performance measures are computed, numerical illustrations are provided.