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

1. 发明授权

US07406074B2 Bundling messages in communication networks 有权
标题翻译：在通信网络中捆绑消息
公开(公告)号：US07406074B2
公开(公告)日：2008-07-29
申请号：US10193932
申请日：2002-07-12
申请人： Bharat T. Doshi , Ramesh Nagarajan
发明人： Bharat T. Doshi , Ramesh Nagarajan
IPC分类号： H04L12/50 , G06F15/173
CPC分类号： H04L45/22 , H04L69/40
摘要： Multiple requests to set up and/or tear down connections in a node of a communication network (or multiple failure notifications) are bundled together for transmission within the network. In an “inter-nodal” embodiment, multiple connection requests/failure notifications are bundled together as a single message for transmission between pairs of nodes in the network. In an “intra-nodal” embodiment, multiple connection requests/failure notifications received at one component of a node in the network are bundled together as a single group for forwarding to another component within the same node for implementation. In either case, the bundling of multiple connection requests/failure notifications can reduce the total amount of time required to communicate and implement the desired connection requests/restoration processing. This reduction in time can be critical to the ability of a network to satisfy requirements associated with restoration processing following a network fault.
摘要翻译：在通信网络的节点（或多个故障通知）中建立和/或拆除连接的多个请求被捆绑在一起以在网络内传输。在“节点间”实施例中，将多个连接请求/故障通知捆绑在一起作为单个消息以在网络中的节点对之间进行传输。在“节点内”实施例中，在网络中的节点的一个组件处接收的多个连接请求/故障通知被捆绑在一起作为单个组，用于转发到同一节点内的另一个组件以用于实现。在任一情况下，多个连接请求/故障通知的捆绑可以减少通信和实现所需的连接请求/恢复处理所需的总时间量。网络故障后，网络能够满足与恢复处理相关的要求，这种时间的减少对于能力至关重要。

2. 发明授权

US08867333B2 Restoration path calculation considering shared-risk link groups in mesh networks 有权
标题翻译：考虑网状网络中共享风险链路组的恢复路径计算
公开(公告)号：US08867333B2
公开(公告)日：2014-10-21
申请号：US10673055
申请日：2003-09-26
申请人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
发明人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
IPC分类号： G06F11/00 , H04L1/00 , H04L12/26 , H04L12/24
CPC分类号： H04L41/0896 , H04L41/0213 , H04L41/0668
摘要： A method for determining a restoration path for a new service in a mesh network involves selecting between candidate restoration paths corresponding to a primary path for the new service based on the shared-risk link groups (SRLGs) associated with links in the primary path. The method includes, for each of a plurality of candidate restoration paths associated with the primary path, (1) determining whether the primary path requires any additional restoration bandwidth to be reserved on any link of the restoration path based on whether, for each link of the restoration path, the primary path is SRLG-disjoint from each other primary path that is protected by that link, (2) generating a path cost for the restoration path, where the path cost is a function of whether any additional restoration bandwidth is required; and (3) selecting the restoration path for the new service based on the path cost.
摘要翻译：用于确定网状网络中的新服务的恢复路径的方法包括基于与主路径中的链路相关联的共享风险链路组（SRLG）来选择与新服务的主路径相对应的候选恢复路径。该方法包括对于与主路径相关联的多个候选恢复路径中的每一个，（1）确定主路径是否需要在恢复路径的任何链路上保留任何额外的恢复带宽，基于对于每个链路是否恢复路径，主路径与被该链路保护的彼此主路径之间的SRLG不相交，（2）生成恢复路径的路径开销，其中路径开销是否需要任何额外的恢复带宽的函数 ; （3）根据路径成本选择新业务的恢复路径。

3. 发明授权

US07689693B2 Primary/restoration path calculation in mesh networks based on multiple-cost criteria 有权
标题翻译：基于多成本标准的网状网络中的主/恢复路径计算
公开(公告)号：US07689693B2
公开(公告)日：2010-03-30
申请号：US10673383
申请日：2003-09-26
申请人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
发明人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
IPC分类号： G06F15/173 , G06F15/16 , G06F11/00
CPC分类号： H04J14/0284 , H04J14/0227 , H04J14/0241 , H04J14/0294 , H04J14/0295 , H04L45/12 , H04L45/124 , H04L45/22 , H04L45/28 , H04L45/50 , H04L45/62
摘要： A method for determining primary and restoration paths for a new service in a mesh network involves (1) for each of a plurality of candidate primary/restoration path pairs for the new service, generating a path cost for each candidate pair, where the path cost for each restoration path is a function of the sum of the cost of links within the restoration path, and (2) selecting the primary and restoration paths for the new service from the plurality of candidate path pairs based on the path cost. If no sharing is possible, for low utilization links, the cost of links is a function of the administrative weight of the link, whereas for high utilization links, the link cost is a function of the inverse of the available capacity on the link. If sharing is possible, the cost is a function of the inverse of a sharing degree for the link.
摘要翻译：用于确定网状网络中的新服务的主路径和恢复路径的方法涉及（1）针对新服务的多个候选主/恢复路径对中的每一个，生成每个候选对的路径开销，其中路径成本对于每个恢复路径是恢复路径内的链路成本之和的函数，以及（2）基于路径开销从多个候选路径对中选择新服务的主路径和恢复路径。如果没有可能的共享，对于低利用率链路，链路的成本是链路的管理权重的函数，而对于高利用率链路，链路成本是链路上可用容量的倒数的函数。如果共享是可能的，则成本是链路共享度的倒数的函数。

