ISSN: 2277-3754

ISO 9001:2008 Certified
International Journal of Engineering and Innovative Technology (IJEIT)
Volume 2, Issue 5, November 2012

Online Data Back-up and Disaster Recovery
Techniques in Cloud Computing: A Review
Kruti Sharma, Kavita R Singh
Computer Science Engineering, YCCE, Nagpur (M.S), 441 110, India
Abstract— Today, in electronic format data has been generated
in large amount that required the data recovery services. We know
that the cloud computing introduces a new type of computing
platform in today’s world. This type of computing will generates a
large amount of private data on main cloud. Therefore, the
necessity of data recovery services are growing day-by-day and it
requires a development of an efficient and effective data recovery
technique. The purpose of recovery technique is to help user to
collect information from any backup server when server lost his
data and unable to provide data to the user. To achieve this
purpose, many different techniques have been proposed till date.
In this review paper, we explore few recent techniques that are the
powerful solutions in the form of “Online Data Backup and
Disaster Recovery Techniques”. The objective of this review paper
is to summarize the powerful data backup recovery techniques
that are used in cloud computing domain.
Index Terms—Backup; Privacy; Central Repository; Remote
Repository, Parity cloud, Parity Cloud Service.

National Institute of Standard and Technology defines as a
model for enabling convenient, on-demand network access to
a share pool of configurable computing service (for
example, networks, servers, storage, applications and
services) that can be provisioned rapidly and released with
minimal management effort or services provider [1]. Cloud
computing is no longer a buzzword today. In addition, it
changes and improves the way we uses the computing
In today’s world, there is a huge increase in the electronic
data. This requires large volume of data storage devices to
store this large amount of data. These requirement leads to
introduction of 3 Tera Byte HDD. Therefore, usually
consumer prefers to store large amount of private data in
cloud. Unfortunately, if cloud will be corrupted or damaged it
leads to the loss of all important and private data then there
should be some mechanisms to take back-up of the data, and
provide the data at the time of cloud failure or loss of data.
As we know that plain data back-up techniques are having
many reliability and security problems. However the plain
back-up techniques are not convenient and reliable as well. So
to overcome from plain data backup and recovery problem, it
requires more safe and effective system such as RAID
(Redundant Array Independent Disk), HSDRT [1], PCS [2],
ERGOT [3], Linux Box [5], Cold and Hot back-up technique
[6], SBBR [10], REN [17] etc. These systems provide high
privacy protection and reliability however some increases the
cost where as some are unable to maintain the implementation

complexity low. Although many backup and recovery
techniques have been proposed during last few years in the
computing domain; however, real world scenarios remain a
challenge. In this review paper, we focuses on the various
techniques of back-up and recovery on cloud computing.
Each technique is greatly affected in real time scenario either
in redundancy point of view or security point of view or
complex algorithm’s implementation point of view.
This paper is organized as follows: Section II explains the
need of cloud computing. In Section III we discuss about the
Remote Data Backup Server. The existing methods that are
successful to some extent in the cloud computing domain are
reviewed in Section IV. Finally, in Section V discussion and
conclusions are given.
Cloud computing provides on demand resources to the
consumer/user. It requires the management of resources
among each and every client/user. Such management includes
various aspects of proper utilization of the resources. The
resources can be any hardware or software. The software like
any application programming interface, application
development kit and any type of data file etc. Various choices
are there among various implementations for back up of the
data and that maintain its security among various users. Cloud
computing must be able to provide reliability such that users
can upload their sensitive and important data. The
cost-effective approach is the main concern while
implementing any cloud.
During the study of cloud computing, we found various
advantages of cloud computing. In advantages, we found that
the cloud is capable enough to store the huge amount of data
of various different clients with complete security such that
Internet Service Provider (ISP) provides a huge storage in a
cloud to the user. And users are allow to upload there private
and important data to the main cloud. And at the same time we
found critical issue regarding this storage i.e. if any of the
client’s data file is missing or disappeared for some reason or
the cloud get destroyed either due to any natural calamity (like
flood, earthquake etc.), then for back-up and recovery
consumer/client has to depend on service provider which
means the data has to be stored in the server.
To overcome problem of such scenario, it requires an
efficient technique for data backup and recovery so that the
client can able to contact the backup server where private data
is stored with high reliability and whenever a main cloud fails
to provide the user’s data. These techniques must possess the


1) Privacy and ownership Different clients access the cloud with their different login or after any authentication process. As shown in Fig 1. 6) Appropriate Timing. The Relocation of server means to transfer main server’s data to another server. REN [17] that have addressed the aforesaid issues. REMOTE DATA BACK-UP SERVER Remote Data Backup server is a server which stores the unintentionally by third party or any other client. we detail few recent techniques HSDRT [1]. the privacy and ownership of data should be maintained. then data to the client immediately whenever they required either clients are allowed to access the files from remote repository from main cloud or remote server. smart phones. the need of the back-up and recovery techniques complete protection. recent techniques of back-up and recovery in cloud 3) Data security. 5) Cost effectiveness The cost for implementation of remote server and its recovery & back-up technique also play an important role while creating the structure for main cloud and its correspondent remote cloud. the main functions are Data Centre. 1. EXISTING METHODS In our literature survey. IV. such as cost controlling. we found many techniques that are having their unique ways to create backup and recovery. ERGOT [3]. Supervisory server and third. The cost for establishing the remote setup and for implementing its technique must be minimum such that small business can afford such system and large business can spend minimum cost as possible.ISSN: 2277-3754 ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 2. High Security Distribution and Rake Technology (HS-DRT) The HS-DRT [1] is an innovative file back-up concept. Hence. Cold and Hot back-up technique [6]. all those techniques focus on three different aspects.e. Such a security should be followed in its for cloud computing arises due to heavy storage of its clients. That means. SBBR [10]. Remote data Backup Server and its Architecture The Remote backup services should cover the following soon as possible without concerning the fact that remote repository is how far away from the client. then it uses the information from the remote characteristics. data duplication and security issues. indirectly). In forthcoming section. November 2012 low cost as well for implementation of the recovery problem’s 3) Data security The client’s data is stored at central repository with solution and can easily recover the data after any disaster. the data should be fully protected such that no access and harm can be made to the remote cloud’s data either intentionally or III. 2) Relocation of server For data recovery there must be relocation of server to the cloud. And if the central repository lost The remote cloud must possess the reliability its data. both the server must be able to provide the found that data is not available on central repository. Because in cloud computing the main cloud repository. computing domain. Second. (i. 4) Reliability. Each of the technique has the complete focus on their aim of backup and recovery. which makes use of an effective ultra-widely distributed data transfer mechanism and a high-speed encryption technology. In remote repository. A. The purpose is to help clients to collect stores the complete data and each client is dependent on the information from remote repository either if network main cloud for each and every little amount of data. 6) Appropriate Timing The process of data recovery takes some time for retrieval of data from remote repository as this remote repository is far away from the main cloud and its clients. Further. Issue 5. They are freely allowed to upload their private and essential data on the cloud. various client nodes specified by admin. The clients get the data in same way as before without any intimation of relocation of main server. issues: There are many techniques that have focused on these 1) Privacy and ownership. PCS [2]. That’s why. if clients role. write or any other operation. Remote Server must maintain this Privacy and ownership. The client nodes are composed of PCs. issues. the time taken for such a retrieval must be minimum as possible such that the client can get the data as Fig. therefore connectivity is not available or the main cloud is unable to the cloud and remote backup cloud must play a trustworthy provide the data to the clients. Owner of the data should only be able to access his private data and perform read. such that it provides the location transparency of relocated server to the clients and other third party while data is been shifted to remote server. however the new of location is unknown to the client. Network Attached Storage and storage 250 . main cloud’s entire data as a whole and located at remote 4) Reliability place (far away from cloud). we will be discussing some of 2) Relocation of servers to the cloud. 5) Cost effectiveness. remote repository as well. Therefore. Linux Box [5]. It consists of 3 components: First. Broadly speaking.

The Data Center encrypts the fragmentations initialization process for any data block in the virtual disk. Second limitation is block with its seed block. Pr = Pn. node 2 generates an recovery process cannot finish if one or more participating intermediate parity block via XORing the received parity nodes are not online at the recovery time. make parity groups across receiving the message. Though these processes. j i ) and sends to Exclusive–OR ( ) for creating Parity information. sends the metadata used for deciphering the series of the Storage Manager refers to the corresponding value in the fragments. S2. More important finding in our literature survey is server from node 4 is XORed with the temporary random that the effect of the individual disk reliability varies block. Supervisory Server can recover the original data that should 3) Data Block Recovery: be backed-up. When a nodes in a random order. r. it can be recovered using However there are some limitation in this model and the parity block provided by the PCS server and encoded data therefore. The initialization process occurs only once for The basic procedure in the proposed network system is each parity group. duplication. Bin. receiving the recovery request message. November 2012 service [1]. Issue 5. other nodes are not decryption will be completed. in order to that the n-th data block in nodei . A PCS has low cost for nodei for recovery along with the IP address of node i to all recovery and can recover data with very high probability. The encoded data block. merged. when the 2) Parity Block Update: Data Center receives the data to be backed-up. the 1st node (node 1) perfect solutions to backup and recovery due to some generates an intermediate parity block via r S1 and sends it limitations. and set the corresponding [1]. Accordingly. If there are any off-line nodes. that. for later use. Pn. and thereafter generation bitmap (PG-bitmap) . PCS uses a new technique of generating virtual PCS server sends the message when they become on-line. When a data block is corrupted. again. In Recovery Sequence. The PCS server sends Pr along with easy to use and more convenient for data recovery which is the list of nodes that will send their encoded data block to based on parity recovery service. the nodei recovers the corrupted data block by 1) Initial Parity Generation: Bin = Pr E1 ··· Ei-1 Ei+1 ··· E |VDPG|. it encrypts The Storage Manager in PCS agent maintains parity scrambles. On necessary to be well adjusted to use the HS-DRT engine. the seed block (Si) is generated for virtual disk. this model is somehow unable to declare as perfect blocks provided by other nodes in the parity group. by XORing the n-the data block with r algorithms for PCS work as follows by using the (Ej = Bin r. Then. the PCS server Second. Assume solution for back-up and recovery. the data recovery. second is Recovery sequence. Pr = Pn Parity Cloud Service technique (PCS) [2] is a very simple.ISSN: 2277-3754 ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 2. For other nodes in the group. several related intermediate parity block (Pt) by XORing the new block with information of fragmentation. for B. On disk in user system for data backup. They are connected with a supervisory server in seed blocks (((((r S1) S2) S3) S4) r = S1 S2 addition to the Data Centre via a secure network. For each VDPG. E. Nodei fully utilize the HS-DRT processor. the to its successor. r. again at the second stage and distributes them to the client The PG-bitmap is referred when a block is updated. The final block transferred to the PCS time failure. it generates a temporary be degraded accordingly for executing the web application. Parity Cloud Service Technique recovery process. The metadata are composed of encryption keys PG-bitmap. divides into some fragmentations. In the updating process. Otherwise. each node generates their own virtual disk. If it is 0. and a temporary parity block. These are: First. On receiving the r block. In Backup sequence. for each node j VDPG. and sends it to its successor. the Data Center block (Bold) in nodei is to be updated to a new block (Bnew). has been corrupted. (1) In this. Otherwise. Note that the parity block reception procedure and they are decrypted. the intermediate some disasters occur or periodically.It indicate whether the parity duplicates that data to some extents to satisfy with the block for each data block in the virtual disk has been required recovery rate according to the pre-determined generated or not. nodei. and update can be easily done by the data updating node and the descrambled in the reverse order at the second stage and the PCS server. and distribution the seed block (Pt = Bnew Si). Then. P r. After sending the initialize message. Manager in the group. The bitmap is initialized (set to 0) after the service level. The seed parity block stored separately as follows in two sequences one is Backup sequence and from in the metadata region of each virtual disk. When the size of the VDPG is even. it is the recovery process when value in the PG-bitmap to 1. These limitations are [2]: first one is that. It collects the encrypted old block (Pt = Bnew _ Bold). then the Storage Manager generates an (both at the first and second stages). the needed to participate. r. the web applications are sends a recovery request message to the PCS server. S3 S4). At the same time. Apart from its best performance given by the algorithm the PCS server sends temporary random block (r) to the first discussed above PCS somehow lags behind in providing node. random block. is that when the number of duplicated copy of file identifies to which VDPG the node belongs to and reads the data increases the corresponding processor performance will corresponding parity block. and store parity data of parity group in cloud. to generate the seed parity block across all 251 . the Supervisory Server parity block is generated by XORing the new block and the starts the recovery sequence. node 2. Note that the whole virtual disk corruption can be PCS server sends the initialize message to each Recovery recovered by iterating the above data block recovery process. the PCS server fragmentations from various appropriate clients like rake also maintains the PG-bitmap. PCS is based on Markov process and calculate Mean node 3 and so on.

semantically similar service description. techniques. An extensive evaluation of the system in concerns with the cost reduction concept there exist some different network scenarios demonstrated its efficiency both inconsistencies between logical and physical configurations in terms of accuracy of search and network traffic. During the implementation of service. 2) It provides low cost cloud services by reducing infrastructure cost for the incremental data to the local site. It concerns IP logical shortcomings. ERGOT is built upon 3 components. it D. 252 . The lowest cost point of view we found a simple Linux box which will sync up the data at block/file model “Rent out the Rented Resources” [17]. We made a focus on this (HBSRS). The ERGOT system proposed semantic-driven failure and the most important factor it provides the network query answering in DHT-based systems by building a SON management system via multi-layer signaling . we found that one technique via DHT. rents it to the clients in form of cloud services. Efficient Routing Grounded on Taxonomy (ERGOT) Efficient Routing Grounded on Taxonomy [4] is a recovery process. DHTs and SONs both networks architectures have some failure scenario i. The application then interacts with the application The cooperating venture is paid for its infrastructure stack at the cloud service provider and does a onetime full utilization [17].ISSN: 2277-3754 ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 2. It aims to level from the cloud service provider to the consumer. as a product of service advertising F. ERGOT combines both these network connectivity that remains unchanged even after a router Concept. backup takes place it will do back-up of entire virtual machine. matchmaking and interface with cloud on a secured channel. constructed incrementally. Hence.g. It also exploits both coarse-grain service composition dynamically. Shared backup router resources(SBBR) In one of our survey. Generally. During subsequent check.e. On Comparing HBSRS with the CBSRS. According to efficient retrieval of data that is completely based on the the availability and the current state of service composition semantic similarity between service descriptions and service before the services interrupt. Cold and Hot Backup Service Replacement Strategy estimate the real data reliability of PCS.Linux Box Another technique to reduces the cost of the solution and is unable to includes optimization concept with cost reduction protect data from disaster. that may lead to some performance problem. (CBSRS) In Cold Backup Service Replacement Strategy (CBSRS) C.However it over a DHT. it fails to precisely E. which adopted to ensure the successful implementation of service we use to advertise semantic service description annotated composition. 3) It gives the monetary benefit only the Data but Sync the entire Virtual Machine[5] which with the large under-utilized technology infrastructure to the somehow waste the bandwidth because every time when established enterprises (cooperating ventures). (SBBR). because backup Network). the application vendor that rent the resources from venture(s) and after secures the channel using IP Security and in-flight encryption virtualization.However. The application will These three phases are discovery. In our survey. it show how service imposed maximum outage logarithmic performance bounds. It is based on three core objectives: 1) It backup. After a valid login. imposing a minimum number of with semantic similarity search models. we found a available. A enterprises and individuals are attracted towards low cost simple hardware box can do all these at little cost named as cloud services. enables the clustering of peer that have services and original services are executed at the same time. 3) A measure of semantic similarity among service basically focuses on the significant cost reduction and router description [4]. This solution eliminates consumer’s know the Cloud services are expensive and large number of dependency on the ISP and its associated backup cost.Rent Out the Rented Resources Another technique we found in the field of the data migration from one cloud service provider to other very easy. The limitation we found that a consumer can backup not cloud vendors to the clients. and then the first returned results of services will be include: 1) A DHT (Distributed Hash Table) protocol. It also makes the process of G. it restores the service requests. As we It is affordable to all consumers and Small and Medium Business (SMB). a transcendental recovery strategy for service technique as it is not a back-up technique but it provide an composition in dynamic network is applied [6]. However.This model is based on concept of cloud be secure and encrypted. The SON is the recovery cost increases accordingly. They have incorporates an application on Linux box that will perform proposed a three phase model for cross cloud federation. it backs up only the minimizes the cloud infrastructure cost. backup is a REN (Research Education Network) cloud. check for updates authentication. it is triggered upon the detection of the Semantic-based System for Service Discovery in Distributed service failures and it will not be triggered when the service is Infrastructures in cloud computing. In Hot Backup Service Replacement Strategy unique way of data retrieval. These components states. the backup services always remain in the activated functionality descriptions and at a finer level. it using concepts from ontology. 2) A SON (Semantic Overlay reduced service recovery time. Keahey et. It reduce the monetary cost of cloud services. Issue 5. Additionally DHT-based systems perform exact-match searches with [10]. network-wide shared router resources locations). introduced the concept of Sky and sync them with local storage. backup of the cloud onto local drives. however does not go well requirements that have a direct effect on the setting of the SBRR architecture (e. November 2012 according to the group size. The data transmission will Computing [15]. al.

Rather.2010. security. Yang Yang. However. Cloud and Grid Computing. “Disaster Recovery Mechanism using Widely Distributed Networking and Secure Metadata Handling Technology”. [5] Vijaykumar Javaraiah Brocade Advanced Networks and Telecommunication Systems (ANTS). IEEE TrustCom-11/IEEE ICESS-11/FCST-11. 2011. rents it to the get Complex control the implementation complexities. DISCUSSION AND CONCLUSION 6 Shared  It concerns  Inconsistencies In this paper. Jianwei An. All these techniques tried to cover different Network System Applications. However there are some techniques in which cost increases gradually as data increases. 45-48. it is unable to the Rented n. possible. Resources clients in form of  Resources must HSDRT has come out an efficient technique for the movable [17] cloud services kept under special clients such as laptop. maintain its privacy for each resource and also it try 7 Rent Out  Virtualizatio  Implementation to minimize the cost of infrastructure.” IEEE 5th International Conference. Sooyong Kang. 253 . Proceedings of the 4th edition of the UPGRADE-CN workshop. in this remote data back-up server. and S. pp 256-259. Inzai-shi. Ming Zeng. In addition. Dong-wook Kim. the optimization concept and redundancy. Paolo Missier and Carole Goble. 2011. [4] Giuseppe Pirr´o. 588-591. Sungmin Park. the role of a techniques maintaining the cost of implementation. “Recovery Strategies for Service Composition in Dynamic Network. we presented detail review of most recent backup with cost between logical and back-up and recovery techniques that have been developed in router reduction physical cloud computing domain. pp.” 10th IEEE/ACM International Conference on Cluster. Smart redundancy Phone 2 Parity  Reliable  Implementation Cloud  Privacy  complexity is Service[2] high  Low cost 3 ERGOT[4]  perform  Time exact-match complexity retrieval  Implementation  Privacy complexity 4 Linux  Simple  Required higher Box[5]  Low cost for bandwidth implementation  Privacy  Complete server Backup at a time 5 Cold /Hot  Triggered  Cost increases Back-up only when failure as data increases [3] Y. Domenico Talia. Although each one of the backup solution in cloud Linux Box model is having very simple concept of data computing is unable to achieve all the aforesaid issues of back-up and recovery with very low cost. All these performance approaches are able to provide best performances under all problem uncontrolled circumstances such as cost. Table-1 Comparison between Various Techniques of Back-Up and Recovery S.” International Conference on Cloud and Service Computing. November 2012 Strategy[6] detected gradually V. [6] Lili Sun. pp. in the list of applicability of backup process in the companies. Issue 5.” Fifth International Conference issues maintaining the cost of implementation as low as on Systems and Networks Communications. Noriharu Miyaho.Suzuki. due to the high model protection level is very low. “Parity Cloud Service: A Privacy-Protected Personal Hot back-up strategy that performs backup and recovery on Data Recovery Service.ISSN: 2277-3754 ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 2. Paolo Trunfio . smart phones etc. Similarly. For example. redundancy and recovery in includes short span of time. Yingxiao Xu. nevertheless it fails to  Cost depends attention due to manage the low cost for the implementation of the recovery on the rented concept and also unable to control the data duplication. “Performance cost infrastructure with the complex implementation and low Evaluation of a Disaster Recovery System and Practical security level. Therefore. optimization concept with cost Among all the techniques reviewed PCS is comparatively reduction reliable.” International Joint Conference of trigger basis of failure detection. infrastructure ERGOT is totally based on the semantic analysis and unable utilization to focus on time and implementation complexity.Kazuo Ichihara. Yinsheng Li and Weiwei Sun.Ueno.2010. “Backup for Cloud and Disaster Recovery for Consumers and SMBs. Detail review of this paper shows resources(S  Works even configurations may that these techniques have its own advantages and BBR)[10] lead to some if router fails disadvantages which are summarized in the Table-1. [7] Xi Zhou. “ERGOT: A Semantic-based System for Service Discovery in Distributed Infrastructures. On the contrary. SBBR remote data back –up server is very crucial and hot research focuses on the cost reduction. "A backup restoration algorithm of service composition in MANETs. Chiba. Shuichi Suzuki." Communication Technology ICCT 11th IEEE International Conference. With entirely new REFERENCES concept of virtualization REN cloud also focuses on the low [1] Yoichiro Ueno. 2009.Muzai Gakuendai.Miyaho. 2011. 2008.N Approach Advantage Disadvantage o 1 HSDRT[1]  Used for  Costly Movable clients  Increase like laptop. low  It is unable to implementation complexity. N. Junshuai Shi. However. however fails to concentrate on topic. Cold and [2] Chi-won Song.

[14] K. Issue 5. India and received B. A. Zhang.11-14 .berkeley.eecs. Nagpur. [20] R. India.Benefit of Using Cloud Computing to Extend the Capacity of Clusters.Du and H. Matsunaga. Dominic A. Vol. J. Huo.. Degree in Computer Science Engineering from the Sardar Vallabhbhai National Institute of Technology. “Web [10] Eleni Palkopoulou¤y. Surat. and now she is pursuing her Ph. Assuncao. vol.. in 2007. G. pp. Germany. Paratus. Patterson. M. “Cloud Computing Research and Development Trend. Tech. Ranchi. Fourth IEEE International Conference on Utility and Cloud Computing2011.” Proceedings of the 18th International Symposium on High Performance Distributed Computing (HPDC 2009). Syst Rev.WSPDS. [9] F. United Arab Emirates. Munich. S. Image Processing. Linfoot." 6th International Conference on Internet Technology and Secure Transactions. A. Rabkin.307-312.” IEEE ICCE Conference. December 2011. Her current research interests include the area of Data structures. Feeley. L. University of California. in 2000.” ICOMP. Schupke. [17] B. 2010. “Resilience in Multilayer Networks. Thomas Bauscherty. “Above the clouds: A Berkeley view of cloud computing”.Demeester et al.Shahabi. Konwinski. Nagpur University. Her current research interests include the area of Data structures. [18] Y. I. Rep. and A. the M. Stoica. Meyer. Tsugawa. Zaharia. 2009. A. Armbrust et al. emus: high availability via asynchronous virtual machine replication. Berkeley. in Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation. “Recovery Time Analysis for the Shared Backup Router Resources (SBRR) Architecture”. Kavita R Singh received the B. AUTHORS PROFILE Kruti Sharma received her Diploma in Computer Science and Engineering in 2008 from RGPV. Programming Languages (Dot net and PHP) and Cloud Computing.ISSN: 2277-3754 ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 2. “Instantaneous Failover via Virtual Machine Replication. 2008. YCCE. [13] T. Bhopal. M. Fabrice Huet. India. Warfield. Lee. McDougall and J. Buyya. 161–174. “Evaluating the Cost.2009. IEEE ICC. “Sky Computing”. [11] Balazs Gerofi.GCC’09. Services Peer-to-Peer Discovery Service. 37. pattern Recognition. 2010.” IEEE Second International Conference on Future Networks. Databases. pp. Nagpur. 93-97. India. IEEE Computer Society. Degree in Computer Science and Engineering from Birla Institute of 254 . vol. “Virtualization performance: perspectives and challenges ahead. “Utilizing Memory Content Similarity for Improving the Performance of Replicated Virtual Machines”. M. 2004. Lefebvre. D. 2009 . [16] Sheheryar Malik.” in proceedings of the 2009 Eight International Conference on grid and Co-operative Computing ser. N. 8. D. Chen. [19] A. IEEE Journal of Internet Computing. pp. Rough sets. Database. G. E Degree in Computer Science and Engineering from TulsiRamji Gaikwad Patil College of Engineering and Technology.Tech. C. and X. [12] P. December 2010. Nagpur in 2011. Hutchinson. p. D. Zoltan Vass and Yutaka Ishikawa. 13. 2011. pp. 43-51. 2009. . 1999. Anderson. She is also pursuing her M. Technology.Yu.Tech degree in Computer Science Engineering from YCCE. 2009. “A Novel Taxonomy for Consumer Metadata. X. She is currently a Assistant Professor in Computer Technology Department. Nagpur.BKashani.Costanzo and R. A.40-56. pp. “Virtual Cloud: Rent Out the Rented Resources. No. “Above the clouds: A Berkeley view of cloud” http://www.44. D.70-76.Abu Dhabi. Coughlin and S. [15] M. Cully.” SIGOPS Oper. C. Keahey. M.” IEEE Communications Magazine. Fortes. November 2012 [8] M.Chen.E degree in Computer Technology in 2000 from RGCERT.

Sign up to vote on this title
UsefulNot useful