Stochastic Control Optimization Technique on Multi-Server Markovian Queueing System

Queueing network has widely applied to signify and investigate the resource sharing the system such as computer system, communication network. In many applications servers, like Web servers file servers, database servers, a huge amount of transaction has to be handled properly in a specified time limit. Each transaction typically consists of several sub-transactions that have to be processed in a fixed sequential order. One of the most important quality of service parameters for these applications is expected response time, which is the total time it takes a users request to be processed. In multi class queueing network, where a job moves from a queue to another queue with some probability after getting a service . The portrayal of the queue stability is obtained based on the following parameters: general arrival, service time distributions, multiple classes with specific arrival rate. A multiple class of customer could be open or closed where each class has its own set of queueing parameters. In distributed multi-server network in which the customer transitions have exemplified by more than one closed Markov chain. The main objective is to maximize the total source utility by posing the optimization network control which shown that the rate control problem has been solved completely . Graphical representation shows that the new method improves the performance measure in terms of reduction computational effort.

[1]  Srinivas R. Chakravarthy A Multi-Server Queueing Model with Markovian Arrivals and Multiple Thresholds , 2007, Asia Pac. J. Oper. Res..

[2]  R. D. van der Mei,et al.  Performance of Web servers in a distributed computing environment , 2001 .

[3]  K. Sivaselvan,et al.  Algorithmic approach for the design of Markovian queueing network with multiple closed chains , 2010, Trendz in Information Sciences & Computing(TISC2010).

[4]  Fernando Paganini,et al.  Congestion control for high performance, stability, and fairness in general networks , 2005, IEEE/ACM Transactions on Networking.

[5]  Jesus R. Artalejo,et al.  Mean Value Analysis of Single Server retrial Queues , 2010, Asia Pac. J. Oper. Res..

[6]  R.M. Fujimoto,et al.  Parallel and distributed simulation systems , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[7]  Mehdi Hosseini-Nasab,et al.  Efficiency of Time Segmentation Parallel Simulation of Finite Markovian Queueing Networks , 2003, Oper. Res..

[8]  Janche Sang,et al.  An improved computational algorithm for round-robin service , 2003, Proceedings of the 2003 Winter Simulation Conference, 2003..

[9]  Gautam Choudhury,et al.  Optimal design and control of queues , 2005 .

[10]  Jesús R. Artalejo,et al.  Markovian retrial queues with two way communication , 2012 .

[11]  Marco Ajmone Marsan,et al.  On the throughput achievable by isolated and interconnected input-queueing switches under multiclass traffic , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Kevin D. Glazebrook,et al.  Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance , 2001, Oper. Res..

[13]  Onno Boxma,et al.  Sojourn times in queueing networks , 1989 .

[14]  Shaler Stidham,et al.  Analysis, Design, and Control of Queueing Systems , 2002, Oper. Res..

[15]  Matthieu van der Heijden,et al.  An Exact Solution for the State Probabilities of the Multi-Class, Multi-Server Queue with Preemptive Priorities , 2005, Queueing Syst. Theory Appl..

[16]  Philip A. Whiting,et al.  SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004, Probability in the Engineering and Informational Sciences.

[17]  Giuseppe Serazzi,et al.  A Unifying Framework for the Approximate Solution of Closed Multiclass Queuing Networks , 2002, IEEE Trans. Computers.