AN EFFICIENT STRATEGY OF THE DATA INTEGRATION BASED CLOUD

(1)

INTERNATIONAL JOURNAL OF REVIEWS ON RECENT ELECTRONICS AND COMPUTER SCIENCE

www.ijrrecs.com 543 | P a g e

AN EFFICIENT STRATEGY OF THE DATA INTEGRATION BASED

CLOUD

Koncha Anantha Laxmi Prasad1, M.Yaseen Pasha2, V.Hari Prasad3 1_{M.Tech Student, Dept of CSE, Sphoorthy Engineering College, Hyderabad, A.P, India}

2_{Assistant Professor, Dept of CSE, Sphoorthy Engineering College, Hyderabad, A.P, India}

3_{Professor, Dept of CSE, Sphoorthy Engineering College, Hyderabad, A.P, India}

ABSTRACT:

Here a new technique is proposed by the help of the analysis related to the strategy oriented with outsourcing of the data integrity in a well oriented fashion followed by the storage of the cloud based server by the help of the strategy of oriented with possession of the provable data in a well defined manner respectively. Here in the present strategy a scheme related to the aspect of the orientation of the PDP based aspect in a well defined fashion respectively storage of the cloud based distributed fashion by which data migration followed by the service of the scalability oriented scenario takes place in the system in a well oriented fashion respectively. Where there is an integration of the service provider followed by the users in a well defined fashion that too with respect to the storage of the cloud followed by the network oriented with the distributed environment in a well oriented fashion respectively. Here a technique is proposed based on the strategy of the cooperative scheme of the PDP in a well respective fashion takes place in the system and its representation by the verification of the homo morphed response in a well effective manner by the hierarchy of the index based fashion respectively. Here the system related to the aspect of the knowledge based on the zero strategy in which there is an analysis with respect to the strategy of the oriented response in the system based fashion by the analysis of the security oriented scheme in a well respective fashion takes place in the system respectively. Where there is an effective improvement in the performance on the aspect of the completeness and also with respect to the soundness knowledge in a well oriented fashion respectively. Therefore the system is designed with a well effective strategy by the above technique and it is successful in its implementation based aspect respectively. Simulations have been conducted the present method and a number

(2)

of analysis is made where there is an evaluation of the accurate performance based strategy followed by the outcome in a well oriented aspect respectively.

Keywords: Computation of the cloud, Dynamic scalability, Data authentication, Knowledge based zero strategy, Network related to the cooperative phenomena respectively.

1. INTRODUCTION

There is a lot of advancement related to the strategy of the computation oriented cloud in a well effective manner respectively. Here this particular strategy is implemented by the help of the internet based aspect in a well oriented fashion respectively. Service based on the storage oriented cloud is implemented by the rapid oriented strategy in a well effective manner and also the low cost comparative provision based strategy in a well oriented fashion respectively [1][2]. Here the data of the client is completely based on the service involvement followed by the reduced cost and the reliable data transfer in a well oriented fashion with the help of the reduced power respectively [3]. Here the environment related to the computation of the cloud based strategy plays an important role for the aspect of the analysis which is based on the design oriented phenomena in a well respective

fashion respectively. Where its

architecture is completely open followed by the accurate analysis and also the

implementation is quite efficient in its terminology in a well respective fashion takes place in the system respectively [4][5].

2. METHODOLOGY

Here the present method is

effective and efficient in terms of the performance based strategy followed by the outcome with respect to the entire system in a well oriented fashion respectively [6]. In this paper a method is designed with a well efficient frame work where the mechanism is very powerful for the implementation of the system in a well oriented aspect respectively. Here the implementation of the present method is shown in the above figure in the block diagram and is explained in the elaborative fashion respectively. There is a huge challenge for the present method where it is supposed to accurately analyze the problems of the previous methods in a well

efficient manner followed by the

improvement in the performance of the system where there is a controlled strategy of the degradation of the performance of

