专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20050086469A1 Scalable, fault tolerant notification method 审中-公开
标题翻译：可扩展的容错通知方法
公开(公告)号：US20050086469A1
公开(公告)日：2005-04-21
申请号：US10686620
申请日：2003-10-17
申请人： John Dunagan , Nicholas Harvey , Michael Jones , Marvin Theimer , Alastair Wolman
发明人： John Dunagan , Nicholas Harvey , Michael Jones , Marvin Theimer , Alastair Wolman
IPC分类号： H04L9/00 , H04L12/18
CPC分类号： H04L12/1877 , H04L12/1854 , H04L12/1859
摘要： A scalable, fault-tolerant, federated event notification method is described, wherein clients express interest in a topic by subscribing, and published event notifications are delivered to all current topic-subscribers. Event notifications are disseminated by a multicast tree that does not require participation by unwilling nodes. The multicast tree is constructed so that nodes belonging to the organization owning the tree do not rely on nodes outside the organization to forward message traffic. Event notifications are delivered using redundant tree-based application-level multicast to ensure reliable delivery.
摘要翻译：描述了可扩展的，容错的联合事件通知方法，其中客户端通过订阅来表达对主题的兴趣，并且将已发布的事件通知传递给所有当前主题订户。事件通知由不需要参与的多播树传播。组播树的构造使得属于拥有该树的组织的节点不依赖于组织外部的节点来转发消息流量。事件通知使用冗余的基于树的应用程序级多播来确保可靠的传送。

2. 发明申请

US20050083834A1 Method for providing guaranteed distributed failure notification 有权
标题翻译：提供有保证的分布式故障通知的方法
公开(公告)号：US20050083834A1
公开(公告)日：2005-04-21
申请号：US10686658
申请日：2003-10-17
申请人： John Dunagan , Nicholas Harvey , Michael Jones , Dejan Kostic , Marvin Theimer , Alastair Wolman
发明人： John Dunagan , Nicholas Harvey , Michael Jones , Dejan Kostic , Marvin Theimer , Alastair Wolman
IPC分类号： G06F11/00 , G01R31/08 , G06F11/07 , G06F15/00 , H04L12/18 , H04L12/24 , H04L12/56 , H04L29/06 , H04L29/08 , H04L29/14
CPC分类号： H04L45/16 , G06F11/0709 , G06F11/0772 , G06F11/0784 , H04L12/1895 , H04L29/06 , H04L41/06 , H04L45/02 , H04L45/04 , H04L45/48 , H04L67/26 , H04L69/329
摘要： A guaranteed distributed failure notification method is described, wherein a failure notification (FN) facility allows applications using the facility to create FN groups to which the application associates an application state. The application registers failure handlers with the FN facility on nodes in the FN group; each failure handler is associated with a specific FN group. When, on a given node, the FN facility learns of a failure in the FN group, the facility executes the associated failure handler on that node. System failures detected by the application are signaled to other FN group members using the facility. The facility detects system failures that occur in an overlay network on which the facility is implemented, and signals a failure notification to the other FN group members.
摘要翻译：描述了保证的分布式故障通知方法，其中故障通知（FN）设施允许使用该设施的应用创建应用程序将应用程序状态与之相关联的FN组。应用程序在FN组中的节点上注册FN设备的故障处理程序; 每个故障处理程序与特定FN组相关联。当FN给定节点在FN组中发现故障时，设备将在该节点上执行关联的故障处理程序。使用该设施向应用程序检测到的系统故障发信号通知其他FN组成员。该设施检测在实施设施的覆盖网络中发生的系统故障，并向其他FN组成员发出故障通知。

3. 发明申请

US20050256879A1 Method for designating communication paths in a network 有权
标题翻译：用于指定网络中的通信路径的方法
公开(公告)号：US20050256879A1
公开(公告)日：2005-11-17
申请号：US11043607
申请日：2005-01-26
申请人： Jeffrey Parham , Mark Brown , William Lees , Van Vu , Laszlo Lovasz , Nicholas Harvey , Katalin Vesztergombi
发明人： Jeffrey Parham , Mark Brown , William Lees , Van Vu , Laszlo Lovasz , Nicholas Harvey , Katalin Vesztergombi
IPC分类号： H04L12/56 , G06F17/30
CPC分类号： H04L45/04 , H04L45/14 , H04L45/46
摘要： A method for designating communication paths in a computer network is provided, in which communication paths are designated for the transmission of data throughout a network. The network may have both recipient computers, which are the intended recipients of the data, and intermediary computers, which are not the intended recipients, but merely relay the data. Each intermediary computer is grouped with the “closest” recipient computer (i.e. the recipient computer with whom it is “least expensive” to communicate). Communication paths between the resulting groups are then identified. A representation of the network is then created. The representation replaces the intermediary computers with the inter-group communication paths, so that the inter-group communication paths appear to pass directly through the locations occupied by the intermediary computers. The created representation is then further processed so that the “least expensive” communication paths may be designated.
摘要翻译：提供了一种用于指定计算机网络中的通信路径的方法，其中指定通信路径用于在整个网络中传输数据。网络可以具有作为数据的预期接收者的接收方计算机和不是预期接收者的中介计算机，而只是中继数据。每个中间计算机与“最接近”的收件人计算机（即，与之通信的“最便宜”的接收者计算机）分组。然后识别所得组之间的通信路径。然后创建网络的表示。该表示用组间通信路径替换中间计算机，使得组间通信路径似乎直接通过中间计算机占据的位置。然后进一步处理所创建的表示，使得可以指定“最便宜”的通信路径。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式