An Adaptive Query Search and Data Retrieval Techniques for Content Distribution in Distributed Computing Network
(*) Corresponding author
Object-On-Demand in Distributed computing has been an active area of research for the past few years. Replication techniques have greatly improved the availability of popular objects, enhancing the performance of query latency, fault tolerant, reliability and load balancing. However, caching, replication and searching objects on a large-scale distributed system is very challenging tasks due to nodes dynamicity that can compromise data availability according to the popularity of object. The main problem is to determine where to replicate? When to replicate? And how many copies to create replica? In order to solve this problem, An Adaptive query search and data retrieval algorithm for content distribution in distributed computing network is proposed. The solution proposed is done in two phases based on the cost model which could be taken account for several factors such as processor speed of nodes, access latency, and the flow of bandwidth and storage capacity of nodes. Routing is performed hierarchically by broadcasting the query to the strong and medium clusters respectively. From wide simulations using NS2 simulator, the proposed algorithm achieves less bandwidth consumption, reduced latency, increased system performance, high throughput, and strong connectivity and query coverage than the existing method.
Copyright © 2014 Praise Worthy Prize - All rights reserved.
Dr. Anna Saro Vijendran, S.Thavamani, Oct-2012. “Survey of Caching and Replica Placement Algorithm for Content Distribution in Peer to Peer Overlay Networks”. The 2nd International conference on Computational Science, Engineering and Information Technology (CCSEIT 2012) October 2012, Coimbatore. India. Conference proceedings published by ACM that available in ACM digital library.
Dr. Anna Saro Vijendran, S.Thavamani, Nov-2012. “Analysis Study on Caching and Replica Placement Algorithm for Content Distribution in Distributed Computing Networks”, International Journal of Peer-to-Peer Networks. Nov-2012, Vol.3, No: 6.PP.13-21.
Dr. Anna Saro Vijendran, S.Thavamani, Jan-2013. “Popularity Based QOS-Aware Smart Replica Management Algorithm for Content Distribution in Peer to Peer Overlay Networks”. The 7th International conference on Intelligent Systems and Control (ISCO 2013) 4th & 5th Jan. 2013, Coimbatore, TN, India. Conference proceedings published by IEEE Xplore that available in IEEE digital library.
Dr. Anna Saro Vijendran, S.Thavamani, March-2013. “An efficient algorithm for clustering nodes, classifying and replication of content on demand basis for content distribution in P2P overlay networks”, International Journal of Computer and Communication Technology, ISSN: 0975-7449, Vol.4, Issue: 1, PP. 96-100, APRIL- 2013.
S. Ayyasamy and S.N. Sivanandam, 2009. “A QOS-Aware Intelligent Replica Management Architecture for Content Distribution in Peer-to-Peer Overlay Networks “, International Journal on Computer Science and Engineering, Vol.1 (2), 2009, PP: 71-79.
Sharrukh Zaman and Daniel Grosu. Sep-2011. “A Distributed Algorithm for the Replica Placement Problem”, IEEE Transaction on Parallel and Distributed Systems. vol.22, no.9.sep-2011.1455-1468.
Guoqiang Gao, & at el., “Proactive replication for rare objects in unstructured P2P networks”, Journal of Network and Computer Applications, Apr-2011, LNCS 6184, pp.74-85. Springer-Verlog Berlin Heidelberg.
CHAWATHE, Y., ET AL. “Making gnutella-like p2p systems scalable”, InProc. of SIGCOMM (Aug - 2003).
GKANTS IDIS, & at el. “A Random walks in peer-to-peer networks”, In Proc. of INFOCOM (2004).
GKANTS IDIS, C., MIHAIL, M., AND SABERI, “A Hybrid search schemes for unstructured P2Pnetworks”, In Proc. of INFOCOM (Miami, FL, March 2005).
Vimal, E.A., Chandramathi, S., Learning objects retrieval algorithm using semantic annotation and new matching score, (2013) International Review on Computers and Software (IRECOS), 8 (12), pp. 2755-2764.
Yammahi, M.S., Shen, C., Berkovich, S., Approximate search in very large files using the pigeonhole principle, (2013) International Review on Computers and Software (IRECOS), 8 (12), pp. 2773-2783.
- There are currently no refbacks.
Please send any question about this web site to email@example.com
Copyright © 2005-2023 Praise Worthy Prize