A Markov-Chain Model Based Study of Distributed Weighted Round-Robin Scheduling for Data Centers

Data centers spread around the world at different geographical location with the variation of time and location. This paper offers distributed weighted round robin (DWRR) scheduling algorithm for large-scale distributed data centers using Markov Chain Model. DWRR provides a platform to achieve fairness for all data centers. This proposed algorithm evaluates and optimizes the performance that reduces the operation costs, balances the load effectively, improves fairness and produces maximum throughput of data centers to study the transition behaviour of threads among different data centers.

[1]  Upamanyu Madhow,et al.  Fair scheduling with tunable latency: a round-robin approach , 2003, TNET.

[2]  Andrew W. Moore,et al.  Extreme Data-rate Scheduling for the Data Center , 2015, SIGCOMM.

[3]  Giuliano Casale,et al.  Evaluating Weighted Round Robin Load Balancing for Cloud Web Services , 2014, 2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[4]  Amin Mubark Alamin Ibrahim,et al.  Load Balancing Algorithms Round-Robin (RR), Least-Connection and Least Loaded Efficiency , 2015 .

[5]  Jason Nieh,et al.  Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling , 2006, PODC '06.

[6]  Jason Nieh,et al.  Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems , 2005, USENIX Annual Technical Conference, General Track.

[7]  Hind HazzaAlsharif,et al.  Round Robin Scheduling Algorithm to Control Processes that Grow Non-Deterministically , 2015 .

[8]  Vasileios Pappas,et al.  Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement , 2010, 2010 Proceedings IEEE INFOCOM.

[9]  Albert Banchs,et al.  Distributed weighted fair queuing in 802.11 wireless LAN , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[10]  Lisa Fleischer.  Data Center Scheduling, Generalized Flows, and Submodularity , 2010, ANALCO.

[11]  Prashant J. Shenoy,et al.  Surplus fair scheduling: a proportional-share CPU scheduling algorithm for symmetric multiprocessors , 2000, OSDI.

[12]  Ian T. Foster,et al.  The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[14]  Tong Li,et al.  Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin , 2009, PPoPP '09.

[15]  Haibing Guan,et al.  A survey on data center networking for cloud computing , 2015, Comput. Networks.

[16]  Murtaza Saadique Basha,et al.  Efficient Load Balancing Algorithm For Cloud Computing Using Divisible Load Scheduling And Weighted Round Robin Methods , 2022 .

[17]  Amin Vahdat,et al.  Helios: a hybrid electrical/optical switch architecture for modular data centers , 2010, SIGCOMM '10.

[18]  Lisandro Zambenedetti Granville,et al.  Data Center Network Virtualization: A Survey , 2013, IEEE Communications Surveys & Tutorials.

[19]  Venkatram Vishwanath,et al.  Distributed Multipath Routing Algorithm for Data Center Networks , 2014, 2014 International Workshop on Data Intensive Scalable Computing Systems.

[20]  Vladimir Hottmar,et al.  Analytical Model of a Weighted Round Robin Service System , 2012, J. Electr. Comput. Eng..