CONTENT DELIVERY
    1.
    发明申请
    CONTENT DELIVERY 审中-公开
    内容交付

    公开(公告)号:WO2012042230A8

    公开(公告)日:2012-12-27

    申请号:PCT/GB2011001436

    申请日:2011-09-30

    CPC classification number: H04L65/607 H04L65/4084

    Abstract: A method for providing equitable media streaming between an HTTP server and a number of receivers via shared network. The streaming data is processed to split the data across a number of sub-streams. Each sub-stream contains non-contiguous data. A receiver requesting the streaming media establishes a number of TCP sessions, one for each sub-stream and the received sub-stream data is reassembled at the receiver so that the streaming media can be presented.

    Abstract translation: 一种通过共享网络在HTTP服务器和多个接收器之间提供公平媒体流的方法。 处理流数据以在多个子流上分割数据。 每个子流都包含非连续的数据。 请求流媒体的接收器建立多个TCP会话,每个子流一个,并且在接收器处重新组装接收到的子流数据,以便可以呈现流媒体。

    A METHOD FOR DELIVERING VIDEO CONTENT ENCODED AT ONE OR MORE QUALITY LEVELS OVER A DATA NETWORK
    2.
    发明申请
    A METHOD FOR DELIVERING VIDEO CONTENT ENCODED AT ONE OR MORE QUALITY LEVELS OVER A DATA NETWORK 审中-公开
    一种在数据网络中传送一个或多个质量级别的视频内容的方法

    公开(公告)号:WO2012085504A1

    公开(公告)日:2012-06-28

    申请号:PCT/GB2011/001742

    申请日:2011-12-20

    Abstract: A client device receives streamed encoded content data, such as encoded video data, which has been encoded at a constant perceptual quality. Several different versions of the content are available to be streamed to the device, at different perceptual quality levels. In order to decide which quality level to request from a content server at intervals the device calculates the delivery rates that would be required for each level of quality. The calculation of the delivery levels is made in dependence on whether the actual delivery rate that has been received so far is greater than or less than a constant bit rate delivery schedule that decreases monotonically but which guarantees to deliver the encoded data in a timely manner such that no buffer underflow and interruption of reproduction takes place. The monotonically decreasing bit rate schedule is defined by one or more "critical points", which are the points at which the bit rates are decreased, and correspond to the points where the delivery schedule is just equal to the decoding schedule of the encoded data. At such points there would be no encoded data in a buffer at the client. If the delivery rate has been greater than the constant bit rate schedule for a quality then the delivery rate required going forward for a particular quality level can be calculated from the critical point information, and no more complicated calculation is required.

    Abstract translation: 客户端设备接收已经以恒定感知质量编码的流编码内容数据,例如编码视频数据。 在不同的感知质量水平下,可以将多种不同版本的内容流式传输到设备。 为了从内容服务器间隔决定要求哪个质量等级,设备会计算每个质量级别所需的传送速率。 交付水平的计算取决于目前已经收到的实际交货率是否大于或小于单调减少但是保证以及时方式递送编码数据的恒定比特率传送计划 没有发生缓冲区下溢和中断再现。 单调递减的比特率调度由一个或多个“临界点”定义,其是比特率降低的点,并且对应于传送调度恰好等于编码数据的解码调度的点。 在这样的点上,在客户端的缓冲器中将不存在编码数据。 如果传送速率大于质量的恒定比特率调度,则可以从临界点信息计算特定质量水平所需的传送速率,并且不需要更复杂的计算。

    VIDEO STREAMING
    3.
    发明申请
    VIDEO STREAMING 审中-公开
    视频流

    公开(公告)号:WO2010100427A1

    公开(公告)日:2010-09-10

    申请号:PCT/GB2010000390

    申请日:2010-03-04

    Abstract: A video sequence to be encoded is divided into a plurality of temporal portions, and analysed to determine (at least for each portion after the first), in accordance with a plurality of encoding quality settings, (i) a quality metric for the portion and (ii) the number of bits generated by encoding the portion at that quality setting. These data are analysed, for example using a Viterbi-like trellis, to choose a set of quality settings, one per portion, that tends to minimise a combined quality cost for the sequence. This the combined quality cost is the sum of individual quality costs each of which is a function of the quality metric of the respective encoded portion. The sequence is encoded using the chosen quality settings. In order to determine each individual quality cost, despite not knowing precisely what network throughput will be available at any given time in the future, one proceeds by estimating receiver buffer fullness and its standard deviation. From said estimates, the probability of buffer underflow and or overflow is obtained, the individual quality costs being a function also of the underflow and/or overflow probability.

    Abstract translation: 要编码的视频序列被划分为多个时间部分,并且根据多个编码质量设置进行分析以确定(至少对于第一个之后的每个部分),(i)该部分的质量度量,以及 (ii)通过对该质量设置处的部分进行编码而产生的比特数。 分析这些数据,例如使用类似维特比的网格来选择一组质量设置,每一部分趋向于使序列的组合质量成本最小化。 这样,组合质量成本是每个质量成本的总和,每个质量成本是相应编码部分的质量度量的函数。 序列使用所选的质量设置进行编码。 为了确定每个单独的质量成本,尽管不知道将来在任何给定时间内什么网络吞吐量将可用,但是通过估计接收器缓冲器充满度及其标准偏差来进行。 从所述估计,获得缓冲器下溢和溢出的概率,个体质量成本也是下溢和/或溢出概率的函数。

    DATA TRANSMISSION
    4.
    发明申请
    DATA TRANSMISSION 审中-公开
    数据传输

    公开(公告)号:WO2010092323A2

    公开(公告)日:2010-08-19

    申请号:PCT/GB2010/000163

    申请日:2010-02-01

    CPC classification number: H04L65/80 H04L47/10 H04L47/122 H04L47/17

    Abstract: There is proposed a modification to the ECN protocol to remove the one-to-one relationship between the network signalling congestion and the sender response to that congestion. The result is to allow a receiver terminal to exhibit some control of bandwidth share relative to other receiver terminals. The idea is to filter the congestion experienced (CE) markings arriving at a receiver such that they do not correspond directly with the setting of the ECN echo (ECE) flag in acknowledgement packets sent back to the sender. In particular, the idea is to skip a specific number of CE markings such that fewer than normal acknowledgement packets with ECE flags set are sent back to the sender. This gives the receiver some control over the frequency of congestion window reduction (CWR) events at the sender and thus exhibit some control on the transmission rate from the sender.

    Abstract translation: 提出了对ECN协议的修改以消除网络信令拥塞与对该拥塞的发送者响应之间的一对一关系。 结果是允许接收机终端相对于其他接收机终端表现出对带宽共享的一些控制。 这个想法是对到达接收机的拥塞经验(CE)标记进行过滤,使得它们不直接与发送回发送方的确认分组中的ECN回显(ECE)标志的设置相对应。 特别地,该思想是跳过特定数量的CE标记,使得具有设置ECE标志的正常的确认分组的发送回发送给发送方。 这给接收机一些控制发送方拥塞窗口缩减(CWR)事件的频率,从而对发送方的传输速率进行一些控制。

    METHOD OF CONTROLLING A TELECOMMUNICATIONS NETWORK
    5.
    发明申请
    METHOD OF CONTROLLING A TELECOMMUNICATIONS NETWORK 审中-公开
    控制电信网络的方法

    公开(公告)号:WO1994023543A1

    公开(公告)日:1994-10-13

    申请号:PCT/GB1994000601

    申请日:1994-03-23

    CPC classification number: H04M3/36 H04Q3/0091 H04Q3/66

    Abstract: A method of controlling a telecommunications network in which local exchanges (1) are connected to a network of trunk exchanges (6) via one or more parent trunk exchanges (3, 4). The method provides a network traffic management system (NTMS) which detects focused overloads at parent trunk exchanges (3, 4) and, rather than applying call restriction to the parent trunk exchange (3, 4) itself, applies call restriction to one or more of the other trunk exchanges (6) in the network, known as far-end trunk exchanges. This arrangement can allow added flexibility in the way call restriction is applied. For instance, cases arise when certain routes (7) into a parent trunk exchange (3, 4) contribute more than others to a focused overload. It may then be preferable to apply call restriction in relation to a route which is inversely proportional to that route's contribution to be focused overload.

    Abstract translation: 一种控制电信网络的方法,其中本地交换机(1)经由一个或多个父中继交换机(3,4)连接到中继交换机(6)的网络。 该方法提供一种网络流量管理系统(NTMS),它检测父中继交换机(3,4)的聚焦过载,而不是向父中继交换机(3,4)应用呼叫限制,对一个或多个 的网络中的其他中继交换机(6),被称为远端中继交换机。 这种安排可以允许以应用呼叫限制的方式增加灵活性。 例如,当某些路由(7)进入父中继交换机(3,4)时,会出现一些重点超载的情况。 因此,优选地应用与路由成比例的路由相关的呼叫限制,该路由成为聚焦过载的贡献。

    VIDEO STREAMING OVER DATA NETWORKS
    6.
    发明申请
    VIDEO STREAMING OVER DATA NETWORKS 审中-公开
    视频流过数据网络

    公开(公告)号:WO2012085505A1

    公开(公告)日:2012-06-28

    申请号:PCT/GB2011/001743

    申请日:2011-12-20

    Abstract: A client device receives streamed encoded content data, such as encoded video data, which has been encoded at a constant perceptual quality. Several different versions of the content are available to be streamed to the device, at different perceptual quality levels. In order to decide which quality level to request from a content server at intervals the device calculates the delivery rates that would be required for each level of quality. The delivery rates are calculated in dependence on so-called critical points, which are points at which a piecewise constant bit rate delivery schedule is just equal to the decoding schedule. There are two classes of critical points, being a first class of critical points, referred to herein as "additional critical points", which are points on the decoding schedule where, for any particular other point on the decoding schedule before an additional critical point, and assuming that a minimum threshold amount of data is buffered when delivery occurs from the particular point, a constant bit rate delivery schedule that is calculated for the particular point taking into account the buffered minimum amount of data and of such a rate such that buffer underflow does not occur is substantially equal to the decoding schedule. A second class of critical points, referred to herein as "downstairs critical points", is also defined, which are derived from the decoding schedule as a whole, and which are the points at which a piecewise monotonically decreasing constant bit rate delivery schedule (the so-called "downstairs" schedule), which is calculated such that when delivering the encoded content data from the start buffer underflow does not occur, is substantially equal to the decoding schedule of the encoded content data. When the actual delivery rate received is ahead of the so-called "downstairs" schedule, then the delivery rate required for a particular quality level can be calculated from the second class of critical points. However, when the actual delivery rate received is behind the downstairs schedule, then the delivery rate required is calculated from the first class of critical points.

    Abstract translation: 客户端设备接收已经以恒定感知质量编码的流编码内容数据,例如编码视频数据。 在不同的感知质量水平下,可以将多种不同版本的内容流式传输到设备。 为了从内容服务器间隔决定要求哪个质量等级,设备会计算每个质量级别所需的传送速率。 递送率根据所谓的临界点计算,所述临界点是分段恒定比特率传送调度恰好等于解码调度的点。 有两类临界点,作为关键点的第一类,这里称为“附加关键点”,这些是解码调度的要点,对于在额外临界点之前的解码调度上的任何特定的其他点, 并且假设当从特定点发送时缓冲最小阈值量的数据,考虑到所缓冲的最小数据量以及使得缓冲器下溢的特定点计算的恒定比特率传送调度 不发生基本上等于解码时间表。 还定义了第二类关键点,这里称为“楼下关键点”,它们是从整体上的解码进度得出的,它们是分段单调递减的恒定比特率传送时间表( 被计算为所谓的“楼下”时间表),使得当不发生来自起始缓冲器下溢的编码内容数据时,基本上等于编码内容数据的解码调度。 当收到的实际交货率超过所谓的“楼下”时间表时,可以从第二类关键点计算特定质量水平所需的交货率。 然而,当收到的实际交货率落后于楼下的时间表时,所需的交货率是从第一类关键点计算的。

    MODIFICATIONS OF EXPLICIT CONGESTION NOTIFICATION (ECN) BY SKIPPING CONGESTION EXPERIENCED (CE) EVENTS
    8.
    发明申请
    MODIFICATIONS OF EXPLICIT CONGESTION NOTIFICATION (ECN) BY SKIPPING CONGESTION EXPERIENCED (CE) EVENTS 审中-公开
    通过实践经验(CE)活动对显示意向通知(ECN)的修改

    公开(公告)号:WO2010092323A3

    公开(公告)日:2010-12-23

    申请号:PCT/GB2010000163

    申请日:2010-02-01

    CPC classification number: H04L65/80 H04L47/10 H04L47/122 H04L47/17

    Abstract: There is proposed a modification to the ECN protocol to remove the one-to-one relationship between the network signalling congestion and the sender response to that congestion. The result is to allow a receiver terminal to exhibit some control of bandwidth share relative to other receiver terminals. The idea is to filter the congestion experienced (CE) markings arriving at a receiver such that they do not correspond directly with the setting of the ECN echo (ECE) flag in acknowledgement packets sent back to the sender. In particular, the idea is to skip a specific number of CE markings such that fewer than normal acknowledgement packets with ECE flags set are sent back to the sender. This gives the receiver some control over the frequency of congestion window reduction (CWR) events at the sender and thus exhibit some control on the transmission rate from the sender.

    Abstract translation: 提出了对ECN协议的修改以消除网络信令拥塞与对该拥塞的发送者响应之间的一对一关系。 结果是允许接收机终端相对于其他接收机终端表现出对带宽共享的一些控制。 这个想法是对到达接收机的拥塞经验(CE)标记进行过滤,使得它们不直接与发送回发送方的确认分组中的ECN回显(ECE)标志的设置相对应。 特别地,该思想是跳过特定数量的CE标记,使得具有设置ECE标志的正常的确认分组的发送回发送给发送方。 这给接收机一些控制发送方拥塞窗口缩减(CWR)事件的频率,从而对发送方的传输速率进行一些控制。

    CONTROLLING BANDWIDTH SHARE
    9.
    发明申请
    CONTROLLING BANDWIDTH SHARE 审中-公开
    控制带宽分享

    公开(公告)号:WO2010092324A2

    公开(公告)日:2010-08-19

    申请号:PCT/GB2010000166

    申请日:2010-02-02

    CPC classification number: H04L47/10 H04L45/24 H04L47/122 H04L47/193

    Abstract: There is proposed a modification to the ECN protocol to remove the one-to-one relationship between the network signalling congestion and the sender response to that congestion. The result is to allow a receiver terminal to exhibit some control of bandwidth share relative to other receiver terminals. The idea is to calculate the average CE arrival frequency from received data packets and to set ECE flags at a rate determined as a function of the average CE arrival frequency. Preferably, the function is a multiplier applied to the average CE arrival frequency. The effect of averaging the CE arrival frequency as well as application of a multiplier is a decoupling of the ECE marked ACKs sent by a receiver to the sender, and control of the resulting transmission rate at the sender.

    Abstract translation: 提出了对ECN协议的修改,以消除网络信令拥塞和发送者对拥塞的响应之间的一对一关系。 其结果是允许接收器终端相对于其他接收器终端展现一些带宽份额的控制。 这个想法是从接收到的数据包中计算平均CE到达频率,并按照平均CE到达频率的函数确定的速率设置ECE标志。 优选地,该函数是应用于平均CE到达频率的乘数。 平均CE到达频率以及应用乘法器的效果是将由接收器发送给发送器的ECE标记的ACK解耦,并控制发送器处所得到的传输速率。

    COMPACT CUMULATIVE BIT CURVES
    10.
    发明申请
    COMPACT CUMULATIVE BIT CURVES 审中-公开
    紧凑的累积位曲线

    公开(公告)号:WO2012110764A1

    公开(公告)日:2012-08-23

    申请号:PCT/GB2012/000160

    申请日:2012-02-16

    Abstract: Embodiments of the present invention provide a compact representation of a cumulative bit curve formed from piecewise straight line approximations between upper and lower bounds about an actual cumulative bit curve (CBC). In one embodiment the lower bounds are found by applying a constraint such that if a delivery rate was to be calculated using the count at the lower bound it would result in a delivery rate which was greater than the delivery rate that would be calculated using the actual CBC data by a particular amount, for example 10 %. The actual CBC data is then used as an upper bound. As a result, the approximated CBC will lie for each GoP between the actual CBC value and the lower bound, with the result that one can be certain that any data rate that is calculated using the approximation will be at least as high as a data rate that is calculated using the actual CBC data. In terms of line- fitting algorithms that are used, several different algorithms may be used of differing complexities, with the intention of trying to minimise the number of end-points required of within the piecewise approximation.

    Abstract translation: 本发明的实施例提供了一种由关于实际累积位曲线(CBC)的上下界之间的分段直线逼近形成的累积位曲线的紧凑表示。 在一个实施方案中,通过应用约束来发现下限,使得如果使用下限的计数来计算递送率,则将导致递送率大于使用实际值计算的递送率 CBC数据按特定数量,例如10%。 然后将实际的CBC数据用作上限。 因此,近似的CBC将适用于实际CBC值和下限之间的每个GoP,结果可以确定使用近似计算的任何数据速率将至少与数据速率一样高 这是使用实际的CBC数据计算的。 在所使用的线拟合算法方面,可以使用不同复杂度的几种不同的算法,其目的是试图使分段近似中所需的端点的​​数量最小化。

Patent Agency Ranking