i-manager Publications

Effective Reduction of Network Traffic Cost in Map Reduce for Very Large Scale Data Applications

K. Reddamma*, D. Jagadeesan**, T. Vivekanandan***

* Research Scholar, Department of Computer Science and Engineering, Sreenivasa Institute of Technology and Management Studies, A.P., India.

** Professor, Department of Computer Science and Engineering, Sreenivasa Institute of Technology and Management Studies, A.P., India.

*** Associate Professor, Department of Computer Science and Engineering, Sreenivasa Institute of Technology and Management Studies, A.P., India.

Periodicity:December - February'2017
DOI : https://doi.org/10.26634/jcom.4.4.13415

Abstract

The MapReduce programming model provides an exciting opportunity to process massive volumes of heterogeneous data using map and reduce tasks in parallel. In the recent time, a number of efforts has been made to improve the performance of the job’s execution. The performance of the job’s execution can be improved further by considering the network traffic. In this paper, an optimistic distributed algorithm is proposed to deal with the significant optimization problem for handling large size data. The optimistic distributed algorithm is more efficient than the distributed algorithm. Finally, simulation results show that the proposal can significantly reduce network traffic cost.

Keywords

Aggregator, Big Data, Hadoop, Hash Table, MapReduce, Optimistic Distributed Algorithm

How to Cite this Article?

Reddamma,K., Jagadeesan,D., and Vivekanandan,T. (2017). Effective Reduction of Network Traffic Cost in Map Reduce for Very Large Scale Data Applications. i-manager’s Journal on Computer Science, 4(4), 14-19. https://doi.org/10.26634/jcom.4.4.13415

References

[1]. Ian Foster, Carl Kesselman, and Steven Tuecke, (2001). “The Anatomy of the Grid: Enabling Scalable Virtual Organizations”. International Journal of High Performance Computing Applications, Vol.15, No.3, pp.200-222.

[2]. Shaik Naseera, T. Vivekanandan, and K.V. Madhu Murthy, (2008). “Data Replication using Experience Based Trust in Data Grid Environment”. In Proceedings of 5 International Conference on Distributed Computing and Internet Technology, Springer-Verlag, Heidelberg, Vol.5375, pp.39-50.

[3]. MapReduce introduction. Retrieved from”. http://www.tutorialspoint.com/map_reduce/map_reduce_introduction. htm

[4]. A. Blanca and S.W. Shin, (n.d.). Using Network Bandwidth Smartly in MapReduce Scheduling. Retrieved from http://www.cs.berkeley.edu/~kubitron/courses/ cs262a-F13/projects/reports/project7_ poster.pdf

[5]. B. Palaniswmy, A. Singh, L. Liu, and B. Jain, (2011). “Purlieus: locality-aware resource allocation for MapReduce in a cloud”. In Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis. ACM, p.58.

[6]. P. Costa, A. Donnelly, A. I. Rowstron, and G. O'Shea, (2012). “Camdoop: Exploiting in-network Aggregation for Big Data Applications”. In NSDI, Vol.12, pp.1-14.

[7]. T. Condie, N. Conway, P. Alvaro, J. M. Hellerstein, J. Gerth, J. Talbot, K. Elmeleegy, and R. Sears, (2010). “Online Aggregation and Continuous Query support in MapReduce”. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, ACM, pp.1115-1118.

[8]. S. Chen and S. W. Schlosser, (2008). “Map-Reduce Meets Wider Varieties of Applications”. Intel Research Pittsburgh, Tech. Rep. IRP-TR-08-05.

[9]. F. Ahmad, S. Lee, M. Thottethodi, and T. N. Vijaykumar, (2013). “MapReduce with Communication Overlap”. Journal of Parallel and Distributed Computing, Vol.73, No.5, pp.608-620.

[10]. Wikispaces (n.d.). Map Reduce. Retrieved from https://hadooptutorial.wikispaces.com/MapReduce

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Pdf	35	35	200	20
Online	35	35	200	15
Pdf & Online	35	35	400	25

Effective Reduction of Network Traffic Cost in Map Reduce for Very Large Scale Data Applications

Abstract

Keywords

How to Cite this Article?

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Options for accessing this content: