Automatic division of internet protocol radio access networks to interior gateway protocol areas
    53.
    发明授权
    Automatic division of internet protocol radio access networks to interior gateway protocol areas 有权
    将互联网协议无线电接入网络自动划分到内部网关协议区域

    公开(公告)号:US09313663B2

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

    申请号:US14465210

    申请日:2014-08-21

    Abstract: A network component to partition an Internet Protocol (IP) Radio Access Network (RAN) network. The network component may be configured to find one or more rings and one or more chains. The rings and/or the chains may be used to find one or more ring clusters. The network component may be configured to divide one or more of the ring clusters if they exceed a network node threshold number of network nodes. The network node may form a plurality of interior gateway protocol (IGP) areas using the ring clusters. The plurality of IGP areas may be refined based on a network node threshold and an aggregate site gateway (ASG) node threshold.

    Abstract translation: 用于分配因特网协议(IP)无线电接入网络(RAN)网络的网络组件。 网络组件可以被配置为找到一个或多个环和一个或多个链。 环和/或链可用于找到一个或多个环簇。 网络组件可以被配置为如果它们超过网络节点阈值数量的网络节点,则划分环集群中的一个或多个。 网络节点可以使用环集群形成多个内部网关协议(IGP)区域。 可以基于网络节点阈值和聚合站点网关(ASG)节点阈值来细化多个IGP区域。

    Light-Weight Fork Channels for Clustering
    55.
    发明申请
    Light-Weight Fork Channels for Clustering 有权
    用于聚类的轻便叉通道

    公开(公告)号:US20160057053A1

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

    申请号:US14464871

    申请日:2014-08-21

    Applicant: Red Hat, Inc.

    Abstract: A method for light-weight fork channels for clustering is disclosed. The method includes receiving, by a processing device, a message at a main channel used for group communication between processes executed by the processing device, identifying a fork channel identifier (ID) and a fork stack ID in a header of the message, processing the message with a fork stack corresponding to the fork stack ID in the header of the message, the fork stack comprising a subset of protocols of a main protocol stack of the main channel, and providing the message to a fork channel corresponding to the fork channel ID, wherein the fork channel to utilize the fork stack to separate messages for the fork channel from the main channel.

    Abstract translation: 公开了一种用于聚类的轻量级叉通道的方法。 该方法包括:处理装置接收用于由处理装置执行的处理之间的组通信的主信道的消息,在消息的报头中识别叉信道标识符(ID)和叉堆栈ID,处理 消息具有对应于消息头部中的叉堆栈ID的叉堆栈,叉堆栈包括主信道的主协议栈的协议的子集,并将消息提供给与叉信道ID相对应的分支信道 ,其中所述叉通道利用所述叉堆以将所述叉通道的消息与所述主通道分离。

    METHOD OF MESSAGE ROUTING FOR A DISTRIBUTED COMPUTING SYSTEM
    60.
    发明申请
    METHOD OF MESSAGE ROUTING FOR A DISTRIBUTED COMPUTING SYSTEM 有权
    分布式计算系统的消息路由方法

    公开(公告)号:US20150350079A1

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

    申请号:US14693385

    申请日:2015-04-22

    Abstract: Message routing is implemented by a computer device. A global ring is connected via a network, wherein the global ring is associated with a distributed hash table (DHT) and includes a plurality of nodes which are divided exclusively into groups in advance. A first group of nodes is determined from the plurality of grouped nodes. Using the DHT for a message to be routed, a first node is located from the first group of nodes, as a routing destination.

    Abstract translation: 消息路由由计算机设备实现。 通过网络连接全局环,其中全局环与分布式哈希表(DHT)相关联,并且包括预先划分成组的多个节点。 从多个分组节点确定第一组节点。 将DHT用于要路由的消息,第一个节点位于第一组节点作为路由目的地。

Patent Agency Ranking