会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Dynamic sharing of wireless resources among different communication networks
    • 不同通信网络之间无线资源的动态共享
    • US08509788B2
    • 2013-08-13
    • US11683719
    • 2007-03-08
    • Kadathur S. NatarajanDaniel J. CoombesWilliam A Payne, III
    • Kadathur S. NatarajanDaniel J. CoombesWilliam A Payne, III
    • H04W40/00H04W72/00H04W74/00H04B7/00
    • H04W16/14H04L47/11H04L47/14
    • Various embodiments are described to enable multiple, independent communication networks to share in an autonomous and dynamic manner unlicensed wireless resources. Generally, this involves determining that a first network node (122) is using at least a portion of a wireless resource to provide network service to at least one remote unit (102). A second network node (123), under the control of a different network operator than the first node and desiring to use the wireless resource, sends the first network node, a request to relinquish use of at least a portion of the wireless resource. The second network node sends this request wirelessly, perhaps using the wireless resource itself. If the first network node grants the request, the second node may then begin using at least a portion of the relinquished resource to provide network service.
    • 描述了各种实施例以使得多个独立的通信网络以自主和动态方式共享非授权无线资源。 通常,这涉及确定第一网络节点(122)正在使用无线资源的至少一部分来向至少一个远程单元(102)提供网络服务。 第二网络节点(123)在与第一节点不同的网络运营商的控制下并且希望使用无线资源的情况下,发送第一网络节点,放弃使用无线资源的至少一部分的请求。 第二个网络节点可以无线地发送此请求,也许使用无线资源本身。 如果第一网络节点授权请求,则第二节点可以开始使用放弃资源的至少一部分来提供网络服务。
    • 4. 发明授权
    • Communications network and method which implement diversified routing
    • 实现多元化路由的通信网络和方法
    • US5608721A
    • 1997-03-04
    • US415800
    • 1995-04-03
    • Kadathur S. NatarajanKatta G. Murty
    • Kadathur S. NatarajanKatta G. Murty
    • H04Q3/66H04Q11/04
    • H04Q3/66
    • A communications network (20) includes any number of moving switching nodes (30) and a route-determining node (28). The route-determining node (28) performs an off-line procedure (58) to define a-priori routing for the entire network. This procedure (58) is performed repetitively to track switching node (30) movement and to define routing for numerous epochs included in a planning period. The procedure (58) includes a process (86) for determining all shortest path routes between all possible origination and destination switching nodes (30). Another process (84) matches predicted call traffic for a subject epoch with the shortest path routes. Another process (88) generates routing code tables (54) in response to the predicted call traffic matched to shortest path routes. This process (88) assigns logical routing IDs (52) to physically distinct, shortest path routes in proportion to the predicted call traffic allocated to the distinct routes.
    • 通信网络(20)包括任何数量的移动交换节点(30)和路线确定节点(28)。 路由确定节点(28)执行离线过程(58)以定义整个网络的先验路由。 重复地执行该过程(58)以跟踪切换节点(30)移动,并且定义包括在规划周期中的多个历元的路由。 过程(58)包括用于确定所有可能的发起和目的地交换节点(30)之间的所有最短路径路由的过程(86)。 另一个过程(84)将主体时期的预测呼叫业务与最短路径路由进行匹配。 响应于与最短路径路由匹配的预测呼叫业务,另一进程(88)生成路由代码表(54)。 该过程(88)将逻辑路由ID(52)分配给与分配给不同路由的预测呼叫流量成比例的物理上不同的最短路径路由。
    • 5. 发明授权
    • Hybrid backtrack/lookahead search technique for constraint-satisfaction
problems
    • 用于约束满足问题的混合回溯/前瞻搜索技术
    • US5228115A
    • 1993-07-13
    • US835010
    • 1992-02-12
    • Kadathur S. Natarajan
    • Kadathur S. Natarajan
    • G06Q10/04
    • G06Q10/04
    • A method of solving a constraint-satisfaction problem with a data processor includes the steps of (a) providing a search tree structure (10) representing a plurality (N) of variables (X), the search tree structure having a plurality of levels; (b) searching (L) shallow levels of the search tree structure by employing a backtrack search method wherein (L) is less than or equal to a specified value H; and (c) searching (M) remaining, deeper, levels of the search tree structure by employing a lookahead search method. The step of searching (L) shallow levels of the search tree structure includes a step of binding a set of X.sub.1 through X.sub.H variables each to an element from its domain such that no constraints are violated. The step of searching (M) remaining, deeper, levels of the search tree structure includes the steps of, given the bindings for the set of variables X.sub.1 through X.sub.H, determining for each variable X.sub.i, H
    • 一种解决数据处理器的约束满足问题的方法包括以下步骤:(a)提供表示多个(N)个变量(X)的搜索树结构(10),所述搜索树结构具有多个级别; (b)通过采用其中(L)小于或等于指定值H的回溯搜索方法来搜索(L)搜索树结构的浅层级; 和(c)通过采用前瞻搜索方法搜索(M)搜索树结构的剩余,更深层次。 搜索(L)搜索树结构的浅层级的步骤包括将一组X1到XH变量各自绑定到来自其域的元素的步骤,使得不会违反约束。 搜索(M)搜索树结构的剩余,更深层次的步骤包括以下步骤:给定该组变量X1至XH的绑定,确定每个变量Xi,H
    • 9. 发明授权
    • Communication network and method which respond to a failed link
    • 响应故障链路的通信网络和方法
    • US5581543A
    • 1996-12-03
    • US395229
    • 1995-02-27
    • Kadathur S. Natarajan
    • Kadathur S. Natarajan
    • H04B1/74H04L12/56H04Q3/66H04J3/14
    • H04Q3/665H04B1/745H04L45/00H04L45/28H04L45/48
    • A communications network (20) includes a constellation (30) of any number of moving switching nodes and a route-determining node (28). The route-determining node (28) performs an off-line procedure (58) to define a-priori routing for the entire network for a planning period. When a link (40) fails, the switching nodes (30) terminating the link (40) implement an interim rerouting procedure (78). The route-determining node (28) then operates in a failure response mode to quickly devise updated routing definitions. In the failure response mode route trees (110) which include the failed link (40') are identified. Shortest path routes for nodes (30) isolated by the link failure are revised to omit the failed link (40'). Shortest path routes for non-isolated nodes (30) and in route trees which do not include the failed link are not changed.
    • 通信网络(20)包括任意数量的移动交换节点的星座(30)和路由决定节点(28)。 路由确定节点(28)执行离线过程(58)以在规划周期内为整个网络定义先验路由。 当链路(40)发生故障时,终止链路(40)的交换节点(30)实现临时重路由过程(78)。 然后,路由确定节点(28)以故障响应模式操作,以快速设计更新的路由定义。 在故障响应模式中,识别包括故障链路(40')的路由树(110)。 通过链路故障隔离的节点(30)的最短路径路径被修改以省略故障链路(40')。 非隔离节点(30)和不包括故障链路的路由树中的最短路径路由不会改变。