CN109062501A - A kind of Dropbox polymerization based on IDA algorithm - Google Patents

A kind of Dropbox polymerization based on IDA algorithm Download PDF

Info

Publication number
CN109062501A
CN109062501A CN201810731725.6A CN201810731725A CN109062501A CN 109062501 A CN109062501 A CN 109062501A CN 201810731725 A CN201810731725 A CN 201810731725A CN 109062501 A CN109062501 A CN 109062501A
Authority
CN
China
Prior art keywords
dropbox
polymerization
cloud server
data
data fragmentation
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201810731725.6A
Other languages
Chinese (zh)
Inventor
许丽婷
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing College of Information Technology
Original Assignee
Nanjing College of Information Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing College of Information Technology filed Critical Nanjing College of Information Technology
Priority to CN201810731725.6A priority Critical patent/CN109062501A/en
Publication of CN109062501A publication Critical patent/CN109062501A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/061—Improving I/O performance
    • G06F3/0611—Improving I/O performance in relation to response time
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/061—Improving I/O performance
    • G06F3/0613—Improving I/O performance in relation to throughput
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0614—Improving the reliability of storage systems
    • G06F3/0617—Improving the reliability of storage systems in relation to availability
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/062—Securing storage systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0629—Configuration or reconfiguration of storage systems
    • G06F3/0631—Configuration or reconfiguration of storage systems by allocating resources to storage systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638—Organizing or formatting or addressing of data
    • G06F3/0643—Management of files
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G06F3/065—Replication mechanisms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
    • H04L67/1078—Resource delivery mechanisms
    • H04L67/108—Resource delivery mechanisms characterised by resources being split in blocks or fragments
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • Computer Security & Cryptography (AREA)
  • Computing Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The present invention provides a kind of Dropbox polymerizations based on IDA algorithm, including uploading and downloading two steps, wherein, uploading step: fragment processing is carried out to the subscriber data file for uploading to Dropbox polymerization Cloud Server using IDA algorithm, it is again that each data fragmentation creates fragment copy, then sends the data fragmentation for carrying redundancy in the higher ranked each Dropbox of QoS by Dropbox polymerization Cloud Server；Download step: client is polymerize from Dropbox and issues file read request to Dropbox polymerization Cloud Server, Dropbox polymerization Cloud Server reads the save location of each data fragmentation according to file read request, and data fragmentation is extracted from each Dropbox according to save location, it recycles IDA algorithm that the data fragmentation of extraction is reverted to subscriber data file again, sends back to Dropbox polymerization client.The Dropbox polymerization is conducive to improve availability and safety that user data is stored in data in Dropbox, is conducive to the QoS for improving Dropbox, improves the reliability that Dropbox uses.

Description

