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

1. 发明授权

US07636309B2 Multi-path routing using intra-flow splitting 有权
标题翻译：使用流内分割的多路径路由
公开(公告)号：US07636309B2
公开(公告)日：2009-12-22
申请号：US11169194
申请日：2005-06-28
申请人： Mansoor Ali Khan Alicherry , Jin Cao , Harsha S. Nagesh , Chitra A. Phadke , Viswanath Poosala
发明人： Mansoor Ali Khan Alicherry , Jin Cao , Harsha S. Nagesh , Chitra A. Phadke , Viswanath Poosala
IPC分类号： H04J1/16
CPC分类号： H04L45/24 , H04L45/02 , H04L45/30
摘要： Multi-path routing techniques using intra-flow splitting are disclosed. For example, a technique for processing traffic flows at a node in a network comprises the following steps/operations. At least one traffic flow is obtained. The at least one traffic flow comprises multiple packets or bytes. The at least one flow is split into at least two sub-flows, wherein each of the at least two sub-flows comprises a portion of the multiple packets or bytes. The packets or bytes of the at least two sub-flows are respectively routed on at least two paths in the network.
摘要翻译：公开了使用流内分割的多路径路由技术。例如，用于在网络中的节点处处理业务流的技术包括以下步骤/操作。至少得到一个交通流量。所述至少一个业务流包括多个分组或字节。至少一个流被分成至少两个子流，其中至少两个子流中的每一个包括多个分组或字节的一部分。至少两个子流的分组或字节分别在网络中的至少两个路径上路由。

2. 发明授权

US07660235B2 Low latency shared data path allocation 有权
标题翻译：低延迟共享数据路径分配
公开(公告)号：US07660235B2
公开(公告)日：2010-02-09
申请号：US10392574
申请日：2003-03-20
申请人： Mansoor Ali Khan Alicherry , Sadanand M Gogate , Harsha S Nagesh , Chitra A Phadke , Viswanath Poosala
发明人： Mansoor Ali Khan Alicherry , Sadanand M Gogate , Harsha S Nagesh , Chitra A Phadke , Viswanath Poosala
IPC分类号： H04L1/16
CPC分类号： H04L45/24 , H04L45/00 , H04L45/22 , H04L45/28 , H04L45/62
摘要： A fast shared path allocation technique is disclosed. Network nodes are pre-configured such that data from multiple data sources or multiple primary data paths may be sent via a shared secondary data path. Merge nodes merge input from a plurality of input ports onto an output port. The merge nodes implement a blocking function such that upon receipt of a signal from one of the input ports, the signals from the other input ports are blocked from reaching the output port. Upon a triggering event indicating a need to allocate the shared path, the data is first sent to the merge node where it is appropriately merged onto the output link and transmitted towards its destination. Only after the data has been sent does the merge node block the remaining input ports from reaching the output port. This blocking may be performed automatically by the merge node or by conventional network signaling.
摘要翻译：公开了一种快速共享路径分配技术。网络节点被预配置成使得可以经由共享的辅助数据路径发送来自多个数据源或多个主数据路径的数据。合并节点将来自多个输入端口的输入合并到输出端口。合并节点实现阻塞功能，使得在从其中一个输入端口接收到信号时，来自其他输入端口的信号被阻止到达输出端口。在指示需要分配共享路径的触发事件时，首先将数据发送到合并节点，在合并节点处适当地合并到输出链路上并向其目的地发送。只有在发送数据之后，合并节点才能阻止剩余的输入端口到达输出端口。该阻塞可以由合并节点或传统的网络信令自动执行。

3. 发明授权

US08270301B2 Delay distributed virtually-concatenated data traffic 有权
标题翻译：延迟分布式虚拟连接的数据流量
公开(公告)号：US08270301B2
公开(公告)日：2012-09-18
申请号：US11025100
申请日：2004-12-29
申请人： Mansoor Ali Khan Alicherry , Harsha S. Nagesh , Chitra A. Phadke , Viswanath Poosala
发明人： Mansoor Ali Khan Alicherry , Harsha S. Nagesh , Chitra A. Phadke , Viswanath Poosala
IPC分类号： G01R11/00
CPC分类号： H04L45/00
摘要： Network design techniques and techniques for routing virtually-concatenated data traffic in a network in a manner which distributes delay to intermediate nodes of the network are disclosed. For example, in one aspect of the invention, a technique for routing virtually-concatenated data traffic in a network comprising a plurality of nodes comprises, for a given traffic demand to be routed from a source node to a destination node in the network, the following steps/operations. Two or more paths are determined to route the given traffic demand. Each of the two or more paths correspond to a member of a virtually-concatenated group. At least one path of the two or more paths comprises the source node, the destination node and at least one other node coupled between the source node and the destination node. Further, at least a subset of the source node, the destination node and the one other node buffer at least a portion of the given traffic demand such that a delay is distributed over the at least one path. The given traffic demand is routed over the two or more determined paths. The at least one path is preferably the shorter of the two or more determined paths.
摘要翻译：公开了以向网络的中间节点分发延迟的方式在网络中路由虚拟连接的数据业务的网络设计技术和技术。例如，在本发明的一个方面，用于在包括多个节点的网络中虚拟连接的数据业务路由的技术包括：对于要从网络中的源节点路由到目的地节点的给定业务需求，以下步骤/操作。确定两条或多条路径来路由给定的交通需求。两个或多个路径中的每一个对应于虚拟级联组的成员。两个或多个路径的至少一个路径包括源节点，目的地节点和耦合在源节点和目的节点之间的至少一个其他节点。此外，源节点，目的地节点和另一个节点的至少一个子集缓冲给定业务量的至少一部分，使得延迟分布在至少一个路径上。给定的业务需求通过两个或多个确定的路径路由。所述至少一个路径优选地是所述两个或更多个确定的路径中的较短的路径。

4. 发明授权

US07295533B2 Method for location tracking using vicinities 失效
标题翻译：使用附近的位置跟踪方法
公开(公告)号：US07295533B2
公开(公告)日：2007-11-13
申请号：US10795606
申请日：2004-03-08
申请人： Mansoor Ali Khan Alicherry , Harsha S Nagesh , Chitra A Phadke , Viswanath Poosala
发明人： Mansoor Ali Khan Alicherry , Harsha S Nagesh , Chitra A Phadke , Viswanath Poosala
IPC分类号： H04Q7/00
CPC分类号： G01S5/0289 , H04W64/003
摘要： A method for location tracking on a distributed basis using multiple locations, which utilizes a pairwise application of distance constraints and vicinities for determining locations. The location of a particular node is represented by a group of points (as opposed to a single point) defined by the vicinity.
摘要翻译：一种使用多个位置在分布式基础上进行位置跟踪的方法，利用距离约束和附近的成对应用来确定位置。特定节点的位置由附近定义的一组点（与单个点相对）来表示。

5. 发明授权

US08467293B2 Single-failure protection in a load-balanced network architecture 有权
标题翻译：负载平衡网络架构中的单故障保护
公开(公告)号：US08467293B2
公开(公告)日：2013-06-18
申请号：US11025085
申请日：2004-12-29
申请人： Mansoor Ali Khan Alicherry , Harsha S. Nagesh , Chitra A. Phadke , Viswanath Poosala
发明人： Mansoor Ali Khan Alicherry , Harsha S. Nagesh , Chitra A. Phadke , Viswanath Poosala
IPC分类号： G01R31/08
CPC分类号： H04J3/1617 , H04J2203/0067 , H04J2203/0085 , H04J2203/0094
摘要： Techniques for single-failure protection in load-balanced network architectures are disclosed. For example, in one aspect of the invention, a technique for processing a traffic flow in a communication network comprising a plurality of nodes, the traffic flow being deliverable from a source node to at least one destination node via one or more intermediate nodes, comprises the following steps/operations. The traffic flow is split at the source node into a plurality of parts. The parts are distributed to respective ones of the intermediate nodes such that the parts are routed from the source node to the at least one destination node in a disjoint manner.
摘要翻译：公开了负载均衡网络架构中单故障保护的技术。例如，在本发明的一个方面，一种用于处理包括多个节点的通信网络中的业务流的技术，该业务流可经由一个或多个中间节点从源节点传送到至少一个目的地节点，包括以下步骤/操作。业务流在源节点分割成多个部分。部件被分配到相应的中间节点，使得部件以不相交的方式从源节点路由到至少一个目的地节点。

