公开(公告)号：US09699797B2

公开(公告)日：2017-07-04

申请号：US14886972

申请日：2015-10-19

Applicant: Telefonaktiebolaget L M Ericsson (PUBL)

Inventor： Stefan Rommer ,  Dirk Kopplin ,  Hans Rönneke ,  John Stenfelt

IPC: H04W80/04 ,  H04W88/06 ,  H04L29/06 ,  H04L12/64 ,  H04L12/70 ,  H04L12/54 ,  H04W72/08 ,  H04W76/02 ,  H04M15/00 ,  H04W72/04 ,  H04W28/02

CPC classification number: H04W72/087 ,  H04M15/66 ,  H04W28/0226 ,  H04W28/26 ,  H04W36/0022 ,  H04W36/0044 ,  H04W72/0453 ,  H04W76/15 ,  H04W76/18 ,  H04W88/06

Abstract: A method for providing access feedback when a User Equipment, UE, with an established a connection over multiple accesses towards a Gateway, GW, initiates a set-up of a new service for a service session. The method comprises a step where the GW or a Policy and Charging Rules Function, PCRF, initiates a Quality of Service, QoS, resource reservation as a response of the set-up of the new service initiated by the UE. The GW or the PCRF in the QoS resource reservation selects a first access as present access.The method is particularly characterized in a step where the UE rejects said first access as present access and sends a reject message to the GW, wherein the GW or the PCRF as a result of the reject message initiates a new QoS resource reservation selecting a second access as present access.

公开(公告)号：US09674117B2

公开(公告)日：2017-06-06

申请号：US14849011

申请日：2015-09-09

Applicant: Istvan Vadasz

Inventor： Istvan Vadasz

IPC: H04L12/28 ,  H04L12/56 ,  H04L12/933 ,  H04L12/54 ,  H04L12/931 ,  H04L12/70

CPC classification number: H04L49/1584 ,  H04L12/5601 ,  H04L49/40 ,  H04L2012/5674

Abstract: The present invention relates to a computing apparatus as an element of a network structure using a method for acquiring and maintaining cell locked data transfer amongst a number of computing apparatuses. A predefined number of symbols transmitted as a cell is followed by a variable number of idle symbols to ensure the nominally simultaneous start of the cell transfers throughout the network without a central control. At specific positions of the cells each computing apparatus broadcasts a list of its transmission requests and receiver capabilities to all other computing apparatuses. Each of the interconnected computing apparatuses executes the same arbitration procedure based on the identical data set of transmission requests and receiver capabilities. As a result transmission paths are assigned for direct transmission and for payload forwarding. The transmission paths can be assigned per cell period individually for both directions of each link.

公开(公告)号：US09621453B1

公开(公告)日：2017-04-11

申请号：US14013773

申请日：2013-08-29

Applicant: Google Inc.

Inventor： Ayaskant Pani ,  Shashidhar Rao Gandham

IPC: H04L12/70 ,  H04L12/751 ,  G06F15/173 ,  H04L12/707

CPC classification number: H04L47/22 ,  H04L45/24 ,  H04L45/42

Abstract: Exemplary embodiments identify all viable paths in an ECMP/WCMP enabled network without running traceroute multiple times. Devices in a network may be configured to send a packet including a pre-determined option to an Software-Defined Network Controller (SDNC) upon receipt. If a destination of the packet is within the SDNC-controlled domain, SDNC identifies all viable ECMP/WCMP paths using routing information of the network. If the destination of the packet is outside the SDNC-controlled domain, SDNC identifies at least one egress switch of the SDNC-controlled domain. SDNC may identify internal paths connecting the source of the packet to the at least one egress switch. SDNC may also identify external paths connecting the at least one egress switch to the destination of the packet. SDNC may construct the viable ECMP/WCMP paths by connecting the internal paths to the external paths.

公开(公告)号：US09608921B2

公开(公告)日：2017-03-28

申请号：US13972397

申请日：2013-08-21

Applicant: Google Inc.

Inventor： Nicholas Wormley ,  Ryan Brase ,  Justin F. Chapweske

IPC: G06F15/16 ,  H04L12/825 ,  H04L12/801 ,  H04N21/234 ,  H04N21/2343 ,  H04N21/43 ,  H04N21/44 ,  H04N21/61 ,  H04L12/70

CPC classification number: H04L47/25 ,  H04L47/10 ,  H04L2012/5682 ,  H04N21/23424 ,  H04N21/23439 ,  H04N21/4307 ,  H04N21/44016 ,  H04N21/6125

Abstract: The invention provides for a download agent executing on a computing device to dynamically select between media files with different media quality for delivery of media content provided by a media content provider. The download agent may select between different media files with similar content but different quality based on a playback rate of the media file, the resolution of the media file, or the encoding scheme of the media file. The download agent may seamlessly transition from one media file to another media file at key frames to avoid any motion artifacts and to avoid requiring a user to restart the media file.

公开(公告)号：US09591639B2

公开(公告)日：2017-03-07

申请号：US13901185

申请日：2013-05-23

Applicant: Wi-LAN, Inc.

Inventor： Ofer Zimmerman ,  Kenneth L. Stanwood ,  Brian Spinar ,  Yair Bourlas ,  Amir Serok

IPC: H04W28/20 ,  H04W72/04 ,  H04Q11/04 ,  H04W16/02 ,  H04W72/08 ,  H04L12/70 ,  H04W28/14 ,  H04W88/08

CPC classification number: H04W16/02 ,  H04L2012/5607 ,  H04L2012/561 ,  H04Q11/0478 ,  H04W28/14 ,  H04W72/0413 ,  H04W72/042 ,  H04W72/0446 ,  H04W72/0453 ,  H04W72/0486 ,  H04W72/08 ,  H04W88/08

Abstract: A method and apparatus for allocating bandwidth in a broadband wireless communication system is disclosed. One embodiment uses a self-correcting bandwidth request/grant protocol. The self-correcting bandwidth request/grant protocol utilizes a combination of incremental and aggregate bandwidth requests. CPEs primarily transmit incremental bandwidth requests to their associated base stations, followed by periodic transmissions of aggregate bandwidth requests. The use of periodic aggregate bandwidth requests (that express the current state of their respective connection queues) allows the bandwidth allocation method and apparatus to be “self-correcting”. Another embodiment utilizes an abridged bandwidth request/grant protocol to allocate bandwidth. The abridged bandwidth request/grant protocol system utilizes padding packets to request a reduction in bandwidth allocation to a CPE. A base station modem alerts a base station CPU when the BS modem receives a padding packet from a CPE. After alerting the BS CPU the method can reduce the associated CPE's bandwidth allocation.

Abstract translation: 公开了一种用于在宽带无线通信系统中分配带宽的方法和装置。 一个实施例使用自校正带宽请求/授权协议。 自校正带宽请求/授权协议使用增量和聚合带宽请求的组合。 CPE主要向其相关联的基站发送增量带宽请求，随后是聚合带宽请求的周期性传输。 使用周期性聚合带宽请求（表示其相应连接队列的当前状态）允许带宽分配方法和装置“自校正”。 另一个实施例利用了一个节省带宽的请求/授权协议来分配带宽。 精简带宽请求/授权协议系统利用填充分组来请求减少对CPE的带宽分配。 当BS调制解调器从CPE接收填充分组时，基站调制解调器提醒基站CPU。 在提醒BS CPU之后，该方法可以减少相关CPE的带宽分配。

公开(公告)号：US09585077B2

公开(公告)日：2017-02-28

申请号：US14401494

申请日：2013-05-16

Applicant: The Hong Kong University of Science and Technology

Inventor： Shueng Han Gary Chan ,  Wa Lun Hong

IPC: H04W40/16 ,  H04L12/70 ,  H04L12/701 ,  H04W40/00 ,  H04L12/729 ,  H04L12/751 ,  H04W84/18

