Dynamic Data Security Assurance In Cloud Computing

SK Davood, M Ganesh Babu


We create cloud-helped remote detecting systems for empowering dispersed agreement estimation of obscure parameters in a given geographic range. We first propose an appropriated sensor system virtualization calculation that looks for, chooses, and directions Internet-available sensors to perform a detecting undertaking in a particular locale. The emergence of yet more cloud offerings from a multitude of service providers calls for a meta cloud to smoothen the edges of the jagged cloud landscape. This meta cloud could solve the vendor lock-in problems that current public and hybrid cloud users face.    The cloud computing paradigm has achieved widespread adoption in recent years. Its success is due largely to customers’ ability to use services on demand with a pay-as-you go pricing model, which has proved convenient in many respects. Low costs and high flexibility make migrating to the cloud compelling. Despite its obvious advantages, however, many  companies hesitate to  “move  to  the  cloud,” mainly because of concerns related to service availability,  data  lock-in,  and  legal  uncertainties. Lock in is particularly problematic Our reproduction results demonstrate that the proposed calculation, when contrasted with traditional ADMM (Alternating Direction Method of Multipliers), diminishes correspondence overhead essentially without trading off the estimation mistake. Furthermore, the joining time, however builds somewhat, is still straight as on account of ordinary ADMM.


S. Abdelwahab, B. Hamdaoui, M. Guizani, and A. Rayes. Enabling smart cloud services through remote sensing: An internet of everything enabler. Internet of Things Journal, IEEE, 1(3):276–288, June 2014.

M. T. Beck, A. Fischer, H. de Meer, J. F. Botero, and X. Hesselbach. A distributed, parallel, and generic virtual network embedding framework. In Communications (ICC), 2013 IEEE International Conference on, pages 3471–3475. IEEE, 2013.

A. Belbekkouche, M. Hasan, A. Karmouch, et al. Resource discovery and allocation in network virtualization. Communications Surveys & Tutorials, IEEE, 14(4):1114–1128, 2012.

K. Birman. The promise, and limitations, of gossip protocols. ACM SIGOPS Operating Systems Review, 41(5):8–13, 2007.

S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. Information Theory, IEEE Transactions on, 52(6):2508–2530, 2006.

S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. 2011.

X. Cheng, S. Su, Z. Zhang, H. Wang, F. Yang, Y. Luo, and J. Wang. Virtual network embedding through topology-aware node ranking. ACM SIGCOMM Computer Communication Review, 41(2):38–47, 2011.

R. Duan and S. Pettie. Linear-time approximation for maximum weight matching. Journal of the ACM (JACM), 61(1):1, 2014.

S. Ferretti. Gossiping for resource discovering: An analysis based on complex network theory. Future Generation Computer Systems, 29(6):1631–1644, 2013.

A. Fischer, J. F. Botero, M. Till Beck, H. De Meer, and X. Hesselbach. Virtual network embedding: A survey. Communications Surveys & Tutorials, IEEE, 15(4):1888–1906, 2013.

F. Garin and L. Schenato. A survey on distributed estimation and control applications using linear consensus algorithms. In Networked Control Systems, pages 75– 107. Springer, 2010.

I. Houidi, W. Louati, and D. Zeghlache. A distributed virtual network mapping algorithm. In Communications, 2008. ICC’08. IEEE International Conference on, pages 5634–5640. IEEE, 2008.

Full Text: PDF [FULL TEXT]


  • There are currently no refbacks.

Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.