6. 发明授权

US07466688B2 Routing and design in K-shared network 有权
标题翻译：在K共享网络中的路由和设计
公开(公告)号：US07466688B2
公开(公告)日：2008-12-16
申请号：US10656497
申请日：2003-09-05
申请人： Mansoor Ali Khan Alicherry , Harsha S. Nagesh , Chitra A. Phadke , Viswanath Poosala
发明人： Mansoor Ali Khan Alicherry , Harsha S. Nagesh , Chitra A. Phadke , Viswanath Poosala
IPC分类号： H04L12/28 , H04J1/16 , G08C15/00 , G06F11/00
CPC分类号： H04L45/18 , H04L45/12
摘要： Techniques for network routing and design are provided. A technique for determining a route for a demand in a network, wherein the network comprises primary paths and secondary paths, and at least two secondary paths may share a given link, comprises the following steps/operations. First, a graph representing the network is transformed. Edges of the graph represent channels associated with paths and nodes of the graph represent nodes of the network. The transformation is performed such that costs associated with the edges reflect costs of using channels in secondary paths. Then, the shortest path between nodes corresponding to the demand is found in the transformed graph. The shortest path represents the least-cost path in the network over which the demand may be routed. When the above route determination steps/operations result in a path with at least one loop, an alternative routing process may be executed so as to determine a loopless path for the demand. Further, integer linear program formulation design techniques are provided.
摘要翻译：提供网络路由和设计技术。一种用于确定网络中的需求的路由的技术，其中所述网络包括主路径和次路径，并且至少两个辅路径可以共享给定链路，包括以下步骤/操作。首先，转换表示网络的图。图的边缘表示与路径相关联的信道，图中的节点表示网络的节点。执行转换，使得与边缘相关联的成本反映在次要路径中使用信道的成本。然后，在变换图中找到与需求对应的节点之间的最短路径。最短路径表示可以路由需求的网络中的最低成本路径。当上述路线确定步骤/操作导致具有至少一个循环的路径时，可以执行替代路由处理，以便确定需求的无衬底路径。此外，提供整数线性程序公式设计技术。

7. 发明授权

US08180599B2 Network design utilizing network management routing algorithm 有权
标题翻译：网络设计利用网络管理路由算法
公开(公告)号：US08180599B2
公开(公告)日：2012-05-15
申请号：US10426501
申请日：2003-04-30
申请人： Mansoor Ali Khan Alicherry , Sadanand M. Gogate , Harsha S. Nagesh , Chitra A. Phadke , Viswanath Poosala
发明人： Mansoor Ali Khan Alicherry , Sadanand M. Gogate , Harsha S. Nagesh , Chitra A. Phadke , Viswanath Poosala
IPC分类号： G06F17/10 , G06F7/60
CPC分类号： H04L41/145
摘要： Techniques for designing networks. The techniques utilize network management-based routing (NMS routing) in conjunction with the planning step (design-based routing) of the design process so that an optimal network may be designed. An automated technique for designing a network may comprise the following steps. First, one or more traffic demands are obtained. Then, a network is computed by determining one or more routes for the one or more traffic demands using a design-based routing methodology based on feedback from a network management-based routing methodology.
摘要翻译：技术设计网络。该技术结合设计过程的规划步骤（基于设计的路由），利用基于网络管理的路由（NMS路由），从而可以设计最佳网络。用于设计网络的自动化技术可以包括以下步骤。首先，获得一个或多个交通需求。然后，基于基于基于网络管理的路由方法的反馈，使用基于设计的路由方法确定一个或多个业务需求的一个或多个路由来计算网络。

