会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
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
    • 6. 发明申请
    • METHOD AND APPARATUS FOR DISTRIBUTED BANDWIDTH ASSIGNMENT IN MESH BACKHAUL NETWORKS
    • 网格反向网络中分布式带宽分配的方法与装置
    • US20080151833A1
    • 2008-06-26
    • US11613457
    • 2006-12-20
    • Kadathur S. Natarajan
    • Kadathur S. Natarajan
    • H04Q7/00
    • H04W28/12H04L47/10H04L47/14H04W84/22H04W92/20
    • A system for distributing bandwidth in a mesh network includes a first access point (AP1) that determines an amount of data to be sent from the first access point to the second access point (AP2) and receives a value indicating an amount of data to be received from the second access point. The first access point (AP1) then determines a percentage of a frame (I) to be used to send the data from the first access point to the second access point by multiplying the total data-carrying portion (206, 210) of the frame (I) by the amount of data to be sent from the first access point to the second access point divided by the sum of the amount of data to be sent from the first access point to the second access point and the amount of data to be received from the second access point.
    • 用于在网状网络中分配带宽的系统包括:第一接入点(AP 1),其确定要从第一接入点发送到第二接入点(AP 2)的数据量,并接收指示数据量的值 从第二接入点接收。 第一接入点(AP1)然后通过将总数据携带部分(206,210)乘以第一接入点(AP1)来确定要用于将数据从第一接入点发送到第二接入点的帧(I)的百分比, 帧(I)通过从第一接入点发送到第二接入点的数据量除以将从第一接入点发送到第二接入点的数据量之和和数据量到 从第二个接入点接收。
    • 9. 发明授权
    • Admission control system and method in space-based mobile
telecommunication system
    • 天基移动通信系统中的接入控制系统和方法
    • US5826169A
    • 1998-10-20
    • US533125
    • 1995-09-25
    • Kadathur S. Natarajan
    • Kadathur S. Natarajan
    • H04B7/185
    • H04B7/18558
    • The call admission control method provides guaranteed bandwidth connections in a mobile telecommunication networks (10) that have varying topology and dynamic capacities. Method (100) provides a systematic way to decide when to admit connection requests in a low-earth or medium-earth orbit based satellite telecommunication system (10). A call admission controller, located in a ground control station (40) receives a connection request from an earth station (50) that may be forwarded from a satellite (21) in a constellation (20) of satellites. The call admission controller segments a call holding time into a sequence of time segments and determines whether a path exists through the network (10) that has the required minimum bandwidth for each of the time segments. If such a path exists, the connection request is admitted and the call goes through. Otherwise, the call is denied and communication is blocked.
    • 呼叫接纳控制方法在具有变化的拓扑和动态容量的移动电信网络(10)中提供有保证的带宽连接。 方法(100)提供一种系统的方式来决定何时在低地球或中等地球轨道的卫星电信系统(10)中接纳连接请求。 位于地面控制站(40)中的呼叫许可控制器从卫星的星座(20)中的卫星(21)接收来自地球站(50)的连接请求。 呼叫接纳控制器将呼叫保持时间分成时间序列,并且确定是否存在通过网络(10)存在的每个时间段具有所需最小带宽的路径。 如果存在这样的路径,则连接请求被允许并且呼叫通过。 否则,呼叫被拒绝,通信被阻止。