Enhanced procedure to compute LFAs with IGP max metric
    51.
    发明授权
    Enhanced procedure to compute LFAs with IGP max metric 有权
    用IGP最大度量计算LFA的增强过程

    公开(公告)号:US09407534B2

    公开(公告)日:2016-08-02

    申请号:US14288211

    申请日:2014-05-27

    摘要: A method and implementing system calculates a loop free alternative (LFA) next hop as a backup for a primary path next hop for an interior gateway protocol (IGP). The method enables consideration of the LFA next hop where a link to the next hop has a reverse cost that has a maximum value. The method includes selecting a next candidate next hop from a set of candidate next hops in the network, checking whether a link to the next candidate next hop is an administratively allowable link, and checking whether the link has a maximum forward cost. The method further checks whether the link is bi-directional and computes the LFA using the next candidate next hop where the link is administratively allowable link, where the link does not have a maximum forward cost and where the link is bi-directional without consideration of reverse cost of the link.

    摘要翻译: 一种方法和实现系统计算无循环替代(LFA)下一跳作为内部网关协议(IGP)的主路径下一跳的备份。 该方法能够考虑到下一跳的链路具有最大值的反向成本的LFA下一跳。 该方法包括从网络中的一组候选下一跳中选择下一候选下一跳,检查到下一候选下一跳的链路是否是可管理允许的链路,以及检查该链路是否具有最大的前向成本。 该方法进一步检查链路是否是双向的,并且使用下一个候选下一跳计算LFA,其中该链路是管理上允许的链路,其中链路不具有最大的前向成本,并且该链路是双向的而不考虑 反向成本的链接。

    Determining the need for a routing area update for packet switched handover in multi-operator core network
    52.
    发明授权
    Determining the need for a routing area update for packet switched handover in multi-operator core network 有权
    确定在多运营商核心网络中对分组交换切换的路由区域更新的需要

    公开(公告)号:US09380502B2

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

    申请号:US14095828

    申请日:2013-12-03

    IPC分类号: H04W36/00 H04W36/12 H04W36/14

    摘要: A method implemented by a MS for controlling handover of the MS from a source cell of a source RAN operating in PS domain to a target cell of a target RAN operating in PS domain where the target RAN supports MOCN. The method includes receiving SI transmitted by a node of the source RAN. The SI includes a selected PLMN, LAC of the target cell, and RAC of the target cell. The MS executes handover to the target RAN. A target RAI is determined using the selected PLMN, LAC of the target cell, and RAC of the target cell from the SI transmitted by the node of the source RAN. The target RAI is compared to a registered RAI of the MS. The MS determines whether a RAU is needed in the target RAN based on the comparison of the target RAI to the registered RAI.

    摘要翻译: 一种由MS实现的方法,用于控制MS从在PS域中操作的源RAN的源小区到目标RAN支持MOCN的PS域中操作的目标RAN的目标小区的切换。 该方法包括接收由源RAN的节点发送的SI。 SI包括所选择的PLMN,目标小区的LAC和目标小区的RAC。 MS执行到目标RAN的切换。 使用目标小区的所选PLMN,LAC和来自源RAN的节点发送的SI的目标小区的RAC来确定目标RAI。 将目标RAI与MS的注册RAI进行比较。 基于目标RAI与注册RAI的比较,MS确定目标RAN中是否需要RAU。

    Alternate method to give operators flexibility to choose LFAs
    53.
    发明授权
    Alternate method to give operators flexibility to choose LFAs 有权
    给予操作员灵活选择LFAs的替代方法

    公开(公告)号:US09313117B2

    公开(公告)日:2016-04-12

    申请号:US14288338

    申请日:2014-05-27

    摘要: The method and system to computes an LFA next hop as a backup for a primary path next hop that enables an administrator to control LFA selection for a given destination node using a tag and a weight. The method includes checking whether an interface of a next candidate node has a tag with a tag value matching a tag value of a primary SPF path for the destination node. The method further includes checking whether the destination node has any LFA, checking whether a stored tag differs from the tag value of the primary SPF path, and checking whether the interface of the next candidate node is preferred based on a comparison of a weight values, and replacing a stored LFA for the destination node with the next candidate node. Where conditions are met a stored LFA is replaced with the next candidate node.

    摘要翻译: 用于计算LFA下一跳作为主路径下一跳的备份的方法和系统,其使得管理员能够使用标签和权重来控制给定目的地节点的LFA选择。 该方法包括:检查下一个候选节点的接口是否具有标签值,该标签值与目标节点的主SPF路径的标签值相匹配。 该方法还包括检查目的地节点是否具有任何LFA,检查存储的标签是否与主SPF路径的标签值不同,以及基于权重值的比较来检查下一个候选节点的接口是否是优选的, 并用下一个候选节点替换目的节点的存储的LFA。 在满足条件的情况下,存储的LFA被替换为下一个候选节点。

    Bitstream processing using coalesced buffers and delayed matching and enhanced memory writes
    55.
    发明授权
    Bitstream processing using coalesced buffers and delayed matching and enhanced memory writes 有权
    使用合并缓冲区和延迟匹配和增强存储器写入的位流处理

    公开(公告)号:US09203887B2

    公开(公告)日:2015-12-01

    申请号:US13994129

    申请日:2011-12-23

    IPC分类号: H04L29/06 H04W28/06 H03M7/30

    摘要: Methods and apparatus for processing bitstreams and byte streams. According to one aspect, bitstream data is compressed using coalesced string match tokens with delayed matching. A matcher is employed to perform search string match operations using a shortened maximum string length search criteria, resulting in generation of a token stream having data and literal data. A distance match operation is performed on sequentially adjacent tokens to determine if they contain the same distance data. If they do, the len values of the tokens are added through use of a coalesce buffer. Upon detection of a distance non-match, a final coalesced length of a matching string is calculated and output along with the prior matching distance as a coalesced token. Also disclosed is a scheme for writing variable-length tokens into a bitstream under which token data is input into a bit accumulator and written to memory (or cache to be subsequently written to memory) as each token is processed in a manner that eliminates branch mispredict operations associated with detecting whether the bit accumulator is full or close to full.

    摘要翻译: 用于处理比特流和字节流的方法和装置。 根据一个方面,使用具有延迟匹配的合并字符串匹配令牌来压缩比特流数据。 使用匹配器来执行搜索字符串匹配操作,使用缩短的最大字符串长度搜索条件,导致生成具有数据和文字数据的令牌流。 对顺序相邻的令牌执行距离匹配操作,以确定它们是否包含相同的距离数据。 如果这样做,令牌的len值通过使用合并缓冲区来添加。 在检测到距离不匹配时,计算匹配串的最终合并长度,并将其与先前匹配距离一起作为合并令牌输出。 还公开了一种用于将可变长度令牌写入比特流的方案,在该比特流中,令牌数据被输入到比特累加器中,并且以消除分支错误预测的方式将每个令牌进行处理,并将其写入存储器(或高速缓存以随后写入存储器) 检测位累加器是满或接近满的操作。

    Congestion control in packet data networking
    56.
    发明授权
    Congestion control in packet data networking 有权
    分组数据网络中的拥塞控制

    公开(公告)号:US09197562B2

    公开(公告)日:2015-11-24

    申请号:US14659391

    申请日:2015-03-16

    摘要: A network element controls congestion in a link of a packet data network. A congested link is identified and a throttle rate is determined for one or more of the traffic groups traversing the congested link. The central controller determines the throttle rates using a weight of the group and the current traffic rate of the group through the link. The throttle rates are sent to switches to throttle traffic for each affected group.

    摘要翻译: 网络元件控制分组数据网络的链路中的拥塞。 识别出拥塞的链路,并且针对穿过拥塞的链路的一个或多个业务组确定节流速率。 中央控制器使用组的权重和通过链路的组的当前流量速率来确定节流率。 油门速度被发送到交换机以遏制每个受影响组的流量。

    Denial of service prevention in a software defined network
    57.
    发明授权
    Denial of service prevention in a software defined network 有权
    在软件定义的网络中拒绝服务预防

    公开(公告)号:US09172651B2

    公开(公告)日:2015-10-27

    申请号:US14181347

    申请日:2014-02-14

    摘要: A method in a controller module is described for allocating rate-limiting meters to a plurality of network elements (NEs) of a software defined network (SDN). The method includes receiving a plurality of rate limit indicators, from one or more network destinations, for a plurality of flows of data that arrive at the network destinations; sending one or more meter installation messages to cause a plurality of meter entries corresponding to the plurality of rate limit indicators to be installed by one or more of the NEs according to a metering configuration that is determined by, for each of the flows, selecting a flow of the plurality of flows that has not been selected yet and that traverses a path in the SDN having a fewest number of the plurality of NEs, and selecting a NE from the path that the selected flow traverses to have a meter entry installed.

    摘要翻译: 描述了控制器模块中的一种方法,用于将速率限制表分配给软件定义网络(SDN)的多个网元(NE)。 该方法包括从一个或多个网络目的地接收多个到达网络目的地的多个数据流的速率限制指示符; 发送一个或多个仪表安装消息,使得与所述多个速率限制指示符相对应的多个计费表项由一个或多个NE根据计量配置来安装,所述计量配置由每个流量确定, 还没有选择的多个流的流程,并且遍历具有多个NE的最少数量的SDN中的路径,并且从所选择的流程所经过的路径中选择一个具有安装了计费器条目的NE。

    Systems and methods for protecting symmetric encryption keys
    58.
    发明授权
    Systems and methods for protecting symmetric encryption keys 有权
    用于保护对称加密密钥的系统和方法

    公开(公告)号:US09135450B2

    公开(公告)日:2015-09-15

    申请号:US13996453

    申请日:2011-12-21

    摘要: Systems and methods for protecting symmetric encryption keys when performing encryption are described. In one embodiment, a computer-implemented method includes retrieving at least one real key from a secure area and executing, with a processor, a key transform instruction to generate at least one transformed key based on receiving the at least one real key. The at least one transformed key is an encrypted version of at least one round key that is encrypted by the processor using the at least one real key. The processor is able to decrypt the at least one transformed key and encrypt the at least one round key.

    摘要翻译: 描述在执行加密时保护对称加密密钥的系统和方法。 在一个实施例中,计算机实现的方法包括从安全区域检索至少一个真实密钥,并且利用处理器执行密钥变换指令,以基于接收所述至少一个真实密钥来生成至少一个变换密钥。 至少一个变换密钥是由处理器使用至少一个真实密钥加密的至少一个循环密钥的加密版本。 处理器能够对至少一个变换的密钥进行解密并加密至少一个循环密钥。

    Multi-objective server placement determination
    59.
    发明授权
    Multi-objective server placement determination 有权
    多目标服务器放置确定

    公开(公告)号:US09083757B2

    公开(公告)日:2015-07-14

    申请号:US13684125

    申请日:2012-11-21

    发明人: Ying Zhang Du Li

    IPC分类号: H04L29/08 H04L12/24

    摘要: Methods and apparatus for determining recommended geographic server locations for online social networks by attempting to minimize user-server latency and inter-user communications latency. In an embodiment, geographic and relationship information for a plurality of users is acquired. The plurality of users may belong to one or more networks. The acquired information is transformed into a graph. A first plurality of clusters is generated with a first clustering algorithm. A second plurality of clusters is generated by iteratively examining pairs of the first plurality clusters, and swapping nodes between the examined clusters if it will reduce a total cut weight of the graph and locate each pair of nodes within a defined maximum distance from the centroid of the target cluster. In an embodiment, a method uses a joint analysis approach based upon characteristics of a plurality of existing networks.

    摘要翻译: 通过尝试最小化用户服务器延迟和用户间通信延迟来确定在线社交网络的推荐地理服务器位置的方法和装置。 在一个实施例中,获取多个用户的地理和关系信息。 多个用户可以属于一个或多个网络。 所获取的信息被转换为图形。 利用第一聚类算法生成第一多个簇。 通过迭代地检查第一多个聚类的对以及交换所检查的群集之间的节点来生成第二个多个群集,如果它将减少该图形的总切割权重,并且将每对节点定位在与 目标群集。 在一个实施例中,一种方法使用基于多个现有网络的特征的联合分析方法。

    System and method for implementing privacy classes within an authentication framework
    60.
    发明授权
    System and method for implementing privacy classes within an authentication framework 有权
    在认证框架内实现隐私类的系统和方法

    公开(公告)号:US09083689B2

    公开(公告)日:2015-07-14

    申请号:US13730791

    申请日:2012-12-28

    IPC分类号: H04L29/06

    摘要: A system, apparatus, method, and machine readable medium are described for implementing privacy classes within an authentication framework. For example, one embodiment of a method comprises: transmitting a query for client information from a server to a client, the client information including information related to authentication devices coupled to the client; analyzing the query to determine an appropriate privacy class to be used for providing client information to the server; providing a subset of client information selected based on the determined privacy class, the subset of client information including the information related to the authentication devices coupled to the client; and using the subset of client information within an authentication framework to provide user authentication services over a network.

    摘要翻译: 描述了用于在认证框架内实现隐私级别的系统,装置,方法和机器可读介质。 例如,一种方法的一个实施例包括:将客户机信息的查询从服务器发送到客户端,所述客户端信息包括与耦合到客户端的认证设备相关的信息; 分析查询以确定用于向服务器提供客户端信息的适当的隐私类; 提供基于所确定的隐私等级选择的客户端信息的子集,所述客户端信息的子集包括与耦合到所述客户端的认证设备相关的信息; 以及在认证框架内使用客户端信息的子集来通过网络提供用户认证服务。