8. 发明授权

US07693422B2 Constraint-based design of optical transmission systems 有权
标题翻译：光传输系统的基于约束的设计
公开(公告)号：US07693422B2
公开(公告)日：2010-04-06
申请号：US10952015
申请日：2004-09-28
申请人： Mansoor Ali Khan Alicherry , Harsha S. Nagesh , Chitra A. Phadke , Viswanath Poosala
发明人： Mansoor Ali Khan Alicherry , Harsha S. Nagesh , Chitra A. Phadke , Viswanath Poosala
IPC分类号： H04B10/20
CPC分类号： H04B10/07955 , H04B10/2935
摘要： Techniques are disclosed for designing optical transmission systems that efficiently compute cost-optimal configurations under one or more constraints. For example, in one aspect of the present invention, a technique for designing an optical transmission system comprises the following steps/operations. A set of one or more demands and a set of optical transmission system elements are obtained. Elements may be consecutively coupled via a span. At least one constraint on the design of the optical transmission system is obtained. The at least one constraint comprises: (i) a signal loss in a span should not exceed a given maximum signal loss; (ii) a signal loss in a span should not exceed a given maximum signal loss and a span should be longer than a given minimum span length; (iii) a signal loss in a span should not exceed a given first maximum signal loss and a span should be longer than a given minimum span length, however, at most one in m contiguous spans can have a loss up to a given second maximum signal loss, wherein the second maximum signal loss is greater than the first maximum signal loss; or (iv) a signal loss in a span should not exceed a given maximum signal loss and a span should be longer than a given minimum span length, and an average span loss of any m consecutive spans should not exceed a given average loss, wherein the average loss is less than the given maximum signal loss. A least-cost configuration is then computed for the optical transmission system based on at least a portion of the set of one or more demands and the set of one or more optical transmission system elements such that the at least one constraint is satisfied.
摘要翻译：公开了用于设计在一个或多个约束下有效地计算成本最优配置的光传输系统的技术。例如，在本发明的一个方面，一种用于设计光传输系统的技术包括以下步骤/操作。获得一组一个或多个要求和一组光传输系统元件。元件可以通过跨度连续地耦合。获得了对光传输系统的设计的至少一个限制。所述至少一个约束包括：（i）跨度中的信号损失不应超过给定的最大信号损耗; （ii）跨度中的信号损失不应超过给定的最大信号损失，跨度应该长于给定的最小跨距长度; （iii）跨度中的信号损失不应超过给定的第一最大信号损失，并且跨度应该长于给定的最小跨度长度，然而，最多一个m个连续跨度可以具有高达给定的第二最大值的损耗信号丢失，其中所述第二最大信号损失大于所述第一最大信号损耗; 或（iv）跨度中的信号损失不应超过给定的最大信号损失，并且跨度应该长于给定的最小跨度长度，并且任何m个连续跨度的平均跨度损失不应超过给定的平均损耗，其中平均损耗小于给定的最大信号损失。然后，基于一个或多个需求集合的至少一部分和一个或多个光传输系统元件的集合来计算光传输系统的最小成本配置，使得满足至少一个约束。

9. 发明授权