A kind of Dropbox polymerization based on IDA algorithm
Technical field
The invention belongs to the fields of computer information management technology, poly- more particularly, to a kind of Dropbox based on IDA algorithm Conjunction method.
Background technique
Cloud storage is developed by cloud computing, be for user distribute according to need network storage resource computer system, Cloud storage service quotient is exactly to be charged using this real-time, distribution according to need network storage resource.Currently, Dropbox product conduct The Typical Representative that cloud storage theory is realized receives more and more users the advantages that opening with it, is efficient, cheap Welcome.However the concern that user saves the privacy integrality of data beyond the clouds to them and controllably shares also increasingly increases It is long.Number of users is lost in the leakage of the cloud service providers such as Google, MediaMax and the Salesforce.com occurred in recent years According to the fact confirm the worry of people.Dropbox on network is varied, and many cloud storage service providers transmit in data With in storing process data are carried out with different degrees of encryption, but the main control of data is still rested in provider's hand, There is various hidden danger of threat data safety and availability in the use process of Dropbox.
Summary of the invention
The technical problem to be solved by the present invention is existing Dropbox in use there is threat data safety and Various hidden danger of availability.
In order to solve the above-mentioned technical problems, the present invention provides a kind of Dropbox polymerizations based on IDA algorithm, including such as Lower step:
Uploading step: the user data of Dropbox polymerization Cloud Server is uploaded to Dropbox polymerization client using IDA algorithm File carries out fragment processing, is each data fragmentation by subscriber data file cutting, then it is each for polymerizeing Cloud Server by Dropbox Data fragmentation creates fragment copy, then sends the data fragmentation for carrying redundancy in the higher ranked each Dropbox of QoS；
Download step: client is polymerize from Dropbox and issues file read request, Dropbox polymerization to Dropbox polymerization Cloud Server Cloud Server reads the save location of each data fragmentation according to file read request, and according to save location from each Dropbox Data fragmentation is extracted, recycles IDA algorithm that the data fragmentation of extraction is reverted to subscriber data file again, it is poly- to send back to Dropbox Close client.
Further, in uploading step, when QoS grade is responded by Dropbox polymerization Cloud Server by comparing each Dropbox Between, the overall ranking of mean transmission bandwidth and remaining space obtain, overall ranking, that is, Dropbox response time, mean transmission bandwidth And the sum of ranking of remaining space.
Further, in uploading step, higher ranked each of QoS is sent by the data fragmentation for carrying redundancy When in Dropbox, if Dropbox polymerization Cloud Server, which is connected to Dropbox, uploads successfully response to data fragmentation, Dropbox polymerize cloud service Device deletes fragment copy, if Dropbox polymerization Cloud Server, which is not connected to Dropbox, uploads successfully response to data fragmentation, Dropbox is poly- Cloud Server is closed the QoS grade degradation level-one of this Dropbox, and fragment copy is uploaded to the higher ranked Dropbox of another QoS On.
The beneficial effects of the present invention are: it can guarantee the integrality of user data using creation fragment copy, in Dropbox Polymerization Cloud Server is that each data fragmentation establishes fragment copy, and the upload of data fragmentation has to wait for the success of fragment copy creating It could start；It is sent in the higher ranked each Dropbox of QoS using by the data fragmentation for carrying redundancy, can be improved net The QoS and reliability of disk avoid that normal storage service cannot be timely responded to or cannot provided there is a situation where certain Dropbox；Due to User data file be utilized DA algorithm carry out redundant slices, as long as therefore receive partial data fragment therein, can to user text Part restores again.
Detailed description of the invention
Fig. 1 is uploading step schematic diagram of the invention；
Fig. 2 is download step schematic diagram of the invention.
Specific embodiment
As illustrated in fig. 1 and 2, the Dropbox polymerization provided by the invention based on IDA algorithm, includes the following steps:
Uploading step: the user data of Dropbox polymerization Cloud Server is uploaded to Dropbox polymerization client using IDA algorithm File carries out fragment processing, is each data fragmentation by subscriber data file cutting, then it is each for polymerizeing Cloud Server by Dropbox Data fragmentation creates fragment copy, then sends the data fragmentation for carrying redundancy in the higher ranked each Dropbox of QoS, Since each Dropbox is located at diverse geographic location, even if Dropbox provider takes the data of user, since data are It is fragmented, can not know file content, although the password of single Dropbox service provider is broken, and will not lead to letting out for data Leakage；
Download step: client is polymerize from Dropbox and issues file read request, Dropbox polymerization to Dropbox polymerization Cloud Server Cloud Server reads the save location of each data fragmentation according to file read request, and according to save location from each Dropbox Data fragmentation is extracted, recycles IDA algorithm that the data fragmentation of extraction is reverted to subscriber data file again, it is poly- to send back to Dropbox Close client.
Wherein, in uploading step, QoS grade by Dropbox polymerization Cloud Server by comparing each Dropbox response time, The overall ranking of mean transmission bandwidth and remaining space obtains, overall ranking, that is, Dropbox response time, mean transmission bandwidth with And the sum of ranking of remaining space, overall ranking are QoS grade sequence according to descending sort.
In uploading step, when sending the data fragmentation for carrying redundancy in the higher ranked each Dropbox of QoS, If Dropbox polymerization Cloud Server, which is connected to Dropbox, uploads successfully response to data fragmentation, Dropbox polymerize Cloud Server and deletes fragment Copy, if Dropbox polymerization Cloud Server, which is not connected to Dropbox, uploads successfully response to data fragmentation, Dropbox polymerize Cloud Server The QoS grade degradation level-one of this Dropbox, and fragment copy is uploaded in the higher ranked Dropbox of another QoS.
By IDA algorithm fragment data have redundancy, in this way, even if can only retrieving part data fragmentation, also can Complete restoring user data, this is the advantage place of IDA algorithm, resolves into n fragment, each fragment using by the file information F The size of Fi is m/mono- of source file F, and the size that all fragments add up is n/m times of original file size.Due to text Part by redundant slices, as long as therefore file can be restored again by receiving m fragment therein, wherein the redundancy of information be n/ (n-m)。
It if subscriber data file F is divided into n data fragmentation when storing, and is every number when carrying out data fragmentation A fragment copy is created according to fragment, { identifier, path } binary group is safeguarded to each fragment copy, wherein Identifier is the unique identifier of data fragmentation, and path is the Dropbox of the storage of corresponding fragment copy, it is assumed that has m net Disk can then indicate the storage condition of the data fragmentation copy of file F with matrix F n × m.
Not doing the part illustrated in above instructions is the prior art, or has both been able to achieve by the prior art.

