公开(公告)号：US07945537B2

公开(公告)日：2011-05-17

申请号：US12126487

申请日：2008-05-23

Applicant: Srinivasan Balasubramanian ,  Tushar Mohan ,  Roberto C. Pineiro ,  Rohit Jain ,  Ramani R. Routray ,  Gauri Shah ,  Akshat Verma ,  Kaladhar Voruganti

Inventor： Srinivasan Balasubramanian ,  Tushar Mohan ,  Roberto C. Pineiro ,  Rohit Jain ,  Ramani R. Routray ,  Gauri Shah ,  Akshat Verma ,  Kaladhar Voruganti

IPC: G06F17/30

CPC classification number: G06F11/20

Abstract: Formulating an integrated disaster recovery (DR) plan based upon a plurality of DR requirements for an application by receiving a first set of inputs identifying one or more entity types for which the plan is to be formulated, such as an enterprise, one or more sites of the enterprise, the application, or a particular data type for the application. At least one data container representing a subset of data for an application is identified. A second set of inputs is received identifying at least one disaster type for which the plan is to be formulated. A third set of inputs is received identifying a DR requirement for the application as a category of DR Quality of Service (QoS) class to be applied to the disaster type. A composition model is generated specifying one or more respective DR QoS parameters as a function of a corresponding set of one or more QoS parameters representative of a replication technology solution. The replication technology solution encompasses a plurality of storage stack levels. A solution template library is generated for mapping the application to each of a plurality of candidate replication technology solutions. The template library is used to select a DR plan in the form of a replication technology solution for the application.

Abstract translation: 基于针对应用的多个DR需求来制定综合灾难恢复（DR）计划，所述DR要求通过接收标识要为其制定所述计划的一个或多个实体类型的第一组输入，诸如企业，一个或多个站点 的应用程序，或应用程序的特定数据类型。 识别表示应用程序的数据子集的至少一个数据容器。 接收第二组输入，确定要制定该计划的至少一种灾害类型。 接收到第三组输入，将应用程序的DR要求标识为要应用于灾难类型的DR服务质量（QoS）类别。 生成指定作为代表复制技术解决方案的一个或多个QoS参数的相应组的函数的一个或多个相应DR QoS参数的组合模型。 复制技术解决方案包含多个存储堆栈级别。 生成解决方案模板库，用于将应用程序映射到多个候选复制技术解决方案中的每一个。 模板库用于以应用程序的复制技术解决方案的形式选择DR计划。

公开(公告)号：US20100250750A1

公开(公告)日：2010-09-30

申请号：US12815373

申请日：2010-06-14

Applicant: MICHAEL T. MASSA ,  DAVID A. DION ,  RAJSEKHAR DAS ,  RUSHABH A. DOSHI ,  DAVID B. LOMET ,  GOR V. NISHANOV ,  PHILIP A. BERNSTEIN ,  ROD N. GAMACHE ,  ROHIT JAIN ,  SUNITA SHRIVASTAVA

Inventor： MICHAEL T. MASSA ,  DAVID A. DION ,  RAJSEKHAR DAS ,  RUSHABH A. DOSHI ,  DAVID B. LOMET ,  GOR V. NISHANOV ,  PHILIP A. BERNSTEIN ,  ROD N. GAMACHE ,  ROHIT JAIN ,  SUNITA SHRIVASTAVA

IPC: G06F15/173 ,  G06F11/00

CPC classification number: G06F17/30575 ,  G06F11/1425 ,  G06F11/1471 ,  G06F11/1479 ,  G06F11/1482 ,  G06F11/1662 ,  G06F11/181 ,  G06F11/182 ,  G06F11/2023 ,  G06F11/2035 ,  G06F11/2058 ,  G06F2201/82

Abstract: A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.

Abstract translation: 通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。 副本成员维护集群操作数据。 当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。 仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。 仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。 仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。

公开(公告)号：US20100228753A1

公开(公告)日：2010-09-09

申请号：US12392247

申请日：2009-02-25

Applicant: Rohit Jain ,  Michael Hardy ,  Christopher Runstedler

Inventor： Rohit Jain ,  Michael Hardy ,  Christopher Runstedler

IPC: G06F7/06 ,  G06F17/20 ,  G06F17/30

CPC classification number: G06F17/278

Abstract: A method, handheld electronic device and computer program product for allowing a user to view calendar data related to text the user is reading are provided. The method comprises: receiving an instruction to display a specified text; identifying at least one string in the specified text indicating date information; displaying the specified text with the date string presented as a hyperlink; and receiving user input activating the hyperlink and displaying calendar information related to the date indicated by the date string in response to the user input.

Abstract translation: 提供了一种用于允许用户查看用户正在阅读的与文本相关的日历数据的方法，手持电子设备和计算机程序产品。 该方法包括：接收显示指定文本的指令; 识别指定日期信息的指定文本中的至少一个字符串; 显示指定的文本，其中显示为超链接的日期字符串; 以及响应于所述用户输入，接收激活所述超链接并显示与由所述日期字符串指示的日期相关的日历信息的用户输入。

公开(公告)号：US20100223321A1