4. 发明授权

US07451340B2 Connection set-up extension for restoration path establishment in mesh networks 有权
标题翻译：网状网络中恢复路径建立的连接建立扩展
公开(公告)号：US07451340B2
公开(公告)日：2008-11-11
申请号：US10673382
申请日：2003-09-26
申请人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
发明人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
IPC分类号： G06F11/00
CPC分类号： H04L45/123 , H04L41/0663 , H04L45/22 , H04L45/28 , H04L45/50
摘要： An extension to a connection setup protocol for establishment of a restoration path for a service in a mesh network involves, at a transit node along the restoration path, the steps of (1) receiving a service data structure having an identification of each link and transit node in a primary path for the service, and (2) determining whether to reserve additional protection bandwidth on an outgoing link incident to the transit node using the service data structure, wherein the outgoing link is part of the restoration path. In one or more embodiments, the service data structure includes identification of the service, identification of the outgoing link, and bandwidth of the service. In some cases, the extension involves reserving the additional protection bandwidth on the outgoing link, if the transit node determines that the protection bandwidth is required, based upon knowledge of the protection bandwidth already reserved on the outgoing link.
摘要翻译：用于建立网状网络中的服务的恢复路径的连接建立协议的扩展涉及在沿着恢复路径的传输节点处的步骤（1）接收具有每个链路和传输的标识的服务数据结构节点，以及（2）使用服务数据结构确定是否在事件发生的出站链路上预留额外的保护带宽，其中，出站链路是恢复路径的一部分。在一个或多个实施例中，服务数据结构包括服务的标识，输出链路的标识和服务的带宽。在一些情况下，如果传输节点基于已经在传出链路上保留的保护带宽的知识，则传输节点确定需要保护带宽，则扩展包括在出站链路上保留附加保护带宽。

5. 发明授权

US08296407B2 Calculation, representation, and maintenance of sharing information in mesh networks 有权
标题翻译：网状网络共享信息的计算，表示和维护
公开(公告)号：US08296407B2
公开(公告)日：2012-10-23
申请号：US10673381
申请日：2003-09-26
申请人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
发明人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
IPC分类号： G06F15/177 , G06F15/173 , H04J3/22
CPC分类号： H04L41/0663 , H04L41/0213 , H04L41/5019 , H04L41/5087
摘要： A method for representing, in a network data structure, a minimum amount of protection bandwidth required to be reserved on each link in a mesh network, to restore service upon failure of another node or link in the network. The method includes (1) receiving a request for a new service in the network, wherein the new service is represented by a service data structure having an identification of each link and transit node in a primary path for the new service, (2) determining, using the network and service data structures, whether the new service requires additional protection bandwidth to be reserved on any link in the network, and (3) updating the network data structure if any additional protection bandwidth is determined to be needed. In one implementation the network and service data structures are vectors and the steps of determining and updating involve vector operations between these structures.
摘要翻译：一种用于在网络数据结构中表示在网状网络中的每个链路上保留的最小保护带宽量以在网络中的另一节点或链路故障时恢复服务的方法。该方法包括：（1）在网络中接收对新服务的请求，其中新服务由具有用于新服务的主路径中的每个链路和传输节点的标识的服务数据结构表示，（2）确定使用网络和服务数据结构，新服务是否需要在网络中的任何链路上保留额外的保护带宽，以及（3）如果确定需要额外的保护带宽，则更新网络数据结构。在一个实现中，网络和服务数据结构是向量，并且确定和更新的步骤涉及这些结构之间的向量操作。

6. 发明授权

US10084856B2 Method and apparatus for locating services within peer-to-peer networks 有权
公开(公告)号：US10084856B2
公开(公告)日：2018-09-25
申请号：US12640072
申请日：2009-12-17
申请人： Thomas P. Chu , Ramesh Nagarajan
发明人： Thomas P. Chu , Ramesh Nagarajan
IPC分类号： G06F17/30 , H04L29/08
CPC分类号： H04L67/104 , H04L67/1065 , H04L67/107 , H04L67/16
摘要： A capability is provided for supporting a service location capability in a peer-to-peer network (P2P), such as a Chord network or other P2P network. In one embodiment, a method for locating a service within a P2P network is provided. The P2P network includes a plurality of nodes, including a target node which performs the method for locating the service within the P2P network. The target node includes a search table including a plurality of entries identifying a respective plurality of nodes of the P2P network. The method includes detecting a request to search for the service within the P2P network and initiating, toward at least one of the nodes of the search table, a service search request. The service search request is a request to identify at least one node of the P2P network that supports the service. The service search request includes information indicative of the service and a search range for use by the node receiving the service search request.

7. 发明授权

