会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Method and apparatus for data transmission using a positive group
acknowledgement protocol
    • 使用正组确认协议进行数据传输的方法和装置
    • US6128283A
    • 2000-10-03
    • US984191
    • 1997-12-03
    • Amr Gaber SabaaKadir OzdemirMing C. LeungDerek Chung Lap Cheung
    • Amr Gaber SabaaKadir OzdemirMing C. LeungDerek Chung Lap Cheung
    • H04L1/16H04L1/18G01R31/08H04L12/28
    • H04L1/1809H04L1/1621H04L1/188
    • A novel system and apparatus for transmitting data between the two nodes of a network is provided. The transmission is effected by using an error recovery protocol featuring a positive group acknowledgement. A sender unit on one node receives the user data and groups the data into consecutive cells, the cells being clustered into groups, each cell in a group being assigned a unique sequence number. The groups of cells are transmitted over a physical channel to a receiver unit on a different node. The receiver unit examines the cell stream and issues an acknowledgment message to the sender unit only when all of the cells in a group have been received. Once the sender unit has completed the transmission of a group of cells, it starts observing the physical channel for an acknowledgement message from the receiver unit. If after a predetermined time period the acknowledgement message has not been received, the sender unit transmits the group of cells again. This system allows to reduce the number of acknowledgement messages between the sender unit and the receiver unit while allowing low error-rate transmission between the nodes of the network.
    • 提供了一种用于在网络的两个节点之间传输数据的新型系统和装置。 通过使用具有正组确认的错误恢复协议实现传输。 一个节点上的发送者单元接收用户数据并将数据分组成连续的小区,小区被聚集成组,组中的每个小区被分配唯一的序列号。 这些小区通过物理信道传输到不同节点上的接收机单元。 只有当组中的所有单元已被接收时,接收器单元检查单元流并向发送器单元发出确认消息。 一旦发送方单元完成了一组小区的传输,就开始从物理信道接收来自接收机单元的确认消息。 如果在预定时间段之后还没有接收到确认消息,则发送器单元再发送一组单元。 该系统允许减少发送器单元和接收器单元之间的确认消息的数量,同时允许网络节点之间的低错误率传输。
    • 12. 发明授权
    • Using a per file activity ratio to optimally relocate data between volumes
    • 使用每个文件活动比率来最佳地重新定位卷之间的数据
    • US08732217B2
    • 2014-05-20
    • US12610175
    • 2009-10-30
    • Murthy V. MamidiKadir OzdemirCharles SilversPaul MassigliaAnindya BanerjeeRonald Karr
    • Murthy V. MamidiKadir OzdemirCharles SilversPaul MassigliaAnindya BanerjeeRonald Karr
    • G06F7/76G06F12/02
    • G06F17/30221G06F3/0649
    • A method for identifying data for relocation in a multivolume file system. The method includes generating a file location map, the file location map containing a list of the locations of files that occupy space on each of a plurality of volumes of the file system, wherein The file system comprising least a first volume and a second volume. The method further includes updating the file location map in accordance with changes in a file change log for the file system, and identifying data residing on the first volume of the file system by scanning the file location map. Using the identified data, a ratio of per-file activity during a first time period relative to overall file system activity over a second time period is calculated to derive a file activity ratio for each of the files of the identified data. Files are then selected for relocation based on the file activity ratio.
    • 一种识别多卷文件系统中重定位数据的方法。 所述方法包括生成文件位置图,所述文件位置图包含在所述文件系统的多个卷中的每一个上占据空间的文件的位置的列表,其中所述文件系统包括至少第一卷和第二卷。 该方法还包括根据文件系统的文件更改日志的更改来更新文件位置图,以及通过扫描文件位置图来识别驻留在文件系统的第一卷上的数据。 使用所识别的数据,计算在第一时间段内相对于第二时间段内的整体文件系统活动的每文件活动的比率,以导出所识别的数据的每个文件的文件活动比率。 然后根据文件活动率选择文件进行重定位。
    • 14. 发明授权
    • Efficient logging for asynchronously replicating volume groups
    • 异步复制卷组的高效日志记录
    • US08285956B2
    • 2012-10-09
    • US12603673
    • 2009-10-22
    • Kadir Ozdemir
    • Kadir Ozdemir
    • G06F12/02
    • G06F11/2074G06F11/2066
    • A system and method for logging for asynchronously replicating volume groups. A write request to write data to a location in a volume may be received. Metadata associated with the write request may be stored. It may be determined if the write request possibly overlaps with one or more earlier write requests to the volume that have not yet been replicated to a secondary storage. The data may be stored in a replication log only if the write request possibly overlaps with one or more earlier write requests to the volume. The data may not be stored in the replication log if the write request does not overlap with one or more earlier write requests to the volume. The data may be written to the location in the volume. Changes to the volume may periodically be replicated to the secondary storage using the replication log.
    • 用于记录异步复制卷组的系统和方法。 可以接收将数据写入卷中的位置的写入请求。 可以存储与写请求相关联的元数据。 可能确定写请求是否可能与尚未复制到辅助存储器的卷的一个或多个较早的写入请求重叠。 只有当写请求可能与一个或多个较早的写入请求重叠时,才能将数据存储在复制日志中。 如果写入请求与一个或多个较早的写入请求与卷重叠,则数据可能不会存储在复制日志中。 数据可能会写入卷中的位置。 可以使用复制日志定期将对卷的更改复制到辅助存储。
    • 16. 发明申请
    • Self-Adjusting Change Tracking for Fast Resynchronization
    • 自动调整更改跟踪快速重新同步
    • US20110099343A1
    • 2011-04-28
    • US12605544
    • 2009-10-26
    • Kadir Ozdemir
    • Kadir Ozdemir
    • G06F12/00G06F12/16
    • G06F11/2082G06F11/2074
    • System and method for tracking changes to a volume. A write request to write data to a first location in the volume may be received. It may be determined if the first location is overlapping with or adjacent to one or more locations of earlier write requests to the volume. First location information may be stored in a data structure in response to determining that the first location is overlapping with or adjacent to one or more second locations of earlier write requests to the volume. The first location information may identify the first location and the one or more second locations. Second location information may be removed from the data structure, where the second location information identifies the one or more second locations of earlier write requests to the volume. The data may be written to the first location in the volume in response to the write request.
    • 用于跟踪卷变化的系统和方法。 可以接收将数据写入卷中的第一位置的写入请求。 可以确定第一位置是否与对该卷的早期写入请求的一个或多个位置重叠或相邻。 第一位置信息可以存储在数据结构中,以响应于确定第一位置与先前对该卷的写入请求的一个或多个第二位置重叠或相邻。 第一位置信息可以标识第一位置和一个或多个第二位置。 可以从数据结构中去除第二位置信息,其中第二位置信息将早期写入请求的一个或多个第二位置标识到该卷。 可以响应写入请求将数据写入卷中的第一个位置。
    • 17. 发明授权
    • Distributed iSCSI and SCSI targets
    • 分布式iSCSI和SCSI目标
    • US06915354B1
    • 2005-07-05
    • US10136221
    • 2002-04-30
    • Kadir OzdemirIsmail DalgicMichael SybenFrederic PontJeffrey Henry RaubitschekOmer Tunali
    • Kadir OzdemirIsmail DalgicMichael SybenFrederic PontJeffrey Henry RaubitschekOmer Tunali
    • G06F13/00G06F13/10
    • G06F13/102Y10T70/413Y10T70/493Y10T70/7294
    • Apparatus and methods for distributing iSCSI and SCSI targets. The initiator may assist in the distribution and order the SCSI commands. A subset of target storage processors may act as proxies. Target storage processors forward requests to a selected target storage processor which decides whether any and which of the other target storage processors is to process a forwarded request. The target storage processors may act as peers. A target storage processor communicates each received request to all of the other storage processors. Each of the target storage processors determines whether a request it received is to execute. A target storage processors may arrange themselves into layers to divide the SCSI and iSCSI protocol work. A distributed system associates each of multiple egress target storage processors with a respective ingress target storage processor and associates a set of blocks of storage with each of the egress target storage processors.
    • 用于分发iSCSI和SCSI目标的设备和方法。 启动器可以协助分发和命令SCSI命令。 目标存储处理器的一个子集可以作为代理。 目标存储处理器将请求转发到所选择的目标存储处理器,所述目标存储处理器决定是否有任何目标存储处理器和哪个其他目标存储处理器处理转发的请求。 目标存储处理器可以充当对等体。 目标存储处理器将所接收的请求传送到所有其他存储处理器。 每个目标存储处理器确定其接收到的请求是否要执行。 目标存储处理器可以安排自己进行分层以划分SCSI和iSCSI协议工作。 分布式系统将多个出口目标存储处理器中的每一个与相应的入口目标存储处理器相关联,并将一组存储块与每个出口目标存储处理器相关联。
    • 20. 发明授权
    • Method and system for fast block storage recovery
    • 快速块存储恢复的方法和系统
    • US08862858B1
    • 2014-10-14
    • US13630274
    • 2012-09-28
    • Kadir Ozdemir
    • Kadir Ozdemir
    • G06F12/10G06F11/14
    • G06F12/10G06F11/1435
    • A computer-implemented method and apparatus manages block mapping. The block mapping maps physical blocks in a block storage device to virtual blocks of a virtual address space. The method involves assigning a generation number from a net of generation numbers to each block mapping entry, where the block mapping entry correlates a physical block with a virtual block. A maximum generation number of the set of generation numbers is increased and a first block mapping entry is marked dirty in response to an update of a correlated first virtual block. A generation number of the first block mapping entry is set to the maximum generation number. Finally, a generation number of a second block mapping entry having a lowest generation number is set to a generation number of the first block mapping entry.
    • 计算机实现的方法和装置管理块映射。 块映射将块存储设备中的物理块映射到虚拟地址空间的虚拟块。 该方法包括从生成号码网络向每个块映射条目分配生成号码,其中块映射条目将物理块与虚拟块相关联。 响应于相关的第一虚拟块的更新,增加了该组生成号码的最大代数,并且第一块映射条目被标记为脏。 将第一块映射条目的代号设置为最大代数。 最后,将具有最低生成数的第二块映射条目的生成号码设置为第一块映射条目的生成号码。