the probability of losing a customer in m/g/n/0 and gi/m/n/0 loss queuing systems withheterogeneous servers is minimized. the first system uses a queue discipline in which a customer who arriveswhen there are free servers chooses any one of them with equal probability, but is lost otherwise. providedthat the sum of the servers rates are fixed, loss probability in this system attains minimum val...

Abstract We address in this paper the parallel machine scheduling problem with a shared loading server and unloading server. Each job has to be loaded by before being processed on one of available machines unloaded immediately after its processing. The objective function involves minimization overall completion time, known as makespan. This important raises flexible manufacturing systems, autom...

In the present study, we analyze the multi-channel service system with ordered entryfrom finite-source and finite-storage at each channel. The arrival and service rates are assumedto be state dependent. The steady state probabilities of the system are obtained by usingChapmann-Kolmogorov equations. Some other performance indices viz. utilization of servers,expected number of units in the system...

abstract—today, botnets have become a serious threat to enterprise networks. by creation of network of bots, they launch several attacks, distributed denial of service attacks (ddos) on networks is a sample of such attacks. such attacks with the occupation of system resources, have proven to be an effective method of denying network services. botnets that launch http packet flood attacks agains...

We consider tandem lines with finite buffers and flexible, heterogeneous servers who are synergistic in that they work more effectively in teams than on their own. Our objective is to determine how the servers should be assigned dynamically to tasks in order to maximize the long-run average throughput. In particular, we investigate when it is better to take advantage of synergy among servers, r...