US08842984B2 Methods of protection sharing for multi-protected optical demands in large-scale WDM mesh networks 有权
标题翻译：大规模WDM网状网络中多重保护光学需求的保护共享方法
公开(公告)号：US08842984B2
公开(公告)日：2014-09-23
申请号：US12169204
申请日：2008-07-08
申请人： Ahmet A. Akyamac , Gary W. Atkinson , Ramesh Nagarajan
发明人： Ahmet A. Akyamac , Gary W. Atkinson , Ramesh Nagarajan
IPC分类号： H04B10/08 , H04J14/02 , H04L12/24 , H04L12/707
CPC分类号： H04J14/0284 , H04J14/028 , H04J14/0295 , H04L41/0663 , H04L45/22 , H04L45/28
摘要： A method and system for identifying and, optionally, managing protection resource sharing opportunities, such as within a large-scale wavelength-division multiplexing (WDM) mesh network.
摘要翻译：一种用于识别和可选地管理保护资源共享机会的方法和系统，例如在大规模波分多路复用（WDM）网状网络内。

8. 发明授权

US08294959B2 Electronic document update based on handwritten edits 有权
标题翻译：基于手写编辑的电子文档更新
公开(公告)号：US08294959B2
公开(公告)日：2012-10-23
申请号：US12356952
申请日：2009-01-21
申请人： Claire Dawn Ireland , Ramesh Nagarajan
发明人： Claire Dawn Ireland , Ramesh Nagarajan
IPC分类号： H04N1/04
CPC分类号： G06F17/211 , G06F17/241 , H04N1/00326 , H04N1/00331 , H04N2201/3245
摘要： An automated system and method for recognizing handwritten edits contained on a hard-copy document, the hand-written edits being made in one of two colors, and creating an electronic version of the hard-copy document with the edits applied, the edits being applied according to the highlighted color of the edit.
摘要翻译：用于识别硬拷贝文件上的手写编辑的自动化系统和方法，以两种颜色之一进行手写编辑，并且创建具有所编辑的硬拷贝文档的电子版本，所述编辑被应用根据编辑的突出显示颜色。

9. 发明授权

US07697789B2 System and method for enhancing stored binary images 有权
标题翻译：用于增强存储的二进制图像的系统和方法
公开(公告)号：US07697789B2
公开(公告)日：2010-04-13
申请号：US11413203
申请日：2006-04-28
申请人： Peter McCandlish , Ramesh Nagarajan , Clara Cuciurean-Zapan
发明人： Peter McCandlish , Ramesh Nagarajan , Clara Cuciurean-Zapan
IPC分类号： G06K9/32
CPC分类号： H04N1/409 , H04N1/40075
摘要： A multifunction apparatus and method for enhancing store binary image data, is disclosed. The method includes retrieving the stored binary image data, converting the binary image data into higher-resolution image data, determining image enhancement processes, and applying the image enhancement processes to the higher-resolution image data to produce an enhanced image. The method further includes determining output format of the enhanced image and outputting the enhanced image.
摘要翻译：公开了一种用于增强存储二进制图像数据的多功能装置和方法。该方法包括检索存储的二进制图像数据，将二进制图像数据转换成更高分辨率图像数据，确定图像增强处理，以及将图像增强处理应用于较高分辨率图像数据以产生增强图像。该方法还包括确定增强图像的输出格式并输出增强图像。

10. 发明授权

US07685561B2 Storage API for a common data platform 有权
标题翻译： Storage API用于通用数据平台
公开(公告)号：US07685561B2
公开(公告)日：2010-03-23
申请号：US11195320
申请日：2005-08-02
申请人： Michael E. Deem , Benjamin Albahari , Ramesh Nagarajan , Michael J. Pizzo , Arthur T. Whitten , Edward G. Sheppard
发明人： Michael E. Deem , Benjamin Albahari , Ramesh Nagarajan , Michael J. Pizzo , Arthur T. Whitten , Edward G. Sheppard
IPC分类号： G06F9/44
CPC分类号： G06F17/3056
摘要： An application program interface (API) for a data platform. The API includes a generic data access component that exposes at least one of stores, sessions, transactions, and query services of the data platform, which data platform is associated with a data store. A data classes component of the API provides canonical, application-independent classes that expose types and relationships of a data model of the data platform. The API includes a domain data classes component of application-specific and framework-specific classes that expose domain-specific properties and behaviors of the data platform. The data platform can be a common data platform that interfaces to the data store to provide data services accessible by a plurality of disparate application frameworks, which data services allow a corresponding application of the different frameworks to access the data store.
摘要翻译：用于数据平台的应用程序接口（API）。 API包括通用数据访问组件，其暴露数据平台的至少一个存储，会话，事务和查询服务，该数据平台与数据存储相关联。 API的数据类组件提供了规范的，独立于应用程序的类，用于暴露数据平台数据模型的类型和关系。该API包括专门针对特定于应用程序和特定于框架的类的域数据类组件，以暴露数据平台的特定于域的属性和行为。数据平台可以是与数据存储器接口以提供可由多个不同应用框架访问的数据服务的通用数据平台，该数据服务允许不同框架的相应应用访问数据存储。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式