公开(公告)号：US07882066B1

公开(公告)日：2011-02-01

申请号：US10852836

申请日：2004-05-25

Applicant: Oleg Kiselev ,  John A. Muth

Inventor： Oleg Kiselev ,  John A. Muth

IPC: G06F7/00 ,  G06F12/00 ,  G06F15/16 ,  G06F17/30

CPC classification number: G06F17/30067

Abstract: A set of probabilities may indicate the chance of finding the latest version of a data item in any particular data image layer of a data image. A client may use the set of probabilities to request the data item from one or more layers that have a higher probability of having that version of the data item. A client may query more recently created layers to determine whether they have a version of the data item. If any of the more recently created data image layers has a version of the data item, a client may request the data item from the most recent of the more recently created layers and may discard any data returned from the originally requested layer. A client may update the historical probabilities based on which layers contain versions of the data item.

Abstract translation: 一组概率可以指示在数据图像的任何特定数据图像层中找到数据项的最新版本的机会。 客户端可以使用这组概率来从具有更高概率的数据项的版本的一个或多个层请求数据项。 客户端可以查询最近创建的层，以确定它们是否具有数据项的版本。 如果最近创建的数据图像层中的任何一个具有数据项的版本，则客户端可以从最近创建的层中的最新的请求数据项，并且可以丢弃从最初请求的层返回的任何数据。 客户端可以基于哪些层包含数据项的版本来更新历史概率。

公开(公告)号：US07720864B1

公开(公告)日：2010-05-18

申请号：US10809207

申请日：2004-03-25

Applicant: John A. Muth ,  Thomas W. Lanzatella

Inventor： John A. Muth ,  Thomas W. Lanzatella

IPC: G06F17/30

CPC classification number: G06F17/30088 ,  G06F17/30171

Abstract: A method, system and computer accessible medium for expiring access tokens in preparation for freezing file images. A metadata server may maintain a next scheduled quiesce time and may issue access tokens configured to expire before the next scheduled quiesce time. A metadata server may set an access token's expiration time to a maximum expiration time indicated by the next scheduled quiesce time or may set an access token's expiration time to a default expiration time if the default expiration time is earlier than the maximum expiration time. A storage device may recognize and enforce the access token's expiration time.

Abstract translation: 一种方法，系统和计算机可访问介质，用于在准备冻结文件映像时过期访问令牌。 元数据服务器可以保持下一个计划的停顿时间，并且可以在下一个计划的停顿时间之前发出被配置为到期的接入令牌。 元数据服务器可以将访问令牌的到期时间设置为由下一个计划的静默时间指示的最大到期时间，或者如果默认的到期时间早于最大期满时间，则可以将访问令牌的到期时间设置为默认的到期时间。 存储设备可以识别并强制访问令牌的到期时间。

公开(公告)号：US07292585B1

公开(公告)日：2007-11-06

申请号：US10403919

申请日：2003-03-31

Applicant: Gregory L. Slaughter ,  Thomas E. Saulpaugh ,  John A. Muth ,  Andrew Krumel

Inventor： Gregory L. Slaughter ,  Thomas E. Saulpaugh ,  John A. Muth ,  Andrew Krumel

IPC: H04L12/28

CPC classification number: H04L45/28 ,  H04L45/02 ,  H04L45/48

Abstract: A system and method for storing and utilizing routing information in a computer network. Instances of a first network address may be created on each of N nodes in the network. Routing information for routing messages to the first network address may be stored on a first node. The first node may be operable to route a first message to the first network address using the routing information so that the message reaches each of the N nodes that have an instance of the first network address. However, the routing information stored by the first node may comprise information regarding less than all N instances of the first network address.

Abstract translation: 一种在计算机网络中存储和利用路由信息的系统和方法。 可以在网络中的每个N个节点上创建第一网络地址的实例。 用于将消息路由到第一网络地址的路由信息​​可以存储在第一节点上。 第一节点可以使用路由信息将第一消息路由到第一网络地址，使得消息到达具有第一网络地址的实例的N个节点中的每一个。 然而，由第一节点存储的路由信息​​可以包括关于小于所有N个第一网络地址的实例的信息。

