T G Deepak

T G Deepak
Indian Institute of Space Science and Technology | IIST · Department of Mathematics

Doctor of Philosophy

About

26
Publications
1,528
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
282
Citations

Publications

Publications (26)
Article
Full-text available
We consider a single server retrial model with two streams of calls namely, incoming and outgoing calls. Each stream consists of multiple classes of calls. As part of the internal work load, presence of outgoing calls are always assumed in the system. Arrival of incoming calls obey the Poisson law. Upon seeing a busy server at its arrival epoch, an...
Article
In this paper, we consider a single-server retrial model with multiple classes of customers. Arrival of customers follow independent Poisson rule. A new customer, facing a busy server upon his arrival, may join the corresponding (class-dependent) orbit queue with a class-dependent probability, or leaves the system forever (balks). The orbit queues...
Article
In this paper, we propose a model to study the queueing characteristics of nodes in a wireless network in which the channel access is governed by the well known binary exponential back off rule. By offering the general phase type (PH) distributional assumptions to channel idle and busy periods and assuming Poisson packet arrival processes at nodes,...
Conference Paper
A single server retrial queueing model, in which customers arrive according to a batch Markovian arrival process (BMAP), is considered. An arriving batch, finding server busy, enters an orbit. Otherwise one customer from the arriving batch enters for service immediately while the rest join the orbit. The customers from the orbit try to reach the se...
Conference Paper
Full-text available
Emergency messages originating on the highways need quick transmission, lest they loose significance. However, highways are not equipped with much Road side units (RSU) nor enough of on board units. Thus several emergency messages do not reach the destination in time which result in accidents and other untoward incidents. In this paper we propose m...
Article
A single server retrial queueing system, where customers arrive according to a batch Poisson process and are served either in single or as a batch, is considered here. An arriving batch, finding the server busy, enters an orbit. Otherwise, one customer, a few customers, or all customers from the arriving batch, depending on if the batch size exceed...
Article
Single server retrial queueing models in which customers arrive according to a batch Poisson process are considered here. An arriving batch, finding the server busy, enters an orbit. Otherwise, one customer from the arriving batch enters for service immediately while the rest join the orbit. The customers from the orbit (the orbital customers) try...
Article
In this paper the reliability of a repairable k-out-of-n system is studied. Repair times of components follow a phase type distribution. In addition, the service facility offers service to external customers which arrive according to a MAP. An external customer, who finds an idle server on its arrival, is immediately selected for service. Otherwise...
Article
This paper presents an infinite-capacity queueing system with a single server where service rule is FIFO. A customer, on arrival to an idle server, is immediately taken for service; or else he joins the tail of the queue. The arrival of customers constitutes a MAP. During the service of a customer, one or more interruptions may occur. It takes a ra...
Article
An inventory system with two parallel service facilities is considered. A certain number of customers are transferred from longer to shorter queue whenever their difference reaches a prescribed quantity. Along with this customer transfer, a certain quantity of inventory is also transferred, depending on availability. Further, if one of the queues h...
Article
We consider an inventory with random positive service time. The control policy is of (, ) sS type. Customer demands constitute a Markovian arrival process (MAP). Service times have phase type distribution. Lead time for replenishment of inventory follows a correlated process similar to the customer arrival process. At a service completion epoch if...
Article
Full-text available
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...
Article
Full-text available
We deviate from the Berman et al. models in inventory with positive service time. We establish a necessary and sufficient condition for system stability. Several performance measures are computed. An optimisation problem is discussed. Our analysis suggests that it is optimal to place the replenishment order when the inventory level is positive (ev...
Article
This article introduces an additional control policy—the N-policy–into (s, S) inventory system with positive service time. Under specified interarrival and service time distributions, which are independent of each other, we obtain the necessary and sufficient condition for the system to be stable. We also obtain the optimal values of the control va...
Article
The M|G|1 retrial queue with nonpersistent customers and orbital search is considered. If the server is busy at the time of arrival of a primary customer, then with probability 1 − H1 it leaves the system without service, and with probability H1 > 0, it enters into an orbit. Similarly, if the server is occupied at the time of arrival of an orbital...
Article
We consider a service system (both single and multiserver) to which customers arrive according to a Poisson process. Service times are i.i.d. exponential random variables. Each customer while waiting for service generate priority at a constant rate. At the epoch a unit generates priority, that unit is immediately taken for service provided the unit...
Conference Paper
In this paper the reliability of a repairable k-out-of-n system is studied. Repair times of components follow a phase type distribution. In addition, the service facility offers service to external customers which arrive according to a MAP. An external customer, who finds an idle server on its arrival, is immediately selected for service. Otherwise...
Article
A queueing system in which work gets postponed due to finiteness of the buffer is considered. When the buffer is full (capacity K) further arrivals are directed to a pool of customers (postponed work). An arrival encountering the buffer full, will join the pool with probability γ (0<γ<1); else it is lost to the system forever. When, at a departure...
Article
Several researchers have studied the N-policy for queues. In this paper, we modify the N-policy for M/G/1 queue as follows: The server on becoming idle waits for the accumulation of N units for service. As soon as there are N units, he starts service for these N-units all together and subsequent arrivals during the busy period initiated by this rec...
Article
This study is about the analysis of some queueing models related to N-policy.The optimal value the queue size has to attain in order to turn on a single server, assuming that the policy is to turn on a single server when the queue size reaches a certain number, N, and turn him off when the system is empty.The operating policy is the usual N-policy,...

Network

Cited By