公开(公告)号：WO2004049670A3

公开(公告)日：2004-12-23

申请号：PCT/GB0304448

申请日：2003-10-15

Applicant: IBM ,  IBM UK

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR MOOTHEDATH ,  YOUNG HONESTY CHENG

IPC: H04L29/06 ,  H04L29/08

CPC classification number: H04L67/1008 ,  H04L67/1002 ,  H04L67/1012 ,  H04L67/1019 ,  H04L67/1097 ,  H04L67/327 ,  H04L69/329 ,  H04L2029/06054

Abstract: An intelligent router routes a user request to a storage server that is capable of handling that request natively, without emulation. The request is routed automatically, without any instruction or interaction on the part of the user. The intelligent router includes a storage tank-like computing environment and a set of intelligent routers. The set of intelligent routers appears as a single entity to users by presenting a single network IP address. When the intelligent router receives a request, it examines the protocol type and routes the request to one of the appropriate storage tank clients. The intelligent router does not change the contents of the request message, and thus the storage tank system do not become aware of the existence of the intelligent router. Consequently, any return messages do not need to go through the intelligent router, unless desired.

Abstract translation: 智能路由器将用户请求路由到能够本地处理该请求的存储服务器，而不进行仿真。 请求将自动路由，不需要用户的任何指令或交互。 智能路由器包括一个存储槽状计算环境和一组智能路由器。 该智能路由器通过呈现单个网络IP地址，向用户显示单个实体。 当智能路由器接收到请求时，会检查协议类型，并将请求路由到相应的存储槽客户端之一。 智能路由器不会更改请求消息的内容，因此存储系统不会意识到智能路由器的存在。 因此，除非需要，任何返回消息都不需要经过智能路由器。

公开(公告)号：WO2007039455A3

公开(公告)日：2007-09-20

申请号：PCT/EP2006066522

申请日：2006-09-20

Applicant: IBM ,  IBM UK ,  HSU WINDSOR WEE SUN ,  MA XIAONAN

Inventor： HSU WINDSOR WEE SUN ,  MA XIAONAN

IPC: G06F17/30 ,  G06F21/00 ,  G06Q10/00

CPC classification number: G06F21/805 ,  Y10S707/99931 ,  Y10S707/99945 ,  Y10S707/99948

Abstract: An object storage system provides a storage object to support index structures, logs, and audit trails in WORM storage. The storage object includes a mutable object, an immutable object, or an appendable object. For each storage object, the system maintains an indication of type, such as mutable, immutable, or appendable object type. A mutable object can be arbitrarily modified, an immutable object cannot be modified, and the contents of the appendable object cannot be modified but can be appended with new data. Appended data becomes immutable. The system enables a protection level represented by the object type to be upgraded but not downgraded. Consequently, data committed to be immutable cannot be changed by changing the type of the storage object.

Abstract translation: 对象存储系统提供一个存储对象来支持WORM存储中的索引结构，日志和审计跟踪。 存储对象包括可变对象，不可变对象或可追加对象。 对于每个存储对象，系统都会维护类型的指示，例如可变，不可变或可追加的对象类型。 一个可变对象可以被任意修改，一个不可变对象不能被修改，并且可追加对象的内容不能被修改，但可以附加新数据。 附加的数据变得不可变。 系统使对象类型所代表的保护级别升级但不降级。 因此，通过更改存储对象的类型无法更改承诺为不可变的数据。

公开(公告)号：AU2003271982A1

公开(公告)日：2004-05-25

申请号：AU2003271982

申请日：2003-10-17

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR MOOTHEDATH ,  YOUNG HONESTY CHENG ,  NG SPENCER

IPC: G06F11/10

Abstract: Stored data can be recovered from a disk array having at least 2n+1 physical disks that are capable of storing n physical disks worth of data when any two disks fail, or when more than two dependent disks fail. Data is stored in data stripes that are divided into n substantially equal-sized strips and are distributed across the n disks. Each data stripe has a corresponding parity strip that is generated by including the data strips in the data stripe only once when the parity strip is generated. The data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are distributed across the disks in such a manner that the data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are each on a respectively different disk of the disk array.

公开(公告)号：CA2739639A1

公开(公告)日：2004-05-13

申请号：CA2739639

申请日：2003-10-17

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR MOOTHEDATH ,  YOUNG HONESTY CHENG

IPC: G06F11/16 ,  G06F11/10

Abstract: Stored data can be recovered from a disk array having at least 2n+1 physical disks that are capable of storing n physical disks worth of data when any two disks fail, or when more than two dependent disks fail. Data is stored in data stripes that are divided into n substantially equal-sized strips and are distributed across the n disks. Each data stripe has a corresponding parity strip that is generated by including the data strips in the data stripe only once when the parity strip is generated. The data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are distributed across the disks in such a manner that the data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are each on a respectively different disk of the disk array.

