Multiple Resource Acquisition in Cloud Computing using CABOB Algorithm
Keywords:
Hybrid cloud, Bastion, CABOB algorithm, QOSAbstract
Hybrid cloud may be a composition of two or a lot of clouds (private, community or public) that stay distinct entities however are sure along, providing the advantages of multiple readying models. Hybrid cloud also can mean the flexibility to attach collocation, managed and/or dedicated services with cloud resources. In existing Bastion, a completely unique and economical theme that guarantees knowledge confidentiality not with standing the encryption key is leaked and also the somebody has access to the majority ciphertext blocks. we analyze the safety of Bastion, and that we measure its performance by suggests that of a paradigm implementation. Cloud users submit their necessities, and successively vendors submit bids containing value, QoS and their offered sets of resources. The projected approach is scalable, that is critical providing there area unit an oversized variety of cloud vendors, with a lot of frequently showing. we have a tendency to perform experiments for acquisition value and quantifiability effectuality on the CABOB algorithm using various customary distribution benchmarks like random, uniform, decay and CATS.
References
- P.Mell and T.Grance, The NIST Definition of Cloud Computing.National Institute of Standards and Technology (NIST), US Dept.of Commerce, Sep.2011, 2L.Badger, T.Grance, R.Patt-Corner, and J.Voas, Cloud Computing Synopsis and Recommendations.National Institute of Standards and Technology (NIST), US Dept.of Commerce, May 2012,
- Y.O.Yazir, C.Matthews, R.Farahbod, S.Neville, A.Guitouni, S.Ganti, and Y.Coady, "Dynamic resource allocation in computing clouds using distributed multiple criteria decision analysis," in Proceedings of the 2010 IEEE 3rd International Conference on Cloud Computing, ser.CLOUD ’10.Washington, DC, USA: IEEE Computer Society, 2010
- F.Ridder and A.Bona, Four Risky Issues When Contracting for Cloud Services.Gartner Research Report G00210385, Feb.2011.
- R.Weiss and A.Mehrotra, "Online dynamic pricing: Efficiency, equity and the future of e-commerce," Virginia Journal Of Law And Technology, vol.6, no.2, 2001.
- C.Charnes, J.Pieprzyk, and R.Safavi-Naini, "Conditionally secure secret sharing schemes with disenrollment capability," in ACM Conference on Computer and Communications Security (CCS), 1994, pp.89-95.
- A.Desai, "The security of all-or-nothing encryption: Protecting against exhaustive key search," in Advances in Cryptology (CRYPTO), 2000, pp.359-375.
- C.Dubnicki, L.Gryz, L.Heldt, M.Kaczmarczyk, W.Kilian, P.Strzelczak, J.Szczepkowski, C.Ungureanu, and M.Welnicki, "HYDRAstor: a Scalable Secondary Storage," in USENIX Conference on File and Storage Technologies (FAST), 2009, pp.197-210.
- M.Durmuth and D.M.Freeman, "Deniable encryption with negligible detection probability: An interactive construction," in EUROCRYPT, 2011, pp.610-626.
- S.Penmatsa and A.Chronopoulos, "Price-based user-optimal job allocation scheme for grid systems," International Symposium on Parallel and Distributed Processing, p.396, April 2006.
- X.Xie, J.Huang, H.Jin, S.Wu, M.Koh, J.Song, and S.See, "Pricing strategies in grid market: Simulation and analysis," International Conference on Grid and Cooperative Computing, pp.532-538, October 2008.
- R.Buyya, D.Abramson, J.Giddy, and H.Stockinger, "Economic models for resource management and scheduling in Grid computing," Concurrency and Computation: Practice and Experience, vol.14, no.13-15, pp.1507-1542, 2002.
- I.Foster, C.Kesselman, C.Lee, B.Lindell, K.Nahrstedt, and A.Roy, "A distributed resource management architecture that supports advance reservations and co-allocation," in International Workshop on Quality of Service, 1999.
- H.Casanova and J.Dongarra, "Netsolve: A network server for solving computational science problems," in The International Journal of Supercomputer Applications and High Performance Computing, 1995.
- S.J.Chapin, D.Katramatos, J.F.Karpovich, and A.S.Grimshaw, "The legion resource management system," in Proceedings of the Job Scheduling Strategies for Parallel Processing, ser.IPPS/SPDP ’99/JSSPP ’99.London, UK: Springer-Verlag, 1999.
- S.Parsons, J.A.Rodriguez-Aguilar, and M.Klein, "Auctions and bidding: A guide for computer scientists," ACM Computing Surveys, vol.43, no.2, Jan.2011,
- B.Rochwerger, J.Tordsson, C.Ragusa, D.Breitgand, S.Clayman, A.Epstein, D.Hadas, E.Levy, I.Loy, A.Maraschini, P.Massonet, H.M.noz, K.Nagin, G.Toffetti, and M.Villari, "RESERVOIR— when one cloud is not enough," IEEE Computer, Mar.2011.
- M.Bichler, J.Kalagnanam, K.Katircioglu, A.J.King, R.D.Lawrence, H.S.Lee, G.Y.Lin, and Y.Lu, "Applications of flexible pricing in business-to-business electronic commerce," IBM Syst.J., vol.41, no.2, pp.287-302, 2002.
- Y.Narahari, C.Raju, K.Ravikumar, and S.Shah, "Dynamic pricing models for electronic business," Sadhana, vol.30, pp.231-256, 2005,
- S.Chaisiri, B.-S.Lee, and D.Niyato, "Optimization of resource provisioning cost in cloud computing," IEEE Transactions on Services Computing, vol.5, 2012
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.