CPC classification number: H04W40/16 ,  H04L45/00 ,  H04L45/02 ,  H04L45/125 ,  H04L47/00 ,  H04W40/00 ,  H04W84/18

Abstract: Systems, methods and apparatus facilitating joint channel and routing assignment are provided. In some embodiments, a system includes nodes in a network configured to perform distributed joint channel and routing assignment of traffic through exchange of information with one another. The assignments are iteratively updated based on whether the update will result in an increase in a value of a function associated with throughput for traffic in the network. In some embodiments, the assignments are determined based on random decisions that are adopted if the function is improved utilizing the routing and channel information in the assignment. In some embodiments, the assignments are determined based on traffic prioritization in which destination nodes having a high level of traffic are assigned routes and channels having characteristics amenable to reduction of interference in the network.

Abstract translation: 提供了促进联合通道和路由分配的系统，方法和设备。 在一些实施例中，系统包括被配置为通过彼此交换信息来执行分布式联合信道和路由分配的网络中的节点。 基于更新是否会导致与网络中的流量的吞吐量相关联的功能的值的增加来迭代地更新分配。 在一些实施例中，如果使用分配中的路由和频道信息改进功能，则基于随机决策来确定分配。 在一些实施例中，基于业务优先级来确定分配，其中具有高流量级别的目的地节点被分配路由和具有适于减少网络中的干扰的特性的信道。

公开(公告)号：US09571364B2

公开(公告)日：2017-02-14

申请号：US14414338

申请日：2013-07-12

Applicant: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

Inventor： Panagiotis Saltsidis

IPC: H04L12/24 ,  H04L12/26 ,  H04L12/721 ,  H04L12/46 ,  H04L12/703 ,  H04L12/707 ,  H04L12/743 ,  H04L12/70

CPC classification number: H04L43/10 ,  H04L12/4641 ,  H04L41/0631 ,  H04L41/0866 ,  H04L43/0811 ,  H04L43/0823 ,  H04L45/12 ,  H04L45/123 ,  H04L45/16 ,  H04L45/24 ,  H04L45/28 ,  H04L45/7453 ,  H04L69/324 ,  H04L2012/5625 ,  H04L2012/5627

Abstract: Methods and apparatus are disclosed for monitoring a Maintenance Association (MA) for Connectivity Fault Management (CFM) in a network supporting Equal Cost Multiple Paths (ECMP). A set of ECMP paths is generated for sending data between endpoints in the network. Furthermore, a set of ECMP MAs is created that are used for monitoring the generated ECMP paths between the endpoints. The created set of ECMP MAs is subsequently used for sending monitoring packets. ECMP path MAs therefore conform to existing CFM operation and are compatible with both ECMP point to point path MAs and ECMP multipoint path MAs.

Abstract translation: 公开了用于在支持等成本多路径（ECMP）的网络中监视连接故障管理（CFM）的维护关联（MA）的方法和装置。 生成一组ECMP路径以在网络中的端点之间发送数据。 此外，创建了一组ECMP MA，用于监视端点之间生成的ECMP路径。 创建的ECMP MA集合随后用于发送监控数据包。 ECMP路径MA因此符合现有的CFM操作，并且与ECMP点对点路径MA和ECMP多点路径MA兼容。

公开(公告)号：US09565118B1

公开(公告)日：2017-02-07

申请号：US13115682

申请日：2011-05-25

Applicant: Donald Pannell

Inventor： Donald Pannell

IPC: H04L12/851 ,  H04L12/833 ,  H04L12/70

CPC classification number: H04L49/354 ,  H04J3/16 ,  H04L12/28 ,  H04L12/462 ,  H04L12/56 ,  H04L45/745 ,  H04L45/7453 ,  H04L47/24 ,  H04L47/2408 ,  H04L47/245 ,  H04L47/2458 ,  H04L47/6215 ,  H04L47/70 ,  H04L47/724 ,  H04L49/201 ,  H04L49/3027 ,  H04L49/90 ,  H04L2012/5638

