Cloud computing has emerged as an optimal way of sharing and providing resources over the internet. Resource Allocation is one of the pretentious concerns in the cloud. It allocates the resources to its consumer on demand. Because it offers dynamic flexible resource allocation for reliable and guaranteed services in pay as-you-use manner to public. In this paper, we surveyed and analyzed severa...

The optimal tradeoff between average service cost rate, average utility rate, and averagedelay is addressed for a state dependent M/M/1 queueing model, with controllable queue lengthdependent service rates and arrival rates. For a model with a constant arrival rate λ for all queuelengths, we obtain an asymptotic characterization of the minimum average delay, when theaverage serv...

In this paper, a token-controlled network with exhaustive service strategy is analyzed. The mean and variance of service time of a station, and the mean token rotation time on the network are derived under the condition that the buffer capacity of each station is individually finite. For analysis, an extended stochastic Petri-net model of a station is presented. Then, by analyzing the model, th...

Realistic considerations of certain stochastic service systems often warrant the introduction of random changes in the intensity of the input process. A typical example of a changing arrival rate system is a communicat ion network with a sudden unpredictable increase in the traffic due to an external phenomenon. Such a situation can occur in a telephone network where a switching exchange node h...

In this paper, we consider deterministic (both fluid and discrete) polling systems with N queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, the best polling sequence is always periodic when the system is stable and forms a regular sequence. The fraction of time spent by the server in the first queue is hig...

this paper analyzes an m/m/2 queueing system with two heterogeneous servers. both servers goes on vacation when there is no customers waiting for service after this server 1 is always available but the other goes on vacation whenever server 2 is idle. the vacationing server however, returns to serve at a low rate as an arrival finds the other server busy. the system is analyzed in the steady st...

In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...