公开(公告)日：2010-09-02

申请号：US12394994

申请日：2009-02-27

Applicant: Christopher Runstedler ,  Rohit Jain ,  Samer Fahmy ,  Michael Hardy

Inventor： Christopher Runstedler ,  Rohit Jain ,  Samer Fahmy ,  Michael Hardy

IPC: G06F15/16

CPC classification number: G06F15/16 ,  G06F17/30029 ,  H04L67/04 ,  H04L67/06 ,  H04L67/28 ,  H04W28/00

Abstract: Apparatus and methods to engage in accessing informational content in a data hub server, where the informational content is identified as public or partially public to a group registered in the data hub server with permission to access the informational content made public or partially public in the data hub server by another entity, provide a mechanism to enhance the communication capabilities among mobile electronic devices. Additional apparatus, systems, and methods are disclosed.

Abstract translation: 参与访问数据中心服务器中的信息内容的装置和方法，其中信息内容被标识为在数据中心服务器中注册的组的公共或部分公开，允许访问在数据中公开或部分公开的信息内容 由另一个实体提供集线器服务器，提供一种增强移动电子设备之间通信能力的机制。 公开了附加装置，系统和方法。

公开(公告)号：US20100208625A1

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

申请号：US12393450

申请日：2009-02-26

Applicant: Adrian Logan ,  Rohit Jain ,  Eric Fritzley ,  Christopher Labrador ,  Michael McAndrews

Inventor： Adrian Logan ,  Rohit Jain ,  Eric Fritzley ,  Christopher Labrador ,  Michael McAndrews

IPC: H04L12/16 ,  H04M3/42

CPC classification number: H04M3/565 ,  G06Q10/109 ,  H04L12/1813 ,  H04L12/1818 ,  H04L12/1822 ,  H04L51/00 ,  H04M1/72566 ,  H04M3/42 ,  H04M3/56 ,  H04M3/567 ,  H04W4/06 ,  H04W88/02

Abstract: In a computer-implemented method of joining a user to a conference call event an interface associated with a time management software application is displayed. The interface displays information relating to the conference call event including a date for a conference call which is subject of the conference call event and a start time of the conference call. While displaying the interface, a menu offering one or more options is displayed; these one or more options include an option to join the conference call. When an indication of a selection of the option to join the conference call is received, information associated with the conference call is located; this information includes a telephone number for a conference call bridge. A connection with the conference call bridge using the telephone number is initiated.

Abstract translation: 在将用户加入会议呼叫事件的计算机实现的方法中，显示与时间管理软件应用相关联的接口。 该接口显示与电话会议事件相关的信息，包括会议呼叫事件的会议日期和电话会议的开始时间。 显示界面时，显示提供一个或多个选项的菜单; 这些一个或多个选项包括加入电话会议的选项。 当接收到选择加入电话会议的选项的指示时，定位与会议呼叫相关联的信息; 该信息包括用于电话会议桥的电话号码。 启动使用电话号码与电话会议桥的连接。

公开(公告)号：US07761420B2

公开(公告)日：2010-07-20

申请号：US11872930

申请日：2007-10-16

Applicant: Upendra Sharma ,  Tapan Kumar Nayak ,  Rohit Jain

Inventor： Upendra Sharma ,  Tapan Kumar Nayak ,  Rohit Jain

IPC: G06F17/00

CPC classification number: G06F17/30212 ,  G06F11/2066 ,  G06F11/2074

Abstract: A method and system for method for replicating object consisting of creating a group of objects at a first location; transmitting the group of objects from a first location to a second location over a network coupling the first location to the second location, such that the number of transmissions is minimized receiving the group of objects at the second location; and storing the group of objects at the second location. The objects are preferably data objects and are collated into group based on a probability score is computed for each data object centered on an access pattern. Advantages include minimizing the number of transmission of the group of objects thereby reducing network traffic and failure of operation during replication of the objects.

Abstract translation: 一种用于复制对象的方法的方法和系统，包括在第一位置创建一组对象; 通过将所述第一位置耦合到所述第二位置的网络将所述对象组从第一位置发送到第二位置，使得在所述第二位置处接收所述对象组的传输次数最小化; 以及将所述对象组存储在所述第二位置。 这些对象优选地是数据对象，并且基于为以访问模式为中心的每个数据对象计算概率分数而将其整理成组。 优点包括最小化对象组的传输次数，从而减少网络流量以及在对象复制期间的操作失败。

公开(公告)号：US07747475B1

公开(公告)日：2010-06-29

申请号：US12205724

申请日：2008-09-05

Applicant: Mary Kay Bowman ,  Eileen Tracey Quenin ,  Thomas L. Kovarik ,  Srinivas K. Rao ,  Rohit Jain ,  Nitesh Goyal

Inventor： Mary Kay Bowman ,  Eileen Tracey Quenin ,  Thomas L. Kovarik ,  Srinivas K. Rao ,  Rohit Jain ,  Nitesh Goyal

IPC: G07F1/12