(3)

the several previous methods in a well oriented aspect respectively [7][8].

BLOCK DIAGRAM

Fig 1: Shows the block diagram of the present method respectively

3. EXPECTED RESULTS

A comparative analysis is made between the present method and the several previous methods in a well effective fashion and is shown in the below figure in the form of the graphical

representation is explained din the

elaborative fashion respectively. A lot of analysis is made between the present

method and huge number of the

computation is applied on the large number of the data sets ina well oriented fashion and which is applied on the

different types of the environment

respectively. There is a huge challenge for the present method in which it is supposed

to accurately analyze the problems of the previous methods in a well oriented

fashion and control the degraded

performance of the previous method and improve the outcome of the system respectively [9].

Fig 2: shows the graphical representation of the present method

respectively

4. CONCLUSION

In this paper a method is designed with a well efficient framework oriented strategy in which the implementation of the present method in its analysis followed by the respective strategy in a well oriented fashion by the improvement in the performance based aspect followed by the outcome of the system based aspect respectively. Here a new technique is proposed by the help of the scheme oriented with the PDP based analysis in a well oriented fashion respectively where there is a storage of the cloud based distributed strategy in a well respective fashion takes place in the system based

(4)

aspect respectively. Here the response related to the strategy of the homo morphic based environment where the verification is accurate in its aspect followed by the hierarchy of the index oriented hash function based phenomena in a well

analysis respectively. Here a new

technique is proposed based on the scheme oriented with scheme of the PDP based strategy in which cooperative phenomena in a well oriented fashion by the help of the scalable of the dynamic support in a well respective fashion takes place in the system by the help of the servers oriented

multiple storage based strategy

respectively. Here we finally conclude that the present method is used in the improved perspective for the overall system based analysis in a well respective fashion respectively.

REFERENCES

[1] L. Fortnow, J. Rompel, and M. Sipser, “On the power of multiprover interactive protocols,” in Theoretical Computer Science, 1988, pp. 156–161.

[2] Y. Zhu, H. Hu, G.-J. Ahn, Y. Han, and

S. Chen, “Collaborative integrity

verification in hybrid clouds,” in IEEE Conference on the 7th International Conference on Collaborative Computing:

Networking, Applications and

Worksharing, CollaborateCom, Orlando,

Florida, USA, October 15-18, 2011, pp. 197–206.

[3] M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. H. Katz, A. Konwinski, G. Lee, D. A. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, “Above the clouds: A berkeley view of cloud computing,” EECS Department, University of California, Berkeley, Tech. Rep., Feb 2009.

[4] D. Boneh and M. Franklin, “Identity-based encryption from the weil pairing,” in Advances in Cryptology (CRYPTO’2001), vol. 2139 of LNCS, 2001, pp. 213–229.

[5] O. Goldreich, Foundations of

Cryptography: Basic Tools. Cambridge University Press, 2001.

[6] P. S. L. M. Barreto, S. D. Galbraith, C. O’Eigeartaigh, and M. Scott, “Efficient pairing computation on supersingular

abelian varieties,” Des. Codes

Cryptography, vol. 42, no. 3, pp. 239–271, 2007.

[7] J.-L. Beuchat, N. Brisebarre, J. Detrey, and E. Okamoto, “Arithmetic operators for pairing-based cryptography,” in CHES, ser. Lecture Notes in Computer Science, P. Paillier and I. Verbauwhede,

Eds., vol. 4727. Springer, 2007, pp. 239– 255.

(5)

[8] H. Hu, L. Hu, and D. Feng, “On a class of pseudorandom sequences from elliptic

curves over finite fields,” IEEE

Transactions on Information Theory, vol. 53, no. 7, pp. 2598–2605, 2007.

[9] A. Bialecki, M. Cafarella, D. Cutting, and O. O’Malley, “Hadoop: A framework for running applications on large clusters built of commodity hardware,” Tech. Rep., 2005.[Online].