会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 56. 发明授权
    • Paging schemes for local network access
    • 本地网络访问的寻呼方案
    • US08824305B2
    • 2014-09-02
    • US12498797
    • 2009-07-07
    • Fatih UlupinarParag A. AgasheRajarshi Gupta
    • Fatih UlupinarParag A. AgasheRajarshi Gupta
    • H04W52/00H04W68/02
    • H04W52/00H04W52/0216H04W68/00H04W68/02H04W84/027Y02D70/1222Y02D70/1242Y02D70/1262Y02D70/142Y02D70/146
    • Paging and power consumption are managed in conjunction with providing local breakout in a wireless wide area network. In some aspects, if a packet destined for an access terminal is received at an access point that provides local breakout, the access point may inform the network so that the network will cause the access point to page the access terminal. Alternatively, in some aspects an access point that provides local breakout may maintain idle context of the access terminal, whereby the access point may autonomously page the access terminal (i.e., without involving the core network). In some aspects local breakout traffic is filtered at an access point to reduce the number of pages or packets sent to an access terminal. In some aspects an indication of a packet type is provided with a page message to enable an access terminal to determine whether to receive the packet. In some aspects a local link interface may be selectively disabled or enabled to limit traffic at an access terminal.
    • 分页和功耗与无线广域网中的本地突围一起进行管理。 在一些方面,如果在提供本地突围的接入点处接收到目的地为接入终端的分组,则接入点可以通知网络,使得网络将使接入点寻呼接入终端。 或者,在一些方面,提供本地突围的接入点可以保持接入终端的空闲上下文,由此接入点可以自主地寻址接入终端(即,不涉及核心网络)。 在一些方面,本地突围流量在接入点被过滤以减少发送到接入终端的页面或分组的数量。 在一些方面,分组类型的指示被提供有页面消息,以使得接入终端能够确定是否接收分组。 在一些方面,可以选择性地禁用或启用本地链路接口来限制接入终端的业务。
    • 57. 发明授权
    • Transmission of control information across multiple packets
    • 跨多个数据包传输控制信息
    • US08605584B2
    • 2013-12-10
    • US12829168
    • 2010-07-01
    • Nikolai Konrad Nepomucceno LeungFatih UlupinarGerardo Giaretta
    • Nikolai Konrad Nepomucceno LeungFatih UlupinarGerardo Giaretta
    • H04L12/26
    • H04L47/10H04L1/0056H04L1/0079H04L47/35
    • Techniques for sending control information in the header of multiple packets are described. The techniques may allow more control information to be sent using a small number of overhead bits per packet. In one design, a first node (e.g., a network entity) may determine control information to send to a second node (e.g., a UE or another network entity). The first node may send the control information in the header of multiple packets toward the second node. In one design, the control information may include congestion information indicative of traffic congestion at the first node. The congestion information may be sent using Explicit Congestion Notification (ECN) bits in the header of IP packets. The first node may send the control information with or without coding and for all packets or a specific data flow. The first node may also send a synchronization sequence prior to the control information.
    • 描述用于在多个分组的报头中发送控制信息的技术。 这些技术可以允许使用每个分组的少量开销比特来发送更多的控制信息。 在一种设计中,第一节点(例如,网络实体)可以确定要向第二节点(例如,UE或另一网络实体)发送的控制信息。 第一节点可以向多个分组的头部向第二节点发送控制信息。 在一种设计中,控制信息可以包括指示第一节点处的交通拥堵的拥塞信息。 可以使用IP分组报头中的显式拥塞通知(ECN)位来发送拥塞信息。 第一节点可以发送具有或不具有编码的控制信息以及针对所有分组或特定数据流。 第一节点还可以在控制信息之前发送同步序列。
    • 58. 发明授权
    • Delay and backhaul-efficient paging method and apparatus
    • 延迟和回传效率的寻呼方法和设备
    • US08588788B2
    • 2013-11-19
    • US12985323
    • 2011-01-05
    • Peerapol TinnakornsrisuphapFatih UlupinarParag Arun Agashe
    • Peerapol TinnakornsrisuphapFatih UlupinarParag Arun Agashe
    • H04W36/00
    • H04W48/17H04W60/04H04W68/04
    • Described herein is methodologies for efficient utilization of backhaul resources of a network for delivering paging data to an access terminal (AT) without sacrificing delay performance. A location that buffers data for an AT can be adaptively changed based on factors such as the location of the AT, applications utilized by the AT, and a recent activity level of the AT. To facilitate this determination, an AT can be configured with one or more registration boundaries. An AT can be configured with a small registration radius such that if the AT does not move outside of the small registration radius, data can be delivered directly to a data attachment point for the AT. If the AT moves outside of the small registration radius, the registration radius can be switched to a large registration radius and the access gateway can instead locally buffer data for the AT.
    • 这里描述了用于有效利用网络的回程资源的方法,用于在不牺牲延迟性能的情况下将寻呼数据传送到接入终端(AT)。 可以基于诸如AT的位置,AT使用的应用以及AT的最近的活动级别等因素自适应地改变缓冲AT的数据的位置。 为了便于确定,AT可以配置一个或多个注册边界。 AT可以被配置为具有小的注册半径,使得如果AT不移动到小注册半径之外,则可以将数据直接传送到AT的数据连接点。 如果AT移动到小注册半径之外,则注册半径可以切换到大的注册半径,而接入网关可以代替本地缓冲AT的数据。
    • 59. 发明授权
    • Recursive header compression for relay nodes
    • 中继节点的递归头压缩
    • US08588227B2
    • 2013-11-19
    • US12789311
    • 2010-05-27
    • Jiwoong LeeFatih UlupinarXiaolong Huang
    • Jiwoong LeeFatih UlupinarXiaolong Huang
    • H04L12/28H04J3/18G06F15/16
    • H04L29/06
    • Systems and methodologies are described that facilitate compressing multiple headers in wireless communication networks that utilize relay nodes. Relay nodes and/or other access points can insert headers in packets related to routing the packets. The multiple headers can be compressed at a transmitter and decompressed at a receiver to save bandwidth over a radio interface. Recursive compression and/or decompression can be utilized at least in part by recursively calling a compression/decompression engine or context, such that no modification is required of the engine or context. The recursive compression/decompression can compress and/or decompress packet headers until a certain type of header is reached (or a certain type of header is no longer found in the packet), according to a tunnel depth, according to newly defined compression and/or decompress profiles, and/or the like.
    • 描述了有助于压缩利用中继节点的无线通信网络中的多个报头的系统和方法。 中继节点和/或其他接入点可以在与路由分组相关的分组中插入报头。 可以在发射机处压缩多个报头,并在接收机处进行解压缩以通过无线电接口节省带宽。 可以至少部分地通过递归地调用压缩/解压缩引擎或上下文来使用递归压缩和/或解压缩,使得不需要对引擎或上下文进行修改。 递归压缩/解压缩可以根据隧道深度根据新定义的压缩和/或压缩来压缩和/或解压缩分组报头,直到达到特定类型的报头(或者在分组中不再发现某种类型的报头) 或解压缩简档,和/或类似物。