US07565148B2 Methods and apparatus for design of wireless networks to aid in location identification of mobile units 有权
标题翻译：用于无线网络设计的方法和设备，以帮助移动单元的位置识别
公开(公告)号：US07565148B2
公开(公告)日：2009-07-21
申请号：US11463034
申请日：2006-08-08
申请人： Mansoor Ali Khan Alicherry , Harsha S. Nagesh , Chitra Phadke , Viswanath Poosala
发明人： Mansoor Ali Khan Alicherry , Harsha S. Nagesh , Chitra Phadke , Viswanath Poosala
IPC分类号： H04W40/00
CPC分类号： H04W4/02 , H04W64/00
摘要： Techniques and systems for designing a network providing communication and location identification services are described. A solution point comprising parameters for each of a plurality of base stations is generated. A coverage and locatability performance value for the solution point is computed, as well as derivatives of the performance value. The coverage and locatability performance value and its derivatives are used to indicate favorable directions for searching for subsequent solution points, and subsequent solution points are generated and compared against previous solution points until an optimum solution point is found. The coverage and locatability performance value is a weighted sum of coverage and locatability values for each point in the service area of the network, with coverage values representing forward and reverse link quality and locatability values representing the probability that a point will experience an acceptable power level from at least four base stations.
摘要翻译：描述了用于设计提供通信和位置识别服务的网络的技术和系统。生成包括多个基站中的每一个的参数的解点。计算解点的覆盖率和可定位性能值，以及性能值的导数。覆盖和定位性能值及其导数用于指示搜索后续求解点的有利方向，并生成后续求解点，并与先前的解点进行比较，直到找到最优解点为止。覆盖率和可定位性能值是网络服务区域中每个点的覆盖率和可定位性值的加权和，覆盖值表示前向链路质量和反向链路质量以及表示点将经受可接受功率级别的概率的可定位值至少有四个基站。

10. 发明授权

US07835271B2 Signaling protocol for p-cycle restoration 有权
标题翻译：用于p周期恢复的信令协议
公开(公告)号：US07835271B2
公开(公告)日：2010-11-16
申请号：US11321549
申请日：2005-12-29
申请人： Mansoor Ali Khan Alicherry , Peter Hessler , Viswanath Poosala , Walter Rothkegel , Sudipta Sengupta
发明人： Mansoor Ali Khan Alicherry , Peter Hessler , Viswanath Poosala , Walter Rothkegel , Sudipta Sengupta
IPC分类号： G01R31/08
CPC分类号： H04J14/0227 , H04J3/085 , H04J14/0284 , H04J14/0291 , H04J2203/006 , H04L12/437
摘要： Improved p-cycle restoration techniques using a signaling protocol are disclosed. For example, a technique for use in at least one node of a data communication network for recovering from a failure, wherein the data communication network includes multiple nodes and multiple links for connecting the multiple nodes, comprises the following steps/operations. Notification of the failure is obtained at the at least one node. A determination is made whether the failure is a single link failure or one of a node failure and a multiple link failure. A pre-configured protection cycle (p-cycle) plan is implemented when the failure is a single link failure but not when the failure is one of a node failure and a multiple link failure, such that two independent paths in the network are not connected when implementing the pre-configured protection cycle plan. Implementation of the pre-configured protection cycle plan may further comprise the node sending at least one message to another node in the data communication network and/or receiving at least one message from another node in the data communication network.
摘要翻译：公开了使用信令协议的改进的p循环恢复技术。例如，一种在数据通信网络的至少一个节点中用于从故障中恢复的技术，其中数据通信网络包括多个节点和用于连接多个节点的多个链路，包括以下步骤/操作。在至少一个节点处获得故障的通知。确定故障是单个链路故障还是节点故障和多个链路故障之一。当故障是单个链路故障时，实施预配置的保护周期（p周期）计划，但是当故障是节点故障和多个链路故障之一时，则不实现，这样网络中的两个独立路径不连接在实施预先配置的保护周期计划时。预先配置的保护周期计划的实施还可以包括节点向数据通信网络中的另一节点发送至少一个消息和/或从数据通信网络中的另一个节点接收至少一个消息。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式