Claims (3)

1. a kind of Dropbox polymerization based on IDA algorithm, which comprises the steps of:
Uploading step: the subscriber data file of Dropbox polymerization Cloud Server is uploaded to Dropbox polymerization client using IDA algorithm Fragment processing is carried out, is each data fragmentation by subscriber data file cutting, then polymerizeing Cloud Server by Dropbox is each data Fragment creates fragment copy, then sends the data fragmentation for carrying redundancy in the higher ranked each Dropbox of QoS；
Download step: client is polymerize from Dropbox and issues file read request to Dropbox polymerization Cloud Server, Dropbox polymerize cloud clothes Business device reads the save location of each data fragmentation according to file read request, and is extracted from each Dropbox according to save location Data fragmentation recycles IDA algorithm that the data fragmentation of extraction is reverted to subscriber data file again, sends back to Dropbox polymerization visitor Family end.
2. the Dropbox polymerization according to claim 1 based on IDA algorithm, which is characterized in that in uploading step, QoS grade is by Dropbox polymerization Cloud Server by comparing each Dropbox response time, mean transmission bandwidth and remaining space Overall ranking obtains, the sum of overall ranking, that is, Dropbox response time, mean transmission bandwidth and ranking of remaining space.
3. the Dropbox polymerization according to claim 1 based on IDA algorithm, which is characterized in that, will in uploading step When the data fragmentation of carrying redundancy is sent in the higher ranked each Dropbox of QoS, if Dropbox polymerization Cloud Server is connected to Dropbox uploads data fragmentation and successfully responds, then Dropbox polymerization Cloud Server deletes fragment copy, if Dropbox polymerize cloud service Device is not connected to Dropbox and uploads successfully response to data fragmentation, then Dropbox polymerization Cloud Server degrades the QoS grade of this Dropbox Level-one, and fragment copy is uploaded in the higher ranked Dropbox of another QoS.
CN201810731725.6A 2018-07-05 2018-07-05 A kind of Dropbox polymerization based on IDA algorithm Pending CN109062501A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810731725.6A CN109062501A (en) 2018-07-05 2018-07-05 A kind of Dropbox polymerization based on IDA algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810731725.6A CN109062501A (en) 2018-07-05 2018-07-05 A kind of Dropbox polymerization based on IDA algorithm

Publications (1)

Publication Number Publication Date
CN109062501A true CN109062501A (en) 2018-12-21

Family

ID=64819423

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810731725.6A Pending CN109062501A (en) 2018-07-05 2018-07-05 A kind of Dropbox polymerization based on IDA algorithm

Country Status (1)