CPC classification number: G06Q20/381 ,  G06Q20/04 ,  G06Q20/10 ,  G06Q20/102 ,  G06Q30/06 ,  G06Q30/0601 ,  G06Q40/00 ,  G06Q40/04

Abstract: This disclosure pertains to techniques for intelligent selection of a currency preference for a user and conversion of monetary values to the preferred currency for transactions entered into by the user. The conversion is performed using a firm exchange rate that is derived from a market exchange rate, but guaranteed for a period of time during which the transaction is anticipated to be completed.

Abstract translation: 本公开涉及用于智能选择用户的货币偏好和将货币价值转换为用户输入的交易的优选货币的技术。 转换是使用从市场汇率得出的固定汇率进行的，但保证在预期完成交易的一段时间内。

公开(公告)号：US20100076807A1

公开(公告)日：2010-03-25

申请号：US12234806

申请日：2008-09-22

Applicant: Matthew BELLS ,  Rohit Jain

Inventor： Matthew BELLS ,  Rohit Jain

IPC: G06Q10/00 ,  G06F3/048

CPC classification number: G06Q10/109 ,  G06F3/0481 ,  G06Q10/06311

Abstract: A method and apparatus for controlling an electronic device is provided, the electronic device having a processing unit interconnecting a memory and a display module, the processing unit configured to control the display module. The method comprises receiving, at the processing unit, first data representative of a meeting request. The method further comprises retrieving, at the processing unit, second data representative of an existing schedule, from the memory. The method further comprises generating at the processing unit a proposed schedule by merging the first data with the second data. The method further comprises, via the processing unit, controlling the display module to generate a representation of the proposed schedule on the display module.

Abstract translation: 提供了一种用于控制电子设备的方法和装置，所述电子设备具有将存储器和显示模块互连的处理单元，所述处理单元被配置为控制所述显示模块。 该方法包括在处理单元处接收代表会议请求的第一数据。 该方法还包括从处理单元从存储器检索表示现有日程表的第二数据。 该方法还包括通过将第一数据与第二数据合并，在处理单元处产生所提出的调度。 该方法还包括经由处理单元控制显示模块以在显示模块上生成所提出的时间表的表示。

公开(公告)号：US20090100112A1

公开(公告)日：2009-04-16

申请号：US11872930

申请日：2007-10-16

Applicant: Upendra Sharma ,  Tapan Kumar Nayak ,  Rohit Jain

Inventor： Upendra Sharma ,  Tapan Kumar Nayak ,  Rohit Jain

IPC: G06F17/30

CPC classification number: G06F17/30212 ,  G06F11/2066 ,  G06F11/2074

Abstract: A method and system for method for replicating object consisting of creating a group of objects at a first location; transmitting the group of objects from a first location to a second location over a network coupling the first location to the second location, such that the number of transmissions is minimized receiving the group of objects at the second location; and storing the group of objects at the second location. The objects are preferably data objects and are collated into group based on a probability score is computed for each data object centered on an access pattern. Advantages include minimizing the number of transmission of the group of objects thereby reducing network traffic and failure of operation during replication of the objects.

Abstract translation: 一种用于复制对象的方法的方法和系统，包括在第一位置创建一组对象; 通过将所述第一位置耦合到所述第二位置的网络将所述对象组从第一位置发送到第二位置，使得在所述第二位置处接收所述对象组的传输次数最小化; 以及将所述对象组存储在所述第二位置。 这些对象优选地是数据对象，并且基于为以访问模式为中心的每个数据对象计算概率分数而将其整理成组。 优点包括最小化对象组的传输次数，从而减少网络流量以及在对象复制期间的操作失败。

公开(公告)号：US20060129771A1

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

申请号：US11011861

申请日：2004-12-14

Applicant: Koustuv Dasgupta ,  Rohit Jain ,  Upendra Sharma ,  Akshat Verma

Inventor： Koustuv Dasgupta ,  Rohit Jain ,  Upendra Sharma ,  Akshat Verma

IPC: G06F12/00

CPC classification number: G06F3/0659 ,  G06F3/0605 ,  G06F3/0613 ,  G06F3/0647 ,  G06F3/067 ,  G06F16/214

Abstract: A method for performing a data migration task on an on-line data storage system comprises computing a migration utility, which is a function of the expected time taken to complete the data migration task and generating migration requests for performing the data migration task, where the data migration task is divided into sub-tasks and a migration request is generated for each sub-task. Next determining a migration deadline for performing the data migration; assigning reward values to customer storage requests; assigning reward values to the migration requests. Then scheduling the migration requests and the customer storage requests to maximize total rewards earned and executing the schedule in order to perform the data migration task

Abstract translation: 用于在在线数据存储系统上执行数据迁移任务的方法包括计算迁移实用程序，迁移实用程序是完成数据迁移任务所需的预期时间以及生成用于执行数据迁移任务的迁移请求的函数，其中 数据迁移任务分为子任务，并为每个子任务生成迁移请求。 接下来确定执行数据迁移的迁移期限; 将奖励值分配给客户存储请求; 将奖励值分配给迁移请求。 然后调度迁移请求和客户存储请求以最大化所获得的总奖励并执行调度，以执行数据迁移任务