公开(公告)号：US07899934B2

公开(公告)日：2011-03-01

申请号：US11651707

申请日：2007-01-10

Applicant: Gregory L. Slaughter ,  John A. Muth

Inventor： Gregory L. Slaughter ,  John A. Muth

IPC: G06F15/16

CPC classification number: H04L45/48 ,  H04L45/02 ,  H04L45/56

Abstract: A system and method for handling un-partitioning of a computer network are disclosed. Routing information may be stored on a first node in the network when the network is partitioned into a first group of nodes and a second group of nodes, where the first node is in the first group of nodes. Storing the routing information on the first node may include storing information usable to route messages to nodes in the first group of nodes. A technique for determining when the second group of nodes has become un-partitioned from the first group of nodes (i.e., for determining when the partition has been repaired) may be employed. In response to determining that the second group of nodes has become un-partitioned from the first group of nodes, the routing information on the first node may be modified. Modifying the routing information on the first node may include storing information useable to route messages to nodes in the second group of nodes.

Abstract translation: 公开了一种用于处理计算机网络的分割的系统和方法。 当网络被划分成第一组节点和第二组节点时，路由信息可以存储在网络中的第一节点上，其中第一节点在第一组节点中。 在第一节点上存储路由信息可以包括存储可用于将消息路由到第一组节点中的节点的信息。 可以采用用于确定第二组节点何时已经从第一组节点（即，用于确定分区何时已经被修复）而未分区的技术。 响应于确定第二组节点已经从第一组节点变得未分区，可以修改第一节点上的路由信息​​。 修改第一节点上的路由信息​​可以包括存储可用于将消息路由到第二组节点中的节点的信息。

公开(公告)号：US07617259B1

公开(公告)日：2009-11-10

申请号：US11027624

申请日：2004-12-31

Applicant: John A. Muth ,  Oleg Kiselev ,  Craig K. Harmer ,  Angshuman Bezbaruah ,  Milind Borate

Inventor： John A. Muth ,  Oleg Kiselev ,  Craig K. Harmer ,  Angshuman Bezbaruah ,  Milind Borate

IPC: G06F12/00

CPC classification number: G06F11/2082 ,  G06F11/1471 ,  G06F11/2058 ,  G06F11/2064 ,  G06F11/2066 ,  G06F11/2071 ,  Y10S707/99955

Abstract: A file system may save dirty file information indicating portions of files, residing on a storage system, to be modified corresponding data modification requests received by the file system. The file system may update the saved dirty file information to indicate successful modification of the files across redundant storage of the storage system and may track redundancy consistency recovery information on a file-by-file basis or on a file portion basis. A file system may also retrieve saved dirty file information and recover redundancy consistency for portions of files determined, based on the saved dirty file information, not to have redundancy consistency on the storage system. Recovering redundancy consistency may include copying, either directly to via a storage system mechanism, portions of files between redundant storage of the storage system. The redundancy consistency for the saved dirty file information may be recovered prior to recovering redundancy consistency for individual files.

Abstract translation: 文件系统可以保存指示驻留在存储系统上的文件的部分的肮脏的文件信息，以被修改由文件系统接收的相应的数据修改请求。 文件系统可以更新保存的脏文件信息，以指示跨存储系统的冗余存储器的文件的成功修改，并且可以逐个文件或以文件部分为基础跟踪冗余一致性恢复信息。 文件系统还可以基于保存的脏文件信息来检索保存的脏文件信息并恢复确定的部分文件的冗余一致性，在存储系统上不具有冗余一致性。 恢复冗余一致性可以包括直接通过存储系统机制复制存储系统的冗余存储之间的部分文件。 在恢复单个文件的冗余一致性之前，可以恢复保存的脏文件信息的冗余一致性。

公开(公告)号：US07809898B1

公开(公告)日：2010-10-05

申请号：US10847977

申请日：2004-05-18

Applicant: Oleg Kiselev ,  John A. Muth

Inventor： Oleg Kiselev ,  John A. Muth

IPC: G06F12/00 ,  G06F13/00 ,  G06F13/28 ,  G06F9/26 ,  G06F9/34