Country Link
CN (1) CN109062501A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110233793A (en) * 2019-05-28 2019-09-13 南京翼彩云信息科技有限公司 A kind of secure storage gateway and object storage method based on object storage
CN110430274A (en) * 2019-08-09 2019-11-08 西藏宁算科技集团有限公司 A kind of document down loading method and system based on cloud storage
CN113285876A (en) * 2020-02-19 2021-08-20 中兴通讯股份有限公司 Routing method, routing device and computer readable storage medium
WO2021169397A1 (en) * 2020-02-27 2021-09-02 华为技术有限公司 Mirror image storage and download method, device and system

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011082414A1 (en) * 2010-01-04 2011-07-07 Telcordia Technologies, Inc Feasibility, convergence, and optimization of lte femto networks
CN102831037A (en) * 2012-07-17 2012-12-19 高旭东 Data path fragmentation redundancy protection structure
CN107870726A (en) * 2016-09-26 2018-04-03 北京优朋普乐科技有限公司 Date storage method and device, server based on redundancy scheme
CN107977578A (en) * 2016-10-25 2018-05-01 中兴通讯股份有限公司 A kind of distributed memory system and its data recovery method and device
CN108200169A (en) * 2017-12-30 2018-06-22 广东技术师范学院 A kind of first Placement Strategy control method of the copy of cloud storage system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011082414A1 (en) * 2010-01-04 2011-07-07 Telcordia Technologies, Inc Feasibility, convergence, and optimization of lte femto networks
CN102831037A (en) * 2012-07-17 2012-12-19 高旭东 Data path fragmentation redundancy protection structure
CN107870726A (en) * 2016-09-26 2018-04-03 北京优朋普乐科技有限公司 Date storage method and device, server based on redundancy scheme
CN107977578A (en) * 2016-10-25 2018-05-01 中兴通讯股份有限公司 A kind of distributed memory system and its data recovery method and device
CN108200169A (en) * 2017-12-30 2018-06-22 广东技术师范学院 A kind of first Placement Strategy control method of the copy of cloud storage system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
林慧: "云存储技术在网盘聚合系统中的应用研究", 《山西青年》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110233793A (en) * 2019-05-28 2019-09-13 南京翼彩云信息科技有限公司 A kind of secure storage gateway and object storage method based on object storage
CN110430274A (en) * 2019-08-09 2019-11-08 西藏宁算科技集团有限公司 A kind of document down loading method and system based on cloud storage
CN113285876A (en) * 2020-02-19 2021-08-20 中兴通讯股份有限公司 Routing method, routing device and computer readable storage medium
CN113285876B (en) * 2020-02-19 2024-04-23 中兴通讯股份有限公司 Routing method, routing device and computer readable storage medium
WO2021169397A1 (en) * 2020-02-27 2021-09-02 华为技术有限公司 Mirror image storage and download method, device and system

Similar Documents

Publication Publication Date Title
CN109062501A (en) A kind of Dropbox polymerization based on IDA algorithm
AU2015259417B2 (en) Distributed secure data storage and transmission of streaming media content
CN106156359B (en) A kind of data synchronization updating method under cloud computing platform
EP2871817B1 (en) Combined cloud storage disk client, server and system, and combined cloud storage disk service serving method
US20050240749A1 (en) Secure storage of data in a network
CN102281314A (en) Realization method and apparatus for high-efficient and safe data cloud storage system
CN104836656B (en) A kind of storage of video file and transmission method
WO2012071712A1 (en) Method, device and system for accessing cloud storage data
CN114466015B (en) Data storage system and method based on multi-cloud architecture
Elkana Ebinazer et al. ESKEA: enhanced symmetric key encryption algorithm based secure data storage in cloud networks with data deduplication
CN111033459A (en) Microservice-based deduplication optimized for wide area networks
US10534667B2 (en) Segmented cloud storage
CN104902000A (en) Method for using p2p technology to fast transmit virtual machine template
CN110519656B (en) Self-adaptive streaming media playing method, system and server
CN114357252A (en) Storage method, system and storage medium of cross-source multi-domain distributed data
Sahbudin et al. A web client secure storage approach in multi-cloud environment
CN109962888A (en) A kind of anti-tamper business access method, client and server
CN111565144A (en) Data layered storage management method for instant communication tool
CN115189956A (en) File security sharing method
Carolin et al. Data loss protection and data security using agents for cloud environment
CN113194330A (en) Fragmented multi-cloud video resource management method and system
Liu et al. HASG: Security and efficient frame for accessing cloud storage
Janviriya et al. CloudyDays: Cloud storage integration system
WO2011007141A1 (en) Distributed storage
WO2017039538A1 (en) Systems and methods for unified storage services

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20181221