WO2004021214A1 - Verfahren und anordnung zur randomisierten datenspeicherung - Google Patents
Verfahren und anordnung zur randomisierten datenspeicherung Download PDFInfo
- Publication number
- WO2004021214A1 WO2004021214A1 PCT/EP2003/008635 EP0308635W WO2004021214A1 WO 2004021214 A1 WO2004021214 A1 WO 2004021214A1 EP 0308635 W EP0308635 W EP 0308635W WO 2004021214 A1 WO2004021214 A1 WO 2004021214A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- data storage
- data
- storage
- systems
- computer
- Prior art date
Links
Classifications
-
- 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]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9014—Indexing; Data structures therefor; Storage structures hash tables
-
- 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/0619—Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
-
- 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/0644—Management of space entities, e.g. partitions, extents, pools
-
- 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/0662—Virtualisation aspects
- G06F3/0667—Virtualisation aspects at data level, e.g. file, record or object virtualisation
Definitions
- the present invention relates to a method and an arrangement for randomized data storage in storage networks and / or an intranet and / or the Internet as well as a corresponding computer program product and a corresponding computer-readable storage medium, which can be used in particular for the distribution and retrieval of data in fault-tolerant as well as faulty systems such as storage networks, an intranet or the Internet.
- a distributed data server or a storage network, generally consists of a set of computer systems which are connected to a set of data storage systems via a network.
- the connection network between the computer systems and the data storage systems consists of a number of switches or routers which ensure delivery of the data packets between communicating units (see FIG. 1).
- In-band appliances are used in so-called in-band virtualization.
- the control authority the in-band appliance
- the in-band appliance is located in the data stream between the server and Storage.
- the control data as well as the user data run through the appliance, which appears to the servers as the storage system itself.
- the assignment of storage segments, also referred to as logical volumes, to each individual server takes place here.
- Control of data access also takes place via this appliance.
- the appliance is outside the data path and communicates via the network (for example a LAN) with the host bus adapter (HBA) in the server, which requires a special agent.
- the appliance defines the logical volumes that a server can use.
- In-Band has the advantage of being easy to integrate and maintain in the storage network. Since in-band operates in the data path, data security can be increased with little effort using a storage firewall in the SAN appliance. Out-band is more complex due to the interactions between the additional agents on the application servers and the SAN appliance. In contrast to in-band, this method occupies only a few ports in the switch, so that greater scalability is available, especially with large redundant SANs. In addition, a failure of the SAN appliance does not hinder data access.
- in-band appliances all read / write operations of the computer systems connected to the in-band appliances are only accepted by one of the in-band appliances before they are forwarded to the storage systems.
- the Functionality for the management and distribution of the data can be integrated both in the computer systems, in the routers and in the in-band appliances. It is assumed in the further course that the computer systems connected to a storage network or a distributed file server have all the information necessary for finding data.
- a web cache is a unit in a network that answers requests from web clients to represent one or more web servers.
- the web cache has a storage system on which parts of the content of the web server are stored. If the web cache does not store the information requested by a client, the request is forwarded to a higher-level web cache or the original web server and answered by it.
- Web caches are widely used on the Internet for various reasons. The use of a web cache can significantly reduce the latency that elapses between making a request from the web client to successfully delivering the information to the web client. This is particularly true if the bandwidth between the web cache and the web client is greater than the bandwidth between the web server and the web client or if the load on the web server is so high that it is too high Delivery of the data in the web
- the performance of the Internet can be significantly increased through the cooperation of several web caches, which are placed in different places on the Internet.
- the NLANR National Laboratory of Applied Network Research
- the Akamai caching system the caching services for companies deployed around the world.
- the main difference in the provision of methods for retrieving data in storage networks or distributed file servers and for web caches is that in the case of storage networks, the connected computer systems have all the information relating to the placement strategy that is necessary to find the data they use are. This includes, among other things, the number and properties of the connected servers and the data storage systems.
- the client In the case of web caches, on the other hand, the client has only a limited view of the overall system, ie he does not know all the web caches connected to the system.
- a suitable data management strategy should:
- 1. can fulfill any proportional division of the data blocks among the storage systems. For identical systems, the uniform distribution of the data blocks over the systems is generally required. 2. make it possible to be able to distribute the data questions to the data storage systems in accordance with the proportional allocation of the data blocks. In the case of different access frequencies to data blocks, this point is not automatically ensured by point 1. 3. be fault tolerant, d. H. Data storage system failures can withstand data loss. The lost parts should be able to be regenerated in the shortest possible time. 4. Ensure that when adding or removing data storage systems, as few data blocks as possible need to be re-placed in order to restore the above points. If possible, this should be done without noticeably affecting ongoing operations. 5. Ensure compact storage and efficient predictability of the placement.
- the data placement strategy must ensure that the highest possible number of accesses to the storage system is successful. H. be placed on a server storing the information.
- mapping is the so-called disk striping [CPK95], which is used in many approaches in different granularity [PGK88, TPBG93, BBBM94, BHMM93, HG92, BGMJ94, BGM95].
- RAID Redundant Array of Independent Disks
- RAID level Redundant Array of Independent Disks
- With disk striping the data blocks of the virtual address space (or partial blocks of these data blocks) are wrapped cyclically around the hard disks.
- the disadvantage of this strategy is that it is very inflexible with a changing number of hard drives. A change by just one hard disk can require an almost complete redistribution of the data blocks. For this reason, today's hard disk fields are difficult to scale. Hard disk systems with a large number of hard disks are therefore
- the object to be achieved by the invention is to provide a method and an arrangement for randomized data storage in storage networks and / or an intranet and / or the Internet, as well as a corresponding computer program product and a corresponding computer-readable storage medium, by means of which the the disadvantages mentioned above are eliminated and in particular an effective handling of storage networks which comprise heterogeneous storage media, and a dynamic one Scaling of storage networks is ensured by inserting or removing storage media.
- An arrangement for randomized data storage in storage networks and / or an intranet and / or the Internet is advantageously set up in such a way that it comprises at least one processor which is (are) set up such that a method for randomized data storage in storage networks and / or an intranet and / or the Internet, the randomized data storage comprising the method steps according to one of claims 1 to 14.
- a computer program product for randomized data storage in storage networks and / or an intranet and / or the Internet comprises a computer-readable storage medium on which a program is stored which enables a computer to be randomized after it has been loaded into the memory of the computer Perform data storage in storage networks and / or an intranet and / or the Internet, the randomized data storage comprising the method steps according to one of claims 1 to 14.
- a computer-readable storage medium is advantageously used, on which a program is stored which enables a computer after it has been loaded into the memory of the computer is to carry out a method for randomized data storage in storage networks and / or an intranet and / or the Internet, the randomized data storage comprising the method steps according to one of claims 1 to 14.
- pseudo-random functions are used in the first and / or second random process.
- Storage systems are each assigned at least one subspace Ij or Ik of the virtual storage space by the first random process, wherein
- the predefinable parameter describes the physical capacity of data storage systems or the request load of data storage systems or correct deviations from the desired distribution.
- C ' (c ⁇ >,..., c n >)
- c ⁇ - c k ⁇ ⁇ ⁇ jc ⁇ - c 'j (1 1,..., n).
- This procedure has the great advantage that, in contrast to a direct update, the system can react much faster to high demand loads or a new capacity distribution C 'chosen by the administrator, since the transition process from C to C' can be terminated in each C 1 .
- at least one table is provided for storing the data blocks in a storage medium, in which the association between the virtual address and the physical address is stored on the storage medium.
- Another advantage of the method according to the invention for randomized data storage is that a plurality of data blocks are combined to form an extent, which in the table have a common physical assigned address on the storage medium, the data blocks of an extent in the logical address space being connected to one another by the first data block of an extent consisting of 2 data blocks being given an address of the form x00 ... 000, the lower ⁇ bits being zero, the last block of this extent the address xll. , , 111 is obtained, the lowest ⁇ bits being one, and the physical position of a data block being obtained by adding the table entry for the associated extent to the last ⁇ bits of the logical address of the data block.
- This procedure reduces the number of table entries to be saved.
- the arrangement of at least one data storage system and / or at least one computer system which (reads) and / or writes (accesses) the storage media, and / or at least one between the (the ) Computer system (s) and the data storage system (s) switched controller unit for controlling the method comprises randomized data storage.
- the data storage systems advantageously include hard disk fields and / or buffers designed as web cashes
- the arrangement comprises at least one controller unit connected between the computer system (s) and the data storage system (s) for controlling the method for randomized data storage. It can prove useful that the method for randomized data storage is implemented as a hardware RAID method in the controller unit.
- the arrangement has at least one dedicated computer system (SAN appliance) connected via means for data exchange with storage media and computer systems of the arrangement for coordinating the data storage and / or via means for data exchange with storage media and Computer systems of the arrangement includes connected computing resources (in-band appliances) for the distribution of the data blocks. It is also an advantage that the arrangement comprises heterogeneous storage media.
- Fig. 1 construction of a storage network
- the solution to the task generally depends on whether the clients 3 connected to a system have all the information necessary for data distribution.
- the method according to the invention which is referred to below as a share strategy, presented, which is able to guarantee almost optimal distribution and access properties in both cases.
- the number of data blocks to be stored in a system is designated by m, the number of maximum usable data storage systems by N.
- N is specified by the data placement strategy and is not dependent on the current number and size of the data storage systems.
- the number of data storage systems actually available in the system is designated by n. In the event that the number of data blocks that can be stored by the data storage systems is less than m, it is necessary that a further storage system be made available into which data blocks that cannot currently be mapped can be swapped out.
- the size of the individual ci can depend on various factors, for example: B. from the storage capacity if it is a hard disk, or from the bandwidth of the connected connections in a web cache.
- the goal of a data placement strategy should be that on everyone
- the task of the data distribution strategy can now be divided into two task points.
- a data block with its virtual address must be assigned to a data storage system. This assignment is also referred to below as global data distribution.
- the data block In a second step, the data block must not only be assigned to a data storage system, but also to a position on this data storage system. This assignment is also referred to below as local data distribution.
- the invention deals with the problem of global data distribution. In the context of the description of the method according to the invention, simple local data distribution strategies are presented briefly, which supplement our new global data distribution strategies.
- a prerequisite for the use of the share strategy is that it can use a function as a subroutine that solves the problem of data distribution for uniforms
- each storage system is assigned one or more intervals, the total size of which corresponds to the relative capacity of the system. These intervals are mapped to a [0, 1) interval, but, unlike previous strategies, can overlap with other intervals.
- a real point in the [0, 1) interval is now assigned to each data block using a (pseudo) random function. This point may belong to multiple intervals of storage systems. If so, a uniform placement strategy is used to assign the data block to one of these storage systems. If the relative capacities of the storage systems change, the interval slopes are adjusted accordingly.
- the strategy used by the share strategy for uniform data storage systems is referred to below as uniform (b, S), where b describes the virtual address of the data block and S the amount of data storage systems.
- the return of the function is provided by the data storage system on which data block b is placed.
- the share strategy is based on two additional hash functions that must be provided in addition to the hash functions that may be used for the uniform strategy.
- the hash function h ⁇ ! ,. , , M ⁇ -> [0,1) distributes the data blocks pseudorandomly over the interval [0,1).
- Another hash ⁇ ! ,. , , M ⁇ -> [0,1) distributes the data blocks pseudorandomly over the interval [0,1).
- An interval Ii of length s * c ⁇ is now assigned to each virtual data storage system i, which ranges from g (i) to (g (i) + s * CiJmodl.
- the [0, 1) range is therefore regarded as a ring, um the individual intervals are wrapped.
- the constant s is called the stretch factor.
- ⁇ ⁇ y should be selected. A ⁇ ⁇ y is possible, but complicates the implementation of the method.
- an important advantage of the invention is that it allows the handling of changes in the storage network 1 in an extremely simple manner. Depending on the requirements, it can be useful to react to changing environments by adapting the share strategy.
- the simplest method is to go directly from C to C and make the appropriate relocations. This has the disadvantage that even with minor changes due to the use of pseudorandom functions may require repositioning of multiple blocks of data, and major changes may result in the system being in a transitional state for a long time, which may jeopardize the maintenance of the fourth point of the data management strategy requirements mentioned above.
- Variant 2 Lazy Update In the following, a strategy is presented that ensures that no data can be redistributed with very small changes in capacity.
- 0 ⁇ ⁇ 1 be a fixed constant, which is called the inertia of the share strategy.
- the share strategy only changes the relative capacity of a data storage system i from Ci to Ci 'if Ci'> (1 + ⁇ ) Ci or Ci 1 ⁇ (1 - ⁇ ) Ci.
- the sum of the relative capacities across all data storage systems can deviate from 1, but remains in the range of 1 ⁇ ⁇ , so that the properties of the share strategy are not endangered if the ⁇ is small.
- the choice of capacities for share does not necessarily depend on the physical capacity of a storage system. Since Share allows any capacity distribution, the Share capacities can also be used to better balance the request load, for example to eliminate bottlenecks in the connections to storage systems or in the storage systems themselves. They can also be used to compensate for deviations from the desired distribution (which cannot be ruled out due to the use of pseudo-random hash functions).
- the share strategy thus allows a high degree of flexibility in the distribution of data and a high level of robustness, and thus fulfills important requirements for a storage system.
- high probability means that the probability that an area is not covered is less than / yn.
- Ck ibt the control of the distribution of the intervals that not every point of the
- the covering can be done by adapting the stretch factor.
- the expected time to calculate the data storage system belonging to a data block is 0 (1).
- the memory complexity for the calculation of the share strategy is 0 (s * k * (n + ys)) - the memory and calculation complexity of the hash functions used are not included here.
- the following sections show how the construction of data storage systems can be carried out efficiently using the share strategy. It is pointed out that these are only implementation examples.
- the first step shows how the functionality can be integrated into a general RAID system:
- the share strategy can be used to build up hard disk fields in systems that consist of a large number of storage media, several computer systems and a controller unit.
- the share strategy can be integrated in the connected computer systems as a software RAID procedure, as well as in the controller unit as a hardware RAID procedure.
- the share strategy is responsible for the assignment of the data blocks via the hard disks, the assignment of the data block to a physical address on the hard disk is carried out by a strategy lying under the share strategy.
- One way of assigning the physical position is to provide tables in which an assignment between the virtual address and the physical address is stored on the hard disk.
- An extent is a set of blocks that are linked together in the logical address space.
- An extent consists of 2 ⁇ blocks. The first block of the extent has an address of the form x00. , , 000, the lower ⁇ bits 7 being represented by the digit zero. The last block of the extent has the address xll. , , III, the lowest ⁇ bits 7 being represented by the number one.
- the physical position of a data block is obtained by adding the table entry for the associated extent with the lower ⁇ bits 7 of the logical address of the data block.
- Every table entry has the form y00. , , 000, ie the lower ⁇ bits 7 are set to zero, the addition can be carried out by a simple OR operation.
- the upper bits 6 of the virtual address of a data block thus serve to calculate the assigned storage medium and to determine the table entry for the extent, the lower bits 7 serve as an offset within the extent.
- a table entry is assigned to all data blocks that have common upper bits 6. This table entry can e.g. B. can be saved at the point at which the calculation of the share strategy is also carried out.
- the integration of the global data distribution strategies in a storage network 1 is based on a structure according to FIG. 1.
- the overall system consists of a number of file or database servers, hereinafter referred to as computer systems, which are connected to data storage systems 4 via a storage network 1.
- the storage network 1 further comprises a number of switches or routers 2 which ensure the delivery of the data packets between communicating units.
- the computer systems are to be regarded as clients 3, which read 4 blocks from the data storage systems or write 4 data blocks on the data storage systems.
- any subset M of the storage systems 4 connected to the storage network 1 can be managed like a single logical storage pool which has a linear address space.
- the amount of storage systems 4 can be divided into several smaller or one large storage pool, wherein none of the storage systems 4 should be assigned to more than one storage pool. In the following, only the case is considered that the system consists of a storage pool.
- ⁇ virtual storage systems can be built from a storage pool, each of these virtual storage systems being managed in accordance with the share strategy. If a storage pool consists of a subset M of the storage systems, the share strategy for the logical storage systems is called up in accordance with the entire subset M.
- a storage policy is assigned to each virtual storage system, which includes properties such as physical block size and redundancy. This mapping can be done separately for each virtual storage system or once for the entire storage pool. After data has been written to a virtual hard disk, the storage policy can generally not be changed.
- the computer system asks a central entity that has global knowledge of all table entries for a table entry for the extent
- An area is reserved on each storage system 4 which assigns the virtual address to the physical address.
- the computer system first searches for the virtual address of the extent. If this address has not yet been reserved, the computer system searches for a free address on the storage system 4.
- this task according to FIG. 1 must be performed by one or more of the connected computer systems.
- one or more dedicated devices which are referred to as SAN appliances 5, can also be connected to the storage network 1 for coordinating the computer systems according to FIG.
- the use of SAN appliances 5 can ensure that everyone connected computer systems have the same view of the storage systems 4, ie are informed at the same time about the exit or addition of the storage systems 4.
- the SAN appliance 5 thus offers a number of interfaces via which information can be exchanged between the SAN appliance 5 and the client computers 3. These include:
- the share method can also be integrated in so-called in-band appliances (see FIG. 3).
- the in-band appliances are dedicated systems that transform the logical address of a data block that they receive from the connected computer systems into the physical address.
- the use of in-band appliances is necessary if the functionality of the share strategy cannot be integrated directly into the computer systems, since no software version of the share strategy is available for these computer systems or the performance of the connected computer systems is insufficient is large to perform the transformation of the logical addresses into the physical addresses.
- an in-band appliance behaves like a connected computer system, from the point of view of the in-band appliance connected computer systems like a physical storage system.
- in-band appliances can be mixed with computer systems in which the share strategy is carried out.
- the problem with the construction of systems for the delivery of data objects via the Internet differs from the construction of storage systems in that clients 3 on the Internet do not have a global view of all available web servers and web caches in the system. If a date is to be read from a web cache in order to relieve the burden on the participating web servers, it must therefore be ensured that the client 3 knows at least one web cache belonging to a data object and that the data object to be read also knows the correct web cache can assign.
- this task cannot be solved without creating multiple copies of a data object, which are distributed over the web caches according to a predefined placement strategy. If k copies of each data object are stored by a system, the client 3 asks one after the other or simultaneously for the k web caches which it believes are storing a copy of the data object. If one of the web caches holds a copy of the data object, this copy is then read by the client 3.
- a data object of the web cache which is calculated by the share strategy, is the same for C and V.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- Databases & Information Systems (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/524,159 US20060242212A1 (en) | 2002-08-08 | 2003-05-08 | Method and arrangement for randomly storing data |
EP03790856A EP1546935A1 (de) | 2002-08-08 | 2003-08-05 | Verfahren und anordnung zur randomisierten datenspeicherung |
AU2003258569A AU2003258569A1 (en) | 2002-08-08 | 2003-08-05 | Method and arrangement for randomly storing data |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE10236796A DE10236796B4 (de) | 2002-08-08 | 2002-08-08 | Verfahren und Anordnung zur randomisierten Datenspeicherung in Speichernetzwerken und/oder einem Intranet und/oder dem Internet sowie ein entsprechendes Computerprogramm-Erzeugnis und ein entsprechendes computerlesbares Speichermedium |
DE10236796.5 | 2002-08-08 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2004021214A1 true WO2004021214A1 (de) | 2004-03-11 |
Family
ID=31196963
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP2003/008635 WO2004021214A1 (de) | 2002-08-08 | 2003-08-05 | Verfahren und anordnung zur randomisierten datenspeicherung |
Country Status (5)
Country | Link |
---|---|
US (1) | US20060242212A1 (de) |
EP (1) | EP1546935A1 (de) |
AU (1) | AU2003258569A1 (de) |
DE (1) | DE10236796B4 (de) |
WO (1) | WO2004021214A1 (de) |
Families Citing this family (27)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050144516A1 (en) | 2003-12-30 | 2005-06-30 | Gonzalez Carlos J. | Adaptive deterministic grouping of blocks into multi-block units |
DE102004018808B3 (de) * | 2004-04-15 | 2005-12-29 | Conet Ag | Verfahren und Anordnung zur Verteilung von Datenblockmengen in Speichernetzwerken und/oder einem Datennetz sowie Computerprogramm-Erzeugnis und computerlesbares Speichermedium |
DE102004046243A1 (de) * | 2004-09-22 | 2006-04-06 | Universität Paderborn | Verfahren zur Verwaltung von Metainformationen zur Verteilung von Datenblöcken oder Objekten über computerlesbare Speichermedien sowie Computerprogrammprodukt und computerlesbares Speichermedium |
US7720889B1 (en) | 2006-10-31 | 2010-05-18 | Netapp, Inc. | System and method for nearly in-band search indexing |
US8868495B2 (en) * | 2007-02-21 | 2014-10-21 | Netapp, Inc. | System and method for indexing user data on storage systems |
US7430584B1 (en) * | 2008-03-12 | 2008-09-30 | Gene Fein | Data forwarding storage |
US7636761B1 (en) | 2008-09-29 | 2009-12-22 | Gene Fein | Measurement in data forwarding storage |
US7599997B1 (en) | 2008-08-01 | 2009-10-06 | Gene Fein | Multi-homed data forwarding storage |
US7636759B1 (en) | 2008-09-29 | 2009-12-22 | Gene Fein | Rotating encryption in data forwarding storage |
US9203928B2 (en) | 2008-03-20 | 2015-12-01 | Callahan Cellular L.L.C. | Data storage and retrieval |
US8458285B2 (en) * | 2008-03-20 | 2013-06-04 | Post Dahl Co. Limited Liability Company | Redundant data forwarding storage |
US7877456B2 (en) * | 2008-04-08 | 2011-01-25 | Post Dahl Co. Limited Liability Company | Data file forwarding storage and search |
US8386585B2 (en) | 2008-04-25 | 2013-02-26 | Tajitshu Transfer Limited Liability Company | Real-time communications over data forwarding framework |
US8452844B2 (en) | 2008-05-07 | 2013-05-28 | Tajitshu Transfer Limited Liability Company | Deletion in data file forwarding framework |
US8599678B2 (en) | 2008-07-10 | 2013-12-03 | Tajitshu Transfer Limited Liability Company | Media delivery in data forwarding storage network |
US8370446B2 (en) | 2008-07-10 | 2013-02-05 | Tajitshu Transfer Limited Liability Company | Advertisement forwarding storage and retrieval network |
US8478823B2 (en) | 2008-09-29 | 2013-07-02 | Tajitshu Transfer Limited Liability Company | Selective data forwarding storage |
US7636764B1 (en) | 2008-09-29 | 2009-12-22 | Gene Fein | Cloud resource usage in data forwarding storage |
US8352635B2 (en) | 2008-09-29 | 2013-01-08 | Tajitshu Transfer Limited Liability Company | Geolocation assisted data forwarding storage |
US7685248B1 (en) | 2008-09-29 | 2010-03-23 | Gene Fein | User interface in data forwarding network |
TWI592805B (zh) * | 2010-10-01 | 2017-07-21 | 傅冠彰 | 網路儲存與計算資源分享系統與方法 |
JP6212891B2 (ja) * | 2013-03-25 | 2017-10-18 | 日本電気株式会社 | 仮想化システム、仮想サーバ、仮想ディスク配置方法、及び仮想ディスク配置プログラム |
US20150293699A1 (en) | 2014-04-11 | 2015-10-15 | Graham Bromley | Network-attached storage enhancement appliance |
KR20180051706A (ko) * | 2016-11-07 | 2018-05-17 | 삼성전자주식회사 | 어드레스 맵핑 테이블의 에러 정정을 수행하는 메모리 시스템 |
US10459786B2 (en) * | 2017-06-27 | 2019-10-29 | Western Digital Technologies, Inc. | Scaling large drives using enhanced DRAM ECC |
CN112035498B (zh) * | 2020-08-31 | 2023-09-05 | 北京奇艺世纪科技有限公司 | 数据块调度方法、装置、调度层节点及存储层节点 |
CN113342272B (zh) * | 2021-06-07 | 2023-02-10 | 深圳数联天下智能科技有限公司 | 一种坐姿数据的存储方法、展示方法、智能坐垫和系统 |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6111877A (en) * | 1997-12-31 | 2000-08-29 | Cisco Technology, Inc. | Load sharing across flows |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
AU2001246799A1 (en) * | 2000-04-18 | 2001-10-30 | Storeage Networking Technologies | Storage virtualization in a storage area network |
-
2002
- 2002-08-08 DE DE10236796A patent/DE10236796B4/de not_active Expired - Fee Related
-
2003
- 2003-05-08 US US10/524,159 patent/US20060242212A1/en not_active Abandoned
- 2003-08-05 AU AU2003258569A patent/AU2003258569A1/en not_active Abandoned
- 2003-08-05 EP EP03790856A patent/EP1546935A1/de not_active Withdrawn
- 2003-08-05 WO PCT/EP2003/008635 patent/WO2004021214A1/de not_active Application Discontinuation
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6111877A (en) * | 1997-12-31 | 2000-08-29 | Cisco Technology, Inc. | Load sharing across flows |
Non-Patent Citations (3)
Title |
---|
HILFORD V ET AL: "EH-extendible hashing in a distributed environment", COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE, 1997. COMPSAC '97. PROCEEDINGS., THE TWENTY-FIRST ANNUAL INTERNATIONAL WASHINGTON, DC, USA 13-15 AUG. 1997, LOS ALAMITOS, CA, USA,IEEE COMPUT. SOC, US, 13 August 1997 (1997-08-13), pages 217 - 222, XP010247302, ISBN: 0-8186-8105-5 * |
KARGER DAVID ET AL: "Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web", PROCEEDINGS OF THE 29TH. ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING. EL PASO, MAY 4 - 6, 1997, PROCEEDINGS OF THE ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, NEW YORK, ACM, US, vol. SYMP. 29, 4 May 1997 (1997-05-04), pages 654 - 663, XP002183010, ISBN: 0-89791-888-6 * |
M. COYLE ET AL.: "Evaluation of Disk Allocation Methods for Parallelizing Spatial Queries on Grid Files", JOURNAL OF COMPUTER AND SOFTWARE ENGINEERING, 1995, pages 1-17, XP002266010 * |
Also Published As
Publication number | Publication date |
---|---|
DE10236796A1 (de) | 2004-03-04 |
DE10236796B4 (de) | 2004-12-02 |
EP1546935A1 (de) | 2005-06-29 |
US20060242212A1 (en) | 2006-10-26 |
AU2003258569A1 (en) | 2004-03-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
DE10236796B4 (de) | Verfahren und Anordnung zur randomisierten Datenspeicherung in Speichernetzwerken und/oder einem Intranet und/oder dem Internet sowie ein entsprechendes Computerprogramm-Erzeugnis und ein entsprechendes computerlesbares Speichermedium | |
DE60111072T2 (de) | Verfahren und vorrichtung zur parallelen nachrichtenübermittlung in echtzeit von dateisegmentierten | |
DE69533575T2 (de) | Verfahren der und System zur Speicherplatzreservierung für Datenmigration in einem hierarchischen Datenspeicherungssystem durch dynamische Berechnung maximalen Speicherplatzes für Spiegelredundanz | |
DE69533058T2 (de) | Speicherplattenanordnung mit redundanter Speicherung und Verfahren zur inkrementalen Redundanzerzeugung während des Datenschreibens auf die Speicherplattenanordnung | |
DE112013006504B4 (de) | Speichersystem und Datenverwaltungsverfahren | |
DE60036539T2 (de) | Verwendung von ungenutzter Speicherkapazität bei vernetzten Computern | |
DE60025749T2 (de) | Dateisystemabbildübertragung zwischen ungleichen dateisystemen | |
DE112018005869T5 (de) | Strukturanpassung einer namensraumzuordnung in nicht flüchtigen speichervorrichtungen | |
DE112011100623B4 (de) | Read-Other-Protokoll zur Aufrechterhaltung der Paritätskohärenz in einem Writeback-Datenspeichersystem mit verteilter Redundanz | |
DE69838367T2 (de) | Paralleles Dateiensystem und Verfahren zur unabhängigen Aufzeichnung von Metadaten | |
DE60034327T2 (de) | Verfahren und systeme zur implementierung von verwaltungsfunktionen für gemeinsam genutzte plattenanordnungen | |
DE112017005868T5 (de) | Verwaltung von e/a-abläufen für datenobjekte in einem speichersystem | |
DE112009000411T5 (de) | Verfahren und System zum Implementieren eines virtuellen Speicherpools in einer virtuellen Umgebung | |
DE102013215535A1 (de) | Sicherung oder wiederherstellung von daten mit hilfe eines hauptspeichers und nichtflüchtiger speichermedien | |
DE69830965T2 (de) | System zur wiedergabe von daten in einem video-server | |
DE19822543A1 (de) | Verfahren zum Zuteilen von Aufträgen, Datenverarbeitssystem, Client-Datenbearbeitungsknoten und computerlesbares Speichermedium | |
EP1228432A1 (de) | Verfahren zur dynamischen speicherverwaltung | |
DE10236179A1 (de) | Speichersystem und Verfahren zur Verwendung desselben | |
DE112010003675T5 (de) | Adress-Server | |
DE102016219854A1 (de) | Computersystem und Verfahren zum dynamischen Anpassen eines software-definierten Netzwerks | |
DE10234138A1 (de) | Verwalten einer Speicherkonkurrenz bei automatisierten Speichersystemen | |
DE60221156T2 (de) | Verfahren und system zur verteilung der arbeitslast in einem netzwerk von rechnersystemen | |
DE69933043T2 (de) | Verfahren und vorrichtung für einen adaptiven generator von adressennachschlagtabellen | |
EP1262051A1 (de) | Verfahren zur steuerung der kommunikation von einzelrechnern in einem rechnerverbund | |
WO2012022378A1 (de) | Verfahren und anordnung zur projektierung und/oder programmierung eines projektes einer industriellen automatisierungsanordnung |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2006242212 Country of ref document: US Ref document number: 10524159 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2003790856 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 2003790856 Country of ref document: EP |
|
NENP | Non-entry into the national phase |
Ref country code: JP |
|
WWW | Wipo information: withdrawn in national office |
Country of ref document: JP |
|
WWP | Wipo information: published in national office |
Ref document number: 10524159 Country of ref document: US |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 2003790856 Country of ref document: EP |