CPC classification number: G06F11/2064 ,  G06F11/2082 ,  G06F11/2087

Abstract: A system and method for detecting mirror inconsistencies in a distributed storage environment. Inconsistencies between mirrors may be detected by comparing session tags among individual storage devices. Each data write may include a tag and storage devices may calculate session tags from the write tags. Additionally, a storage device may keep a history including tags from recent writes. When a client sessions ends, a metadata server may compare the respective session tags from different storage devices to determine whether the mirrors are synchronized. If the session tags do not match, the metadata server may examine the metadata histories from the storage devices to determine a cause for the discrepancy in the session tags. If examining the session histories fails to reveal the discrepancy's source, a metadata server may request individual data block checksums from storage devices to attempt a re-synchronization of the mirrored storage devices.

Abstract translation: 一种用于检测分布式存储环境中镜像不一致性的系统和方法。 可以通过比较各个存储设备之间的会话标签来检测镜之间的不一致。 每个数据写入可以包括标签，并且存储设备可以从写入标签计算会话标签。 此外，存储设备可以保留包括来自最近写入的标签的历史记录。 当客户端会话结束时，元数据服务器可以比较来自不同存储设备的相应会话标签，以确定镜像是否被同步。 如果会话标签不匹配，则元数据服务器可以从存储设备检查元数据历史，以确定会话标签中差异的原因。 如果检查会话历史无法显示差异来源，则元数据服务器可以请求来自存储设备的单个数据块校验和以尝试镜像存储设备的重新同步。

公开(公告)号：US07653059B1

公开(公告)日：2010-01-26

申请号：US10403261

申请日：2003-03-31

Applicant: Gregory L. Slaughter ,  Thomas E. Saulpaugh ,  John A. Muth

Inventor： Gregory L. Slaughter ,  Thomas E. Saulpaugh ,  John A. Muth

IPC: H04L12/56

CPC classification number: H04L45/18 ,  H04L45/02 ,  H04L45/28 ,  H04L45/36 ,  H04L45/48

Abstract: A system and method supporting communication sessions for nodes in a network. A sender node may initiate a send operation to send a message to one or more receiver nodes. For each receiver node, the message may pass from the sender node to the receiver node via a path including a plurality of nodes. At each node through which the message passes, the node may store state information regarding the message. The state information may include information specifying a link via which the message was received. Each receiver node may issue one or more replies to the message. The replies from each receiver node may pass from the receiver node to the sender node via the same path by which the message reached the respective receiver node. This may be accomplished using the state information stored on each node in the path.

Abstract translation: 支持网络节点通信会话的系统和方法。 发送方节点可以发起发送操作以向一个或多个接收机节点发送消息。 对于每个接收机节点，消息可以经由包括多个节点的路径从发送方节点传递到接收方节点。 在消息通过的每个节点处，节点可以存储关于消息的状态信息。 状态信息可以包括指定接收到消息的链接的信息。 每个接收器节点可以发出一个或多个对该消息的回复。 来自每个接收机节点的答复可以通过消息到达相应接收机节点的相同路径从接收器节点传递到发送者节点。 这可以使用存储在路径中的每个节点上的状态信息来实现。

公开(公告)号：US07467194B1

公开(公告)日：2008-12-16

申请号：US10609985

申请日：2003-06-30

Applicant: Gregory L. Slaughter ,  Thomas E. Saulpaugh ,  John A. Muth

Inventor： Gregory L. Slaughter ,  Thomas E. Saulpaugh ,  John A. Muth

IPC: G06F15/16 ,  G06F15/173

CPC classification number: H04L67/104 ,  H04L67/1044 ,  H04L67/1068

Abstract: A system and method for re-mapping location-independent addresses in a computer network. A first node may send a first message addressed to a location-independent address, where the first message comprises a request to host an instance of the location-independent address. A second node with which the location-independent address is associated may receive the first message, possibly after the first message was propagated through a path of intermediate nodes. The second node may send a response message to the first node, where the response message indicates whether the second node is granting permission to the first node to host an instance of the location-independent address. The response message may also specify whether the second node is giving up its own instance of the location-independent address.

