The week's pick
Random Articles
Reseach Article
Improved Queuing Mechanism for Hybrid Load balancing Scheme in Interactive Application
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 79 - Number 4 |
| Year of Publication: 2013 |
| Authors: Sampada Kalmankar, Sudarshan S. Deshmukh |
10.5120/13730-1527
|
Sampada Kalmankar, Sudarshan S. Deshmukh . Improved Queuing Mechanism for Hybrid Load balancing Scheme in Interactive Application. International Journal of Computer Applications. 79, 4 ( October 2013), 24-30. DOI=10.5120/13730-1527
Abstract
Distributed interactive applications (DIA) are becoming popular in the recent years. Examples of DIAs include shared workspaces, networked games, distributed whiteboards, distributed architectural design, virtual classrooms, telemedicine and simulation. The essential aspect of DIAs is that sufficient information is communicated between participants so that the state of the application remains consistent for all participants at all times. Consistent refers to the state of all the systems. If nodes have inaccurate information about the state of other nodes, due to communication delays between nodes, this could result in unnecessary periodic exchange of loads among them, due to which, certain nodes may become idle while loads are in transit, this would result in the prolonged total completion time of a load. Hence load balancing becomes more challenging in interactive applications as load variation is very large and the load on each server may change continuously over time, when the server takes the load migration decision, the load status collected from other servers may not be valid. This will affect the performance, of the load balancing algorithms. All the existing methods neglect the effect of network delay among the servers on the load balancing solutions. In this paper, due to the change in the load of the server, network delay would affect the performance of the load balancing algorithm. A new priority packet scheduling scheme is proposed in which load requesting Interactive application packets are placed in the highest priority queue and the processing of packets at other queue. Simulation results show that the proposed buffered priority packet scheduling scheme outperforms AODV with single queue for the load requesting messages of Interactive application in term of end-to-end data transmission delay.
References
- Xiao Qin, Hong Jiang, Adam Manzanares, Xiaojun Ruan and Shu Yin, IEEE "Communication-Aware Load Balancing for Parallel Applications on Clusters" IEEE TRANSACTIONS ON COMPUTERS, VOL. 59, NO. 1, JANUARY 2010.
- M. Harchol-Balter and A. B. Downey, "Exploiting Process Lifetime Distributions for Dynamic Load Balancing," ACM Trans. Computer Systems, vol. 15, no. 3, pp. 253-285, 1997.
- I. S. X. -D. Zhang, L. Xiao and Y. -X. Qu, "Improving Distributed Workload Performance by Sharing Both CPU and Memory -Resources," Proc. 20th Int'l Conf. Distributed Computing Systems (ICDCS '00), pp. 233-241, 2000.
- Xiao Qin, Hong Jiang Improving Effective Bandwidth of Networks on Clusters using Load Balancing for Communication-Intensive Applications, Proceedings of the 24th IEEE International Performance, Computing, and Communications Conference (IPCCC 2005).
- J. Cruz and K. Park, "Towards Communication-Sensitive Load Balancing," Proc. 21st Int'l Conf. Distributed Computing Systems, pp. 731-734, Apr. 2001.
- Satish Penmatsa and Anthony T. Chronopoulos,"Dynamic Multi-User Load Balancing in Distributed Systems", 1-4244-0910-1/07/$20. 00 c 2007 IEEE.
- Y. Hu, R. Blake, and D. Emerson. An optimal migration algorithm for dynamic load balancing. Concurrency: Practice and Experience, 10(6):467–483, 1998.
- J. Lui and M. Chan. An efficient partitioning algorithm for distributed virtual environment systems. IEEE Trans. on Parallel and Distributed Systems, 13(3):193–211, 2002.
- B. Ng, A. Si, R. Lau, and F. Li. A multi-server architecture for distributed virtual walkthrough. In Proc. ACM VRST, pages 163–170, 2002
- K. Lee and D. Lee. A scalable dynamic load distribution scheme for multi-server distributed virtual environment systems with highly-skewed user distribution. In Proc. ACM VRST, pages 160–168, 2003.
- J. Douglas Birdwell, J. Chiasson, Z. Tang, C. Abdallah, M. Hayat, and T. Wang. Dynamic time delay models for load balancing. Part I: Deterministic models. In Proc. CNRS-NSF Workshop: Advances in Control of Time-Delay System, 2003.
- Yunhua Deng and Rynson W. H. Lau. On Delay Adjustment for Dynamic Load Balancing in Distributed Virtual Environments, IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. 18, NO. 4, APRIL 2012.
- John Chiasson, Zhong Tang, Jean Ghanem, Chaouki T. Abdallah, J. Douglas Birdwell, Majeed M. Hayat, and Henry Jérez, "The Effect of Time Delays on the Stability of Load Balancing Algorithms for Parallel Computations", IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY, VOL. 13, NO. 6, NOVEMBER 2005
- Aaron McCoy, Tomás Ward, Seámus McLoone and Declan Delaney, "Formalizing a Framework for Dynamic Hybrid Strategy Models in Distributed Interactive Applications" IEE Irish Signals and Systems Conference, Dublin, June 28-30, 2006.
- Diwakar SHUKLA, Shweta OJHA, Saurabh JAIN "Data Model Approach And Markov Chain Based Analysis Of Multi-Level Queue Scheduling", Journal of Applied Computer Science & Mathematics, no. 8 (4) /2010, Suceava
- Lutful Karim, Nidal Nasser, Tarik Taleb, and Abdullah Alqallaf, "An Efficient Priority Packet Scheduling Algorithm for Wireless Sensor Network"
- Sudarshan Deshmukh and Sampada S Kalmankar "Comparative Study of Effects of Delay in Load Balancing Scheme for Highly Load Variant Interactive Applications", Proc. of Int. Conf. on Advances in Communication, Network, and Computing 2013
- Abdul Hadi Abd Rahman, Zuriati Ahmad Zukarnain "Performance Comparison of AODV, DSDV and I-DSDV Routing Protocols in Mobile Ad Hoc Networks", European Journal of Scientific Research ISSN 1450-216X Vol. 31 No. 4 (2009), pp. 566-576
Index Terms
Keywords