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

1. 发明授权

US08533272B2 Method and apparatus for notification and delivery of messages to mobile PC users 有权
标题翻译：用于向移动PC用户通知和传递消息的方法和装置
公开(公告)号：US08533272B2
公开(公告)日：2013-09-10
申请号：US11668800
申请日：2007-01-30
申请人： Mansoor Ali Khan Alicherry , Mary S. Chan , Sanjay D. Kamat , Pramod V. N. Koppol , Sunder Rathnavelu Raj , Dimitrios Stiliadis
发明人： Mansoor Ali Khan Alicherry , Mary S. Chan , Sanjay D. Kamat , Pramod V. N. Koppol , Sunder Rathnavelu Raj , Dimitrios Stiliadis
IPC分类号： G06F12/14
CPC分类号： H04L12/12 , H04L51/24 , H04L51/38 , H04W4/12 , H04W52/0229 , H04W52/0274 , Y02D70/1222 , Y02D70/1224 , Y02D70/1242 , Y02D70/1244 , Y02D70/142 , Y02D70/168
摘要： The invention includes a method and apparatus for notification and delivery of messages to mobile users using a secure client associated with a user device. The secure client includes a power module, a communication module, a storage module, and an alert module. The power module powers the client device independent of a power state of the user device. The communication module receives a wake-up message and responsively triggers the secure client to switch from an inactive state to an active state without changing the power state of the user device, initiates a secure connection with a secure gateway in response to the wake-up message, and requests and receives a user message from a messaging application using the secure connection. The storage module stores the received message independent of the power state of the user device. The alert module activates an alert to indicate that the message is available.
摘要翻译：本发明包括一种用于使用与用户设备相关联的安全客户端向移动用户通知和传递消息的方法和装置。安全客户端包括电源模块，通信模块，存储模块和警报模块。电源模块独立于用户设备的电源状态为客户端设备供电。通信模块接收到唤醒消息，并响应于触发安全客户端从非活动状态切换到活动状态，而不改变用户设备的电源状态，响应唤醒启动与安全网关的安全连接消息，并使用安全连接从消息应用程序请求并接收用户消息。存储模块存储接收到的消息，而与用户设备的功率状态无关。警报模块激活警报以指示消息可用。

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. 发明授权

US07643469B2 Method for channel assignment and routing for multi-radio wireless mesh networks 有权
标题翻译：多无线电无线网状网络的信道分配和路由方法
公开(公告)号：US07643469B2
公开(公告)日：2010-01-05
申请号：US11325060
申请日：2006-01-04
申请人： Mansoor Ali Khan Alicherry , Randeep S. Bhatia , Li Li
发明人： Mansoor Ali Khan Alicherry , Randeep S. Bhatia , Li Li
IPC分类号： H04L12/28
CPC分类号： H04W72/082 , H04W28/10 , H04W72/12
摘要： A methodology for making joint channel and routing assignments in multi-radio wireless mesh networks that takes into account interference constraints, the number of channels in a network and the number of radio available at each mesh router, and maximizes bandwidth allocation subject to fairness constraints. In particular, the methodology provides for routing, channel assignment and link scheduling in multi-radio mesh wireless networks utilizing a constant factor approximation technique that models the interference and fairness constraints and is able to account for the number of radios at each of the wireless nodes of a wireless mesh network.
摘要翻译：一种在多无线电无线网状网络中进行联合信道和路由分配的方法，其考虑到干扰约束，网络中的信道数量和每个网状路由器可用的无线电数量，并且根据公平约束最大化带宽分配。特别地，该方法提供了利用恒定因子近似技术的多无线电网状无线网络中的路由，信道分配和链路调度，其对干扰和公平约束进行建模，并且能够考虑每个无线节点处的无线电的数量的无线网状网络。

4. 发明授权

US07619990B2 Two tiered packet labeling for data network traceback 有权
标题翻译：用于数据网络追溯的两个分层分组标签
公开(公告)号：US07619990B2
公开(公告)日：2009-11-17
申请号：US11480015
申请日：2006-06-30
申请人： Mansoor Ali Khan Alicherry , Vijay Pochampalli Kumar , Govindarasu Manimaran , Muthuprasanna Muthusrinivasan
发明人： Mansoor Ali Khan Alicherry , Vijay Pochampalli Kumar , Govindarasu Manimaran , Muthuprasanna Muthusrinivasan
IPC分类号： H04L12/28
CPC分类号： H04L45/04 , H04L45/64 , H04L49/55 , H04L63/1458 , H04L2463/146
摘要： Disclosed is a two tier packet labeling technique for use in connection with network traceback in a network having multiple autonomous systems, with routers and other network resources within each autonomous system. Tier 1 labels are assigned at the autonomous system level, and tier 2 labels are assigned at the router level. In order to reduce the number of labels that are required, a technique called logical partitioned coloring may be used, in which certain autonomous systems and border routers may be logically partitioned into a plurality of mesh connected nodes, and the labels are assigned to these mesh-connected nodes. During network operation the network routers store either tier 1 or tier 2 labels in data packets. The determination of whether to store a label in any particular packet, and the determination of which label to store, may be determined probabilistically by the network router.
摘要翻译：公开了一种在具有多个自治系统的网络中与在每个自治系统内具有路由器和其他网络资源的网络追溯相结合的两层分组标签技术。在自治系统级分配一级标签，在路由器级别分配二层标签。为了减少所需的标签的数量，可以使用称为逻辑分区着色的技术，其中某些自主系统和边界路由器可以被逻辑地分割成多个网状连接节点，并且标签被分配给这些网格连接的节点。在网络运行期间，网络路由器将层1或层2标签存储在数据包中。可以由网络路由器概率地确定是否在任何特定分组中存储标签以及确定要存储的标签。