Abstract: It is determined whether a packet is a management-type packet. When it is determined that the packet is a management-type packet, a queue is selected from a plurality of queues corresponding to different priorities, wherein the selected queue corresponds to a defined throughput and/or a defined latency. The packet is enqueued in the selected queue. The packet is transmitted via a port of the network device.

Abstract translation: 确定分组是否是管理类型的分组。 当确定分组是管理类型分组时，从对应于不同优先级的多个队列中选择队列，其中所选择的队列对应于定义的吞吐量和/或定义的等待时间。 数据包在所选队列中排队。 该分组通过网络设备的端口传输。

公开(公告)号：US09553620B2

公开(公告)日：2017-01-24

申请号：US14332920

申请日：2014-07-16

Applicant: Raytheon Company

Inventor： David Brent Wilson ,  Lee M. Savage ,  Loyra G. Dirzo

IPC: H04B3/46 ,  H04B17/00 ,  H04Q1/20 ,  H04B1/10 ,  H04L5/00 ,  G01S7/288 ,  G01S7/292 ,  H04L12/70

CPC classification number: H04B1/1018 ,  G01S7/288 ,  G01S7/292 ,  G01S2007/2886 ,  H04L5/006 ,  H04L2012/568

Abstract: A method and system for detecting and characterizing an input signal receive a signal having an in-phase (I) component and a quadrature-phase (Q) component. A first IQ sample of the signal is acquired at a first point in time, and a second IQ sample of the signal is acquired at a second point in time, Using one or more processors, a delayed complex conjugate multiply (DCM) is applied to the first IQ sample of the signal and the second IQ sample of the signal to produce a constant product having an in-phase (IC) component and a quadrature-phase (QC) component. A signal magnitude and a signal frequency are determined from the IC component of the constant and the QC component of the constant, using the one or more processors.

Abstract translation: 用于检测和表征输入信号的方法和系统接收具有同相（I）分量和正交相（Q）分量的信号。 在第一时间点获取信号的第一IQ采样，并且在第二时间点获取信号的第二IQ采样。使用一个或多个处理器将延迟复共轭乘法（DCM）应用于 信号的第一IQ采样和信号的第二IQ采样，以产生具有同相（IC）分量和正交相（QC）分量的恒定乘积。 使用一个或多个处理器，从常数的IC分量和常数的QC分量确定信号幅度和信号频率。

公开(公告)号：US09525622B2

公开(公告)日：2016-12-20

申请号：US14460935

申请日：2014-08-15

Applicant: Telefonaktiebolaget L M Ericsson (publ)

Inventor： Sriganesh Kini ,  Andrew Wilkinson

IPC: H04L12/723 ,  H04L12/26 ,  H04L12/70

CPC classification number: H04L45/50 ,  H04L43/00 ,  H04L45/507 ,  H04L2012/5625

Abstract: Exemplary methods for creating label stacks include creating and sending a first SR label stack for a data packet, wherein the first SR label stack causes the data packet to be forwarded through the SR network using a first set of links, and wherein the first SR label stack includes a first service label that identifies a first service to be applied to the data packet by a second network device. In one embodiment, the methods include creating and sending a second SR label stack for an operations administration and maintenance (OAM) packet, wherein the second SR label stack causes the OAM packet to be forwarded through the SR network using the first set of links, and wherein the second SR label stack prevents the second network device from applying the first service to the OAM packet.

Abstract translation: 用于创建标签堆栈的示例性方法包括为数据分组创建和发送第一SR标签堆栈，其中第一SR标签栈使得数据分组通过第一组链路通过SR网络转发，并且其中第一SR标签 堆栈包括标识由第二网络设备应用于数据分组的第一服务的第一服务标签。 在一个实施例中，所述方法包括为操作管理和维护（OAM）分组创建和发送第二SR标签栈，其中所述第二SR标签堆栈通过所述第一组链路使所述OAM分组通过所述SR网络转发， 并且其中所述第二SR标签栈防止所述第二网络设备将所述第一服务应用于所述OAM分组。