公开(公告)号：DE60316466T2

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

申请号：DE60316466

申请日：2003-10-15

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR ,  YOUNG HONESTY CHENG

IPC: H04L29/06 ,  H04L29/08

Abstract: An intelligent router routes a user request to a storage server that is capable of handling that request natively, without emulation. The request is routed automatically, without any instruction or interaction on the part of the user. The intelligent router includes a storage tank-like computing environment and a set of intelligent routers. The set of intelligent routers appears as a single entity to users by presenting a single network IP address. When the intelligent router receives a request, it examines the protocol type and routes the request to one of the appropriate storage tank clients. The intelligent router does not change the contents of the request message, and thus the storage tank system do not become aware of the existence of the intelligent router. Consequently, any return messages do not need to go through the intelligent router, unless desired.

公开(公告)号：CA2503129C

公开(公告)日：2011-08-09

申请号：CA2503129

申请日：2003-10-17

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR MOOTHEDATH ,  YOUNG HONESTY CHENG ,  NG SPENCER

IPC: G06F11/10

Abstract: Stored data can be recovered from a disk array having at least 2n + 1 physical disks that are capable of storing n physical disks worth of data when any two disks fail, or when more than two dependent disks fail. Data is stored in data stripes that are divided into n substantially equal-sized strips and are distributed across the n disks. Each data stripe has a corresponding parity strip that is generated by including the data strips in the data stripe only once when the parity strip is generated. The data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are distributed across the disks in such a manner that the data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are each on a respectively different disk of the disk array.

公开(公告)号：AT321300T

公开(公告)日：2006-04-15

申请号：AT03753821

申请日：2003-10-17

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR MOOTHEDATH ,  YOUNG HONESTY CHENG ,  NG SPENCER

IPC: G06F11/10

Abstract: Stored data can be recovered from a disk array having at least 2n+1 physical disks that are capable of storing n physical disks worth of data when any two disks fail, or when more than two dependent disks fail. Data is stored in data stripes that are divided into n substantially equal-sized strips and are distributed across the n disks. Each data stripe has a corresponding parity strip that is generated by including the data strips in the data stripe only once when the parity strip is generated. The data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are distributed across the disks in such a manner that the data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are each on a respectively different disk of the disk array.

公开(公告)号：CA2503129A1

公开(公告)日：2004-05-13

申请号：CA2503129

申请日：2003-10-17

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  NG SPENCER ,  YOUNG HONESTY CHENG ,  MENON JAISHANKAR MOOTHEDATH

IPC: G06F11/10

Abstract: Stored data can be recovered from a disk array having at least 2n + 1 physic al disks that are capable of storing n physical disks worth of data when any tw o disks fail, or when more than two dependent disks fail. Data is stored in da ta stripes that are divided into n substantially equal-sized strips and are distributed across the n disks. Each data stripe has a corresponding parity strip that is generated by including the data strips in the data stripe only once when the parity strip is generated. The data strips of each data stripe , the copy of each such data strip and the corresponding parity strip are distributed across the disks in such a manner that the data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are each on a respectively different disk of the disk array.

公开(公告)号：DE60316466D1

公开(公告)日：2007-10-31

申请号：DE60316466

申请日：2003-10-15

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR ,  YOUNG HONESTY CHENG

IPC: H04L29/06 ,  H04L29/08

Abstract: An intelligent router routes a user request to a storage server that is capable of handling that request natively, without emulation. The request is routed automatically, without any instruction or interaction on the part of the user. The intelligent router includes a storage tank-like computing environment and a set of intelligent routers. The set of intelligent routers appears as a single entity to users by presenting a single network IP address. When the intelligent router receives a request, it examines the protocol type and routes the request to one of the appropriate storage tank clients. The intelligent router does not change the contents of the request message, and thus the storage tank system do not become aware of the existence of the intelligent router. Consequently, any return messages do not need to go through the intelligent router, unless desired.

公开(公告)号：AT373918T

公开(公告)日：2007-10-15

申请号：AT03769620

申请日：2003-10-15

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR ,  YOUNG HONESTY

IPC: H04L29/06 ,  H04L29/08

Abstract: An intelligent router routes a user request to a storage server that is capable of handling that request natively, without emulation. The request is routed automatically, without any instruction or interaction on the part of the user. The intelligent router includes a storage tank-like computing environment and a set of intelligent routers. The set of intelligent routers appears as a single entity to users by presenting a single network IP address. When the intelligent router receives a request, it examines the protocol type and routes the request to one of the appropriate storage tank clients. The intelligent router does not change the contents of the request message, and thus the storage tank system do not become aware of the existence of the intelligent router. Consequently, any return messages do not need to go through the intelligent router, unless desired.