Abstract translation: 用于重新映射计算机网络中的位置无关地址的系统和方法。 第一节点可以发送寻址到位置无关地址的第一消息，其中第一消息包括托管位置无关地址的实例的请求。 与位置无关的地址相关联的第二节点可能在第一消息通过中间节点的路径传播之后接收第一消息。 第二节点可以向第一节点发送响应消息，其中响应消息指示第二节点是否授予第一节点许可以承载位置无关地址的实例。 响应消息还可以指定第二节点是否放弃其与位置无关的地址的其自身实例。

公开(公告)号：US07415488B1

公开(公告)日：2008-08-19

申请号：US11027650

申请日：2004-12-31

Applicant: John A. Muth ,  Oleg Kiselev ,  Craig K. Harmer

Inventor： John A. Muth ,  Oleg Kiselev ,  Craig K. Harmer

IPC: G06F12/00 ,  G06F11/00

CPC classification number: G06F11/2082 ,  Y10S707/99953

Abstract: A file system may selectively perform redundancy consistency recovery and synchronization of mirrors and may store dirty file information in a log or journal that indicates the modification of a file. A file system may update saved dirty file information to indicate successful modification of data across mirrors and may keep track of redundancy consistency recovery information on a file-by-file basis or may track the redundancy consistency of portions of files. A file system may also instruct an underlying storage system not to track data modifications, possibly selectively for each I/O request. During synchronization the file system may synchronize its log and use saved dirty file information to determine files to be synchronized. A file system may selectively use file system logging for individual data modification requests and may expose an API allowing applications to specify a redundancy consistency mechanism.

Abstract translation: 文件系统可以选择性地执行镜像的冗余一致性恢复和同步，并且可以将脏文件信息存储在指示文件修改的日志或日志中。 文件系统可以更新保存的脏文件信息，以指示跨镜像数据的成功修改，并且可以逐个文件地跟踪冗余一致性恢复信息，或者可以跟踪文件部分的冗余一致性。 文件系统还可以指示底层存储系统不能对每个I / O请求有选择地跟踪数据修改。 在同步期间，文件系统可以同步其日志并使用保存的脏文件信息来确定要同步的文件。 文件系统可以选择性地使用用于各个数据修改请求的文件系统日志记录，并且可以暴露允许应用指定冗余一致性机制的API。

公开(公告)号：US07533133B1

公开(公告)日：2009-05-12

申请号：US10833869

申请日：2004-04-28

Applicant: Thomas W. Lanzatella ,  Oleg Kiselev ,  Craig K. Harmer ,  John A. Muth

Inventor： Thomas W. Lanzatella ,  Oleg Kiselev ,  Craig K. Harmer ,  John A. Muth

IPC: G06F12/00

CPC classification number: G06F17/30153 ,  G06F17/30162 ,  G06F17/3023 ,  G06F21/6218 ,  G06F2221/2141 ,  G06F2221/2145 ,  Y10S707/99943 ,  Y10S707/99954

Abstract: A method and system for externally managed file versions. In shared storage environments file versions may be managed utilizing sparse data objects in storage devices. A file version may comprise a chain of one or more sparse data objects, where each object may represent changes compared to the data in other objects of the chain. New, empty sparse data objects may be attached to existing object chains to create new file versions. When providing file version metadata, a metadata server may provide information for the entire object chain. Write permission may be granted only for the front-most object in a chain, while all other objects in the chain may be write-protected. A storage device may expose the presence of holes in sparse data objects to help locate information in the object chain.

Abstract translation: 外部管理文件版本的方法和系统。 在共享存储环境中，可以使用存储设备中的稀疏数据对象来管理文件版本。 文件版本可以包括一个或多个稀疏数据对象的链，其中每个对象可以表示与链的其他对象中的数据相比的改变。 新的空的稀疏数据对象可以附加到现有对象链上以创建新的文件版本。 当提供文件版本元数据时，元数据服务器可以为整个对象链提供信息。 可以仅为链中最前面的对象授予写权限，而链中的所有其他对象可能被写保护。 存储设备可能暴露稀疏数据对象中的空洞，以帮助定位对象链中的信息。