5. 发明申请

US20080002725A1 Two tiered packet labeling for data network traceback 有权
标题翻译：用于数据网络追溯的两个分层分组标签
公开(公告)号：US20080002725A1
公开(公告)日：2008-01-03
申请号：US11480015
申请日：2006-06-30
申请人： Mansoor Ali Khan Alicherry , Vijay Pochampalli Kumar , Govindarasu Manimaran , Muthuprasanna Muthusrinivasan
发明人： Mansoor Ali Khan Alicherry , Vijay Pochampalli Kumar , Govindarasu Manimaran , Muthuprasanna Muthusrinivasan
IPC分类号： H04L12/56
CPC分类号： H04L45/04 , H04L45/64 , H04L49/55 , H04L63/1458 , H04L2463/146
摘要： Disclosed is a two tier packet labeling technique for use in connection with network traceback in a network having multiple autonomous systems, with routers and other network resources within each autonomous system. Tier 1 labels are assigned at the autonomous system level, and tier 2 labels are assigned at the router level. In order to reduce the number of labels that are required, a technique called logical partitioned coloring may be used, in which certain autonomous systems and border routers may be logically partitioned into a plurality of mesh connected nodes, and the labels are assigned to these mesh-connected nodes. During network operation the network routers store either tier 1 or tier 2 labels in data packets. The determination of whether to store a label in any particular packet, and the determination of which label to store, may be determined probabilistically by the network router.
摘要翻译：公开了一种在具有多个自治系统的网络中与在每个自治系统内具有路由器和其他网络资源的网络追溯相结合的两层分组标签技术。在自治系统级分配一级标签，在路由器级别分配二层标签。为了减少所需的标签的数量，可以使用称为逻辑分区着色的技术，其中某些自主系统和边界路由器可以被逻辑地分割成多个网状连接节点，并且标签被分配给这些网格连接的节点。在网络运行期间，网络路由器将层1或层2标签存储在数据包中。可以由网络路由器概率地确定是否在任何特定分组中存储标签以及确定要存储的标签。

6. 发明授权

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.
摘要翻译：公开了负载均衡网络架构中单故障保护的技术。例如，在本发明的一个方面，一种用于处理包括多个节点的通信网络中的业务流的技术，该业务流可经由一个或多个中间节点从源节点传送到至少一个目的地节点，包括以下步骤/操作。业务流在源节点分割成多个部分。部件被分配到相应的中间节点，使得部件以不相交的方式从源节点路由到至少一个目的地节点。

7. 发明授权

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.
摘要翻译：提供网络路由和设计技术。一种用于确定网络中的需求的路由的技术，其中所述网络包括主路径和次路径，并且至少两个辅路径可以共享给定链路，包括以下步骤/操作。首先，转换表示网络的图。图的边缘表示与路径相关联的信道，图中的节点表示网络的节点。执行转换，使得与边缘相关联的成本反映在次要路径中使用信道的成本。然后，在变换图中找到与需求对应的节点之间的最短路径。最短路径表示可以路由需求的网络中的最低成本路径。当上述路线确定步骤/操作导致具有至少一个循环的路径时，可以执行替代路由处理，以便确定需求的无衬底路径。此外，提供整数线性程序公式设计技术。

8. 发明授权

US07099670B2 Method and apparatus for design of wireless networks to aid in location identification of mobile units 有权
标题翻译：用于设计无线网络以辅助移动单元的位置识别的方法和装置
公开(公告)号：US07099670B2
公开(公告)日：2006-08-29
申请号：US10463284
申请日：2003-06-17
申请人： Mansoor Ali Khan Alicherry , Harsha Nagesh , Chitra Phadke , Viswanath Poosala
发明人： Mansoor Ali Khan Alicherry , Harsha Nagesh , Chitra Phadke , Viswanath Poosala
IPC分类号： H04Q7/20
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.
摘要翻译：描述了用于设计提供通信和位置识别服务的网络的技术和系统。生成包括多个基站中的每一个的参数的解点。计算解点的覆盖率和可定位性能值，以及性能值的导数。覆盖和定位性能值及其导数用于指示搜索后续求解点的有利方向，并生成后续求解点，并与先前的解点进行比较，直到找到最优解点为止。覆盖和可定位性能值是网络服务区域中每个点的覆盖率和可定位性值的加权和，覆盖值表示前向链路质量和反向链路质量以及表示点将经受可接受功率级别的概率的可定位值至少有四个基站。

9. 发明授权

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路由），从而可以设计最佳网络。用于设计网络的自动化技术可以包括以下步骤。首先，获得一个或多个交通需求。然后，基于基于基于网络管理的路由方法的反馈，使用基于设计的路由方法确定一个或多个业务需求的一个或多个路由来计算网络。

10. 发明授权

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个连续跨度的平均跨度损失不应超过给定的平均损耗，其中平均损耗小于给定的最大信号损失。然后，基于一个或多个需求集合的至少一部分和一个或多个光传输系统元件的集合来计算光传输系统的最小成本配置，使得满足至少一个约束。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式