Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A method for managing data objects within a computer network infrastructure, the method comprising: identifying a computer network infrastructure comprising a plurality of nodes, each node comprising one or more tangible storage resources; establishing a unique physical identifier for each of the tangible storage resources; generating multiple unique virtual identifiers for each of the tangible storage resources; storing the multiple unique virtual identifiers in a consistent ring namespace accessible for every one of the nodes; generating an object identifier associated with a location of a data object stored in one of the tangible storage resources; mapping the object identifier to the consistent ring namespace in a position in the consistent ring namespace between, in a ring-walk order, the unique virtual identifier of the one of the tangible storage resources and another unique virtual identifier of the multiple unique virtual identifiers stored in the consistent ring namespace; and enabling traversing of the consistent ring namespace from any of the nodes in the computer network infrastructure in order to locate and access the data object.
This invention relates to data management in distributed computer networks, addressing challenges in efficiently locating and accessing data objects across multiple nodes with varying storage resources. The method involves managing data objects by first identifying a network infrastructure comprising multiple nodes, each containing one or more tangible storage resources. Each storage resource is assigned a unique physical identifier, while multiple unique virtual identifiers are generated for each resource. These virtual identifiers are stored in a consistent ring namespace accessible to all nodes. An object identifier is generated for each data object, specifying its storage location. This object identifier is mapped to a position within the ring namespace, specifically between two virtual identifiers of the same storage resource in a ring-walk order. This mapping allows any node in the network to traverse the ring namespace to locate and access the data object. The consistent ring namespace ensures uniform access and retrieval across the distributed system, improving data management efficiency and reliability. The method enables seamless traversal and access to data objects regardless of their physical storage location, enhancing scalability and fault tolerance in distributed storage environments.
2. The method of claim 1 , wherein the unique physical identifier is a hash value generated from: a universally unique storage resource identifier; or a combination of the storage resource manufacturing model and a serial number.
A method for generating a unique physical identifier for a storage resource involves creating a hash value derived from either a universally unique storage resource identifier or a combination of the storage resource's manufacturing model and serial number. This approach ensures that each storage resource can be distinctly identified within a system, addressing the challenge of managing and tracking multiple storage devices in data centers or cloud environments where unique identification is critical for security, inventory management, and fault isolation. The hash value serves as a compact, standardized identifier that can be used across different systems and platforms, reducing the risk of conflicts or misidentification. By leveraging either a universally unique identifier or a combination of model and serial number, the method accommodates various storage resource types and manufacturers, ensuring broad applicability. The generated hash value can be used for authentication, access control, or tracking purposes, enhancing the overall reliability and security of storage resource management. This solution is particularly valuable in environments where storage resources are frequently added, removed, or reconfigured, as it provides a consistent and tamper-resistant means of identification.
3. The method of claim 1 , wherein: the unique virtual identifiers are generated to achieve a specific distribution either manually or programmatically; and the generating of the multiple unique virtual identifiers comprises applying hash chaining to the physical identifier associated with the tangible storage resource to generate an arbitrary number of unique virtual identifiers associated with an individual tangible storage resource.
The invention relates to a system for generating and managing unique virtual identifiers for tangible storage resources, such as physical storage devices, to enhance security, scalability, and flexibility in data management. The problem addressed is the need to create multiple unique virtual identifiers from a single physical identifier while ensuring controlled distribution and security. The method involves generating unique virtual identifiers from a physical identifier associated with a tangible storage resource. These identifiers can be produced either manually or programmatically to achieve a specific distribution pattern, ensuring controlled allocation and usage. The generation process employs hash chaining, a cryptographic technique, to derive an arbitrary number of unique virtual identifiers from the same physical identifier. This allows a single physical storage resource to be represented by multiple virtual identifiers, enhancing flexibility in access control and data management. Hash chaining ensures that each virtual identifier is cryptographically linked to the physical identifier, maintaining security and integrity. The ability to generate identifiers programmatically or manually allows for customization based on system requirements, such as load balancing, access restrictions, or performance optimization. This approach improves scalability by enabling efficient management of large-scale storage systems while maintaining traceability and security.
4. The method of claim 1 , wherein the generating of the multiple unique virtual identifiers is performed in such a way that an arbitrary number of unique virtual identifiers is mapped over the consistent ring namespace.
This invention relates to distributed systems and data management, specifically addressing the challenge of efficiently generating and managing unique virtual identifiers in a scalable, consistent manner. The method involves creating multiple unique virtual identifiers that are mapped over a consistent ring namespace, enabling efficient distribution and retrieval of data across a distributed system. The ring namespace provides a structured, scalable way to organize and access data, ensuring consistency and avoiding collisions. The generation process allows for an arbitrary number of unique identifiers, accommodating dynamic scaling of the system without compromising performance or reliability. This approach is particularly useful in distributed databases, peer-to-peer networks, and other systems requiring high availability and fault tolerance. The method ensures that identifiers are uniformly distributed across the namespace, optimizing load balancing and reducing bottlenecks. By leveraging the ring namespace, the system can efficiently handle large-scale data operations while maintaining consistency and scalability. The technique is designed to work seamlessly with existing distributed systems, providing a robust solution for identifier management in complex, large-scale environments.
5. The method of claim 1 , wherein the number of generated unique virtual identifiers is the same or greater than the number of the tangible storage resources in the computer network infrastructure.
A method for managing virtual identifiers in a computer network infrastructure addresses the challenge of efficiently allocating and tracking storage resources. The method involves generating a set of unique virtual identifiers that correspond to tangible storage resources within the network. The number of generated virtual identifiers is equal to or exceeds the number of physical storage resources, ensuring sufficient coverage for mapping and addressing purposes. This approach enhances resource management by decoupling virtual identifiers from physical storage locations, allowing for flexible and scalable allocation. The method may also include dynamically adjusting the number of virtual identifiers based on changes in the network infrastructure, such as the addition or removal of storage resources. By maintaining a one-to-one or many-to-one relationship between virtual identifiers and physical storage, the system ensures efficient resource utilization and simplifies management tasks. The method is particularly useful in distributed storage systems where tracking and accessing physical storage locations directly would be impractical or inefficient. The use of virtual identifiers abstracts the underlying physical storage, enabling better load balancing, redundancy, and fault tolerance. The method may also include mechanisms for resolving conflicts or collisions when assigning virtual identifiers to ensure uniqueness and consistency across the network. Overall, this approach improves the scalability, reliability, and manageability of storage resources in large-scale computer networks.
6. The method of claim 1 , wherein the object identifier is a hash value generated from the data object.
A system and method for identifying and managing data objects using cryptographic hashing techniques. The technology addresses the challenge of uniquely and reliably identifying data objects in distributed or large-scale storage systems, where traditional naming conventions or metadata may be insufficient or inconsistent. The method involves generating a unique hash value from the content of a data object, which serves as an immutable identifier. This hash value is derived using a cryptographic hash function, ensuring that even minor changes to the data object result in a significantly different hash value. The hash-based identifier is then used for various operations, such as data retrieval, version control, integrity verification, and deduplication. By leveraging cryptographic hashing, the system ensures that the identifier is collision-resistant and tamper-evident, providing a robust mechanism for tracking and managing data objects across different storage systems or applications. The method may also include storing the hash value alongside the data object or in a separate metadata repository for efficient lookup and comparison. This approach enhances data integrity, simplifies data management, and reduces storage redundancy by enabling efficient detection of duplicate data objects.
7. The method of claim 1 , wherein the tangible storage resource of a data object replica is written based upon the location of the mapped virtual identifiers in the consistent ring namespace.
A system and method for managing data storage in a distributed environment involves organizing data objects into a consistent ring namespace, where virtual identifiers are mapped to physical storage locations. The method includes writing data object replicas to tangible storage resources based on the mapped locations of these virtual identifiers within the ring namespace. This approach ensures efficient and consistent data distribution across multiple storage nodes, addressing challenges in scalability and fault tolerance in distributed storage systems. The ring namespace provides a structured way to map virtual identifiers to physical storage, allowing for balanced load distribution and simplified data retrieval. By leveraging the mapped locations, the system optimizes storage operations, such as replication and retrieval, while maintaining data consistency across the distributed environment. The method supports dynamic adjustments to storage allocation as the system scales, ensuring reliable access to data objects regardless of node failures or network partitions. This solution is particularly useful in large-scale distributed storage systems where maintaining performance and reliability is critical.
8. The method of claim 7 , further comprising generating multiple data object replicas and storing them in different ones of the tangible storage resources by walking the ring namespace to find different virtual identifiers.
A distributed storage system manages data objects across multiple storage resources using a ring namespace to ensure high availability and fault tolerance. The system addresses the challenge of efficiently distributing and replicating data objects to prevent data loss and improve access reliability. The ring namespace organizes storage resources into a logical ring structure, where each resource is assigned a virtual identifier. The system generates multiple replicas of each data object and distributes them across different storage resources by traversing the ring namespace to locate distinct virtual identifiers. This ensures that replicas are stored in separate physical or logical locations, reducing the risk of data loss due to hardware failures or other disruptions. The method involves dynamically selecting storage resources based on their virtual identifiers, which are mapped to physical storage locations. By distributing replicas across different resources, the system enhances data durability and availability, even if some storage resources become unavailable. The approach optimizes storage utilization and minimizes the impact of failures by leveraging the ring namespace for efficient replica placement.
9. The method of claim 8 , wherein the tangible storage resources are selected based upon a preference to use different nodes in the computer network infrastructure for the data object replicas.
This invention relates to data storage systems in computer networks, specifically addressing the challenge of efficiently distributing and managing data object replicas across multiple nodes to improve reliability, performance, and resource utilization. The method involves selecting tangible storage resources for storing replicas of a data object, with a preference for distributing those replicas across different nodes in the network infrastructure. This distribution strategy helps avoid overloading specific nodes, reduces the risk of data loss due to node failures, and optimizes access times by leveraging geographically or logically dispersed storage locations. The selection process considers factors such as node availability, network latency, and storage capacity to ensure balanced and resilient data placement. By prioritizing the use of different nodes for replicas, the system enhances fault tolerance and ensures that data remains accessible even if some nodes become unavailable. This approach is particularly useful in large-scale distributed systems where data redundancy and efficient resource allocation are critical. The method may also include additional steps such as monitoring node performance, dynamically adjusting replica distribution, and ensuring data consistency across replicas to maintain system reliability.
10. The method of claim 8 , wherein the tangible storage resources are selected based upon a preference to use different tangible storage resources in the same node for the data object replicas.
A method for managing data storage in a distributed system involves selecting tangible storage resources for storing replicas of a data object. The method addresses the challenge of efficiently distributing and storing data replicas across multiple storage resources to improve reliability, performance, and resource utilization. The selection of storage resources is based on a preference to use different tangible storage resources within the same node for the data object replicas. This approach ensures that replicas are distributed across distinct storage resources within a single node, reducing the risk of data loss or performance degradation due to failures or bottlenecks in a single storage resource. The method may also include determining the number of replicas to be stored and identifying available storage resources within the node. By distributing replicas across different storage resources, the system enhances fault tolerance and load balancing, ensuring that data remains accessible even if one storage resource fails. This technique is particularly useful in large-scale distributed storage systems where data redundancy and availability are critical.
11. The method of claim 8 , wherein the tangible storage resources are skipped in the order of the ring walk when a data object replica cannot successfully be stored.
A method for managing data storage in a distributed system involves a ring-based approach to allocate storage resources for data object replicas. The system includes a plurality of storage nodes organized in a ring structure, where each node is responsible for storing data objects and their replicas. The method determines a storage location for a data object replica by traversing the ring in a predefined order, starting from a designated node. If a storage node is unavailable or fails to store the replica, the method skips that node and continues traversing the ring to find the next available node. This ensures that data replication continues even if some nodes are temporarily unavailable. The method also includes mechanisms to track the status of each node and adjust the ring traversal dynamically based on node availability. The goal is to improve data reliability and fault tolerance in distributed storage systems by ensuring that replicas are stored across multiple nodes, even in the presence of node failures or temporary unavailability. The method is particularly useful in large-scale distributed storage environments where node failures are common and data redundancy is critical.
12. The method of claim 7 , further comprising generating a plurality of data object replicas and storing them in different tangible storage resources.
A method for data storage and management involves creating multiple copies (replicas) of data objects and distributing these replicas across different physical storage systems. This approach enhances data availability, reliability, and fault tolerance by ensuring that if one storage system fails, the data remains accessible from another. The method is particularly useful in distributed computing environments where data integrity and redundancy are critical. By storing replicas in separate storage resources, the system mitigates risks associated with hardware failures, network disruptions, or other operational issues. The technique can be applied to various types of data objects, including files, databases, or other structured or unstructured data. The storage resources may include different types of media, such as hard drives, solid-state drives, or cloud-based storage, and may be located in geographically dispersed locations to further improve resilience. The method may also involve monitoring the status of each replica and automatically repairing or replacing corrupted or inaccessible copies to maintain data consistency. This ensures that the system can recover quickly from failures and continue to provide reliable access to the data. The approach is designed to work in conjunction with other data management techniques, such as load balancing, caching, or encryption, to optimize performance and security.
13. The method of claim 12 , wherein a number of data object replicas corresponds to a replication factor based on the number of tangible storage resources or policy requirements of the computer network infrastructure.
This invention relates to data storage systems in computer networks, specifically addressing the challenge of efficiently managing data replication to ensure reliability and availability. The method involves dynamically adjusting the number of data object replicas based on the available tangible storage resources or predefined policy requirements within the network infrastructure. By aligning replication factors with storage capacity and operational policies, the system optimizes data redundancy while minimizing unnecessary resource consumption. The approach ensures that critical data is sufficiently replicated to meet fault tolerance and performance standards, while also adapting to changes in network conditions or storage availability. This adaptive replication strategy enhances system resilience and efficiency by balancing storage utilization and data protection needs. The method may be applied in distributed storage systems, cloud environments, or enterprise networks where maintaining data integrity and availability is essential. The replication factor is determined by evaluating the number of storage resources or policy constraints, ensuring that the system dynamically scales replication efforts to match infrastructure capabilities and operational requirements. This solution addresses the problem of static replication schemes that either over-provision storage or fail to provide adequate redundancy in dynamic environments.
14. The method of claim 1 , wherein the enabling of traversing of the consistent ring namespace comprises navigating, through the consistent ring namespace, to storage resource identifiers in order to determine a tangible storage resource to retrieve the data object.
A method for managing data storage in a distributed system involves navigating a consistent ring namespace to locate and retrieve data objects. The consistent ring namespace is a distributed data structure that maps storage resource identifiers to physical storage locations, ensuring consistent and efficient data retrieval across multiple storage nodes. The method enables traversal of this namespace to identify the specific storage resource where a requested data object is stored. By navigating the consistent ring namespace, the system determines the appropriate storage resource identifier associated with the data object, allowing the system to retrieve the data from the correct physical storage location. This approach improves data accessibility and reliability in distributed storage environments by maintaining a consistent mapping between data objects and their storage locations, even as storage resources are added, removed, or fail. The method ensures that data retrieval operations are directed to the correct storage resource, reducing latency and improving system performance. This technique is particularly useful in large-scale distributed storage systems where data is distributed across multiple nodes and must be accessed efficiently and reliably.
15. The method of claim 1 , further comprising re-mapping unique virtual identifiers within the consistent ring namespace when a tangible storage resource is added to the computer network infrastructure.
A method for managing distributed storage systems involves dynamically re-mapping unique virtual identifiers within a consistent ring namespace when a tangible storage resource is added to a computer network infrastructure. The method addresses the challenge of efficiently scaling distributed storage systems by maintaining a consistent and scalable addressing scheme. The consistent ring namespace provides a logical organization of storage resources, allowing for efficient data distribution and retrieval. When a new storage resource is introduced, the system automatically re-maps the virtual identifiers to ensure the namespace remains balanced and optimized. This re-mapping process ensures that data remains evenly distributed across all available storage resources, preventing bottlenecks and improving performance. The method also includes mechanisms for handling failures and ensuring data consistency, making it suitable for large-scale distributed storage environments. By dynamically adjusting the namespace in response to infrastructure changes, the system maintains high availability and reliability while minimizing administrative overhead. This approach is particularly useful in cloud storage, distributed databases, and other large-scale data management systems where scalability and performance are critical.
16. The method of claim 1 , further comprising re-mapping unique virtual identifiers within the consistent ring namespace when available capacity of any of the tangible storage resources is changed.
A method for managing data storage in a distributed system involves dynamically re-mapping virtual identifiers within a consistent ring namespace when the available capacity of any storage resource changes. The system includes multiple tangible storage resources organized into a ring namespace, where each resource is assigned a unique virtual identifier. The method ensures that data distribution remains balanced and efficient by re-mapping these identifiers in response to changes in storage capacity, such as when a resource is added, removed, or its capacity is modified. This re-mapping process maintains the integrity of the ring namespace, preventing data distribution imbalances and optimizing storage utilization. The method may also involve tracking the capacity of each storage resource and triggering the re-mapping process automatically when a capacity change is detected. By dynamically adjusting the virtual identifiers, the system ensures that data is evenly distributed across all available storage resources, improving performance and reliability in distributed storage environments.
17. The method of claim 1 , further comprising re-distributing data objects to different ones of the tangible storage resources after the consistent ring namespace has been changed in view of addition or removal of at least one node or at least one tangible storage resource.
This invention relates to distributed storage systems, specifically methods for managing data distribution across storage resources in a dynamic environment where nodes or storage resources are added or removed. The core problem addressed is maintaining data consistency and efficient storage utilization when the system's topology changes. The method involves a consistent ring namespace, which is a logical structure used to map data objects to storage resources. When a node or storage resource is added or removed, the ring namespace is updated to reflect the new configuration. The invention further includes redistributing data objects to different storage resources based on the updated ring namespace. This redistribution ensures that data remains evenly distributed and accessible, preventing bottlenecks or imbalances. The process involves analyzing the current distribution, determining optimal placement for each data object, and transferring objects as needed to maintain balance. The method supports scalability by dynamically adapting to changes in the system's infrastructure without disrupting ongoing operations. The redistribution step ensures that data remains consistent and accessible, even as the underlying storage resources evolve. This approach is particularly useful in large-scale distributed systems where storage resources and nodes may frequently change.
18. The method of claim 17 , wherein when one of the tangible storage resources is removed from the computer network infrastructure, the data objects are copied in ring walk order to subsequent tangible storage resources still available in the computer network infrastructure.
This invention relates to data storage systems in computer network infrastructures, specifically addressing the challenge of maintaining data availability and integrity when storage resources are dynamically added or removed. The system employs a distributed storage architecture where data objects are stored across multiple tangible storage resources connected within the network. A ring structure is used to organize these resources, allowing for efficient data distribution and retrieval. When a storage resource is removed from the network, the system automatically detects the change and initiates a rebalancing process. Data objects previously stored on the removed resource are copied in a predefined ring walk order to the next available storage resources still connected to the network. This ensures that all data remains accessible and evenly distributed across the remaining resources, preventing data loss or fragmentation. The ring walk order ensures sequential and systematic redistribution, optimizing performance and minimizing disruption. The system may also include mechanisms for detecting new storage resources and incorporating them into the ring structure, further enhancing scalability and fault tolerance. This approach is particularly useful in dynamic environments where storage resources may frequently change, such as cloud computing or distributed data centers.
19. The method of claim 17 , wherein re-distribution of data objects can exceed a replication factor to use spare capacity of tangible storage resources in the computer network infrastructure for performance and reconstruction improvements.
This invention relates to data storage and distribution in computer networks, specifically addressing the challenge of efficiently utilizing storage resources while improving performance and data reconstruction capabilities. The method involves redistributing data objects across a network infrastructure to optimize storage capacity and enhance system reliability. By allowing the redistribution of data objects to exceed a predefined replication factor, the system leverages spare storage capacity available in the network. This approach ensures that excess storage resources are not wasted, thereby improving overall performance and facilitating faster data reconstruction in case of failures. The redistribution process dynamically adjusts based on available storage capacity, ensuring that data is distributed in a way that maximizes efficiency and minimizes latency. This method is particularly useful in large-scale distributed storage systems where maintaining high availability and performance is critical. The invention ensures that spare storage capacity is effectively utilized, reducing the risk of data loss and improving system resilience.
20. A non-transitory processor-readable medium having instructions stored thereon, which when executed by one or more processors, causes the one or more processors to perform the method of claim 1 .
A system and method for optimizing data processing in a distributed computing environment addresses inefficiencies in task allocation and resource utilization. The invention involves a processor-readable medium storing instructions that, when executed, enable a processor to dynamically allocate tasks across multiple computing nodes based on real-time performance metrics. The method includes monitoring computational workloads, identifying bottlenecks, and redistributing tasks to underutilized nodes to balance the load. Additionally, it employs predictive algorithms to anticipate future resource demands and preemptively adjust task assignments. The system also includes a feedback mechanism that continuously evaluates the effectiveness of task distribution and refines allocation strategies accordingly. This approach improves processing efficiency, reduces idle time, and enhances overall system throughput. The invention is particularly useful in large-scale distributed systems where dynamic workloads and heterogeneous hardware configurations complicate manual optimization. By automating task allocation and leveraging predictive analytics, the system ensures optimal resource utilization and minimizes processing delays.
Unknown
December 3, 2019
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.