Method and apparatus for coping with link failures in central control plane architectures
    1.
    发明授权
    Method and apparatus for coping with link failures in central control plane architectures 有权
    用于应对中央控制平面架构中的链路故障的方法和装置

    公开(公告)号:US08619546B2

    公开(公告)日:2013-12-31

    申请号:US12858050

    申请日:2010-08-17

    IPC分类号: H04J3/14

    CPC分类号: H04L45/28 H04L45/22

    摘要: A capability for coping with link failures in central control plane architectures is provided. The capability for coping with link failures enables targeted reporting of link failures within the network in a manner that prevents flooding of link failure messages (LFMs) within the network. A method for reporting a failure of a link associated with a node includes detecting a failure of a link associated with the node, identifying an interface of the node associated with the failed link, identifying, from a flow table of the node, an ingress interface of the node via which a flow intended for the failed link is received, generating an LFM for the identified ingress interface, and sending the LFM via the identified ingress interface. A method for use at a local node having a flow table includes receiving an LFM indicative of a link failure detected at a remote node where the LFM includes a flow definition of a flow received at the remote node from the local node, identifying an interface of the local node via which the LFM is received, identifying from the flow table of the local node an ingress interface of the local node via which a flow intended for the failed link is received, generating a new LFM for the identified ingress interface of the node, and sending the new LFM via the identified ingress interface of the local node.

    摘要翻译: 提供了应对中央控制平面架构中的链路故障的能力。 应对链路故障的能力使得能够以防止网络内的链路故障消息(LFM)泛滥的方式有针对性地报告网络内的链路故障。 用于报告与节点相关联的链路的故障的方法包括检测与所述节点相关联的链路的故障,识别与所述故障链路相关联的所述节点的接口,从所述节点的流表中识别入口接口 通过其接收到用于故障链路的流的节点,为所识别的入口接口生成LFM,以及经由所识别的入口接口发送LFM。 一种在具有流表的本地节点上使用的方法包括:接收指示在远程节点处检测到的链路故障的LFM,其中LFM包括从本地节点在远程节点接收的流的流定义,识别 接收到LFM的本地节点,从本地节点的流表中识别本地节点的入口接口,通过该入口接口接收到用于故障链路的流,为所识别的节点的入口接口生成新的LFM ,并通过本地节点的标识的入口接口发送新的LFM。

    Balancing user registration lifetimes in a network
    2.
    发明授权
    Balancing user registration lifetimes in a network 有权
    平衡网络中的用户注册生命周期

    公开(公告)号:US08250210B2

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

    申请号:US12343608

    申请日:2008-12-24

    IPC分类号: G06F15/173

    CPC分类号: H04L65/1073 H04L65/80

    摘要: A method of balancing user registration lifetimes in a network is disclosed for smoothing the load of the registration server. The method of balancing user registration lifetimes in a network includes providing an initial registration lifetime for a registration request that is calculated using the time of the request and the previous history of registration requests, and in a particular embodiment, using the cumulative distribution function of the history of registration requests. The method of balancing user registration lifetimes in a network is particularly useful for handling spikes in registration traffic, and can accommodate user-specified variable lifetimes, as well dynamic user arrivals and departures. It provides effective load balancing over time for a single server, at the expense of a constant factor additive load per user, which can be amortized to near zero over the long run.

    摘要翻译: 公开了一种在网络中平衡用户登记寿命的方法,用于平滑注册服务器的负载。 在网络中平衡用户注册生命周期的方法包括为使用请求的时间和以前的注册请求的历史计算的注册请求提供初始登记生存期,并且在特定实施例中,使用 注册申请的历史。 在网络中平衡用户注册寿命的方法对于处理注册流量中的尖峰特别有用,并且可以适应用户指定的可变寿命以及动态的用户到达和离开。 它为单个服务器提供有效的负载平衡,以牺牲每个用户的常数因子添加负载为代价,长期以来可以将其平均分摊到接近零。

    CONTENT COLLABORATION AMONG HETEROGENEOUS DISTRIBUTED MEDIUMS
    3.
    发明申请
    CONTENT COLLABORATION AMONG HETEROGENEOUS DISTRIBUTED MEDIUMS 审中-公开
    异构分布式媒体内容协作

    公开(公告)号:US20120143695A1

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

    申请号:US12961833

    申请日:2010-12-07

    IPC分类号: G06Q30/00

    CPC分类号: G06Q30/0251 G06Q30/0269

    摘要: A system, an arrangement and a method for tracking viewership of regional billboards to collaborate billboard displays. Viewership is tracked using triggers that may be displayed with content and/or ads. Execution of the triggers may provide feedback to collaborate content/ads across billboards on a single medium or a number of heterogeneous media types to maximize cumulative viewership and advertising effectiveness. Triggers may be tailored to track the physical location of the billboard (in any display media), the time the billboard is displayed, and the identity of the content and/or ad. Data relating to the executed triggers includes identifying information of the viewer that executes the trigger to determine the success of the trigger. Following a determination of the success of the trigger, cumulative viewership of content, ads and triggers may be managed across billboards distributed across a region and across heterogeneous media.

    摘要翻译: 用于跟踪区域广告牌的收视合作广告牌显示的系统,安排和方法。 使用可能与内容和/或广告一起显示的触发器来跟踪观看次数。 触发器的执行可以提供反馈,以在单个媒体或多个异种媒体类型上的广告牌之间协作内容/广告,以最大化累积观看量和广告效果。 触发器可以被定制以跟踪广告牌(在任何显示介质中)的物理位置,广告牌的显示时间以及内容和/或广告的身份。 与执行的触发相关的数据包括执行触发的观看者的识别信息以确定触发的成功。 在确定触发器的成功之后,内容,广告和触发器的累积收视率可以跨区域分布在异构媒体上的广告牌进行管理。

    VIRTUALIZATION SOFTWARE WITH DYNAMIC RESOURCE ALLOCATION FOR VIRTUAL MACHINES
    4.
    发明申请
    VIRTUALIZATION SOFTWARE WITH DYNAMIC RESOURCE ALLOCATION FOR VIRTUAL MACHINES 审中-公开
    虚拟机动态资源分配虚拟化软件

    公开(公告)号:US20110023028A1

    公开(公告)日:2011-01-27

    申请号:US12563668

    申请日:2009-09-21

    IPC分类号: G06F9/455

    摘要: In one embodiment, a system has two or more working computers, each running one or more working virtual machines (VMs), and a protection computer running corresponding protection VMs. A management station can change the levels of computer resources specified in resource-configuration files for the protection VMs, and virtualization software can re-read the resource-configuration files and change the allocation of computer resources to the protection VMs without having to shut down and re-launch the protection VMs. By initially launching the protection VMs with reduced levels of computer resources, fast and cost-effective failover protection can be provided to the working computers, where the computer resources allocated to a protection VM are enhanced only after the detection of a failure of the corresponding working VM, without having to shut down and re-launch the protection VM.

    摘要翻译: 在一个实施例中,系统具有两个或更多个工作计算机,每个运行一个或多个工作虚拟机(VM)以及运行相应保护VM的保护计算机。 管理站可以更改保护虚拟机资源配置文件中指定的计算机资源的级别,虚拟化软件可以重新读取资源配置文件,并将计算机资源的分配更改为保护虚拟机,而无需关闭, 重新启动保护虚拟机。 通过最初启动具有较低计算机资源级别的保护虚拟机,可以向工作计算机提供快速且具有成本效益的故障转移保护,其中分配给保护虚拟机的计算机资源仅在检测到相应工作失败后才被增强 VM,而不必关闭并重新启动保护VM。

    Reducing latency and cost in resilient cloud file systems
    5.
    发明授权
    Reducing latency and cost in resilient cloud file systems 有权
    在弹性云文件系统中降低延迟和成本

    公开(公告)号:US08868647B2

    公开(公告)日:2014-10-21

    申请号:US13348243

    申请日:2012-01-11

    IPC分类号: G06F15/16

    摘要: Various exemplary embodiments relate to a method of storing a file block in a cloud system including a plurality of data centers. The method may include; receiving the file block from a client; generating a plurality of chunks from the file block, wherein each chunk is smaller than the file block and the file block may be reconstructed from a subset of the chunks; distributing each chunk to one of the plurality of data centers; and storing the file block in a cache. Various exemplary embodiments relate to a cloud system for storing files. The system may include a plurality of data centers including a primary data center. The primary data center may include: a cache configured to store at least one complete file block; a chunk storage configured to store a chunk for each of a plurality of file blocks; a file encoder; and a file decoder.

    摘要翻译: 各种示例性实施例涉及在包括多个数据中心的云系统中存储文件块的方法。 该方法可以包括: 从客户端接收文件块; 从所述文件块生成多个块,其中每个块小于所述文件块,并且所述文件块可以从所述块的子集重构; 将每个块分配到所述多个数据中心之一; 并将文件块存储在高速缓存中。 各种示例性实施例涉及用于存储文件的云系统。 该系统可以包括包括主数据中心的多个数据中心。 主数据中心可以包括:配置为存储至少一个完整文件块的高速缓存; 块存储器,被配置为存储多个文件块中的每一个的块; 文件编码器 和文件解码器。

    Reducing Latency and Cost in Resilient Cloud File Systems
    6.
    发明申请
    Reducing Latency and Cost in Resilient Cloud File Systems 有权
    减少弹性云文件系统的延迟和成本

    公开(公告)号:US20130179490A1

    公开(公告)日:2013-07-11

    申请号:US13348243

    申请日:2012-01-11

    IPC分类号: G06F15/16

    摘要: Various exemplary embodiments relate to a method of storing a file block in a cloud system including a plurality of data centers. The method may include; receiving the file block from a client; generating a plurality of chunks from the file block, wherein each chunk is smaller than the file block and the file block may be reconstructed from a subset of the chunks; distributing each chunk to one of the plurality of data centers; and storing the file block in a cache. Various exemplary embodiments relate to a cloud system for storing files. The system may include a plurality of data centers including a primary data center. The primary data center may include: a cache configured to store at least one complete file block; a chunk storage configured to store a chunk for each of a plurality of file blocks; a file encoder; and a file decoder.

    摘要翻译: 各种示例性实施例涉及在包括多个数据中心的云系统中存储文件块的方法。 该方法可以包括: 从客户端接收文件块; 从所述文件块生成多个块,其中每个块小于所述文件块,并且所述文件块可以从所述块的子集重构; 将每个块分配到所述多个数据中心之一; 并将文件块存储在高速缓存中。 各种示例性实施例涉及用于存储文件的云系统。 该系统可以包括包括主数据中心的多个数据中心。 主数据中心可以包括:配置为存储至少一个完整文件块的高速缓存; 块存储器,被配置为存储多个文件块中的每一个的块; 文件编码器 和文件解码器。

    EFFICIENT PROPAGATION OF LINK STATE ADVERTISEMENTS IN DENSELY INTERCONNECTED OSPF NETWORKS
    7.
    发明申请
    EFFICIENT PROPAGATION OF LINK STATE ADVERTISEMENTS IN DENSELY INTERCONNECTED OSPF NETWORKS 有权
    链路状态广播在密集互连OSPF网络中的有效传播

    公开(公告)号:US20130121156A1

    公开(公告)日:2013-05-16

    申请号:US13296934

    申请日:2011-11-15

    IPC分类号: H04L12/26

    摘要: A method for efficient propagation of link state advertisements in densely interconnected OSPF networks is disclosed for reducing the number of duplicate LSAs propagated during a flooding event. The efficient propagation method includes calculating an LSA propagation subgraph which is used by a node which receives an LSA to determine which links to propagate the LSA upon. This allows a significant reduction in the LSAs which traverse the network during a flooding event. The reduction in LSAs is particularly useful for reducing network convergence times associated with flooding events. In addition, a system is disclosed for performing the method in both a centralized and dispersed manner.

    摘要翻译: 公开了一种在密集互连的OSPF网络中有效传播链路状态通告的方法,用于减少在洪泛事件期间传播的重复LSA的数量。 有效传播方法包括计算接收LSA的节点使用的LSA传播子图,以确定哪个链路传播LSA。 这允许在洪泛事件期间穿过网络的LSA的显着减少。 LSA的减少对于减少与洪泛事件相关联的网络收敛时间特别有用。 此外,公开了以集中和分散的方式执行方法的系统。

    LOOKAHEAD COMPUTATION OF ROUTING INFORMATION
    8.
    发明申请
    LOOKAHEAD COMPUTATION OF ROUTING INFORMATION 有权
    LOOKAHEAD路由信息的计算

    公开(公告)号:US20120124235A1

    公开(公告)日:2012-05-17

    申请号:US12944928

    申请日:2010-11-12

    IPC分类号: G06F15/173

    CPC分类号: H04L45/12 H04L45/021

    摘要: Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the node, an indication that a current network state has changed to a new network state from an old network state; determining whether the node has access to pre-computed routing information associated with the new network state; if the node has access to pre-computed routing information associated with the new network state, using the pre-computed routing information to route future network traffic; and if the node does not have access to pre-computed routing information associated with the new network state, computing new routing information and using the new routing information to route future network traffic.

    摘要翻译: 各种示例性实施例涉及包括以下一个或多个的方法和相关网络节点:在节点处接收当前网络状态已经从旧网络状态改变到新的网络状态的指示; 确定所述节点是否能够访问与所述新网络状态相关联的预先计算的路由信息​​; 如果节点能够访问与新的网络状态相关联的预先计算的路由信息​​,则使用预先计算的路由信息​​来路由将来的网络流量; 并且如果节点不能访问与新的网络状态相关联的预先计算的路由信息​​,则计算新的路由信息​​并使用新的路由信息​​来路由未来的网络流量。

    PRIORITIZATION OF ROUTING INFORMATION UPDATES
    9.
    发明申请
    PRIORITIZATION OF ROUTING INFORMATION UPDATES 审中-公开
    路由信息更新优先

    公开(公告)号:US20120124238A1

    公开(公告)日:2012-05-17

    申请号:US12944900

    申请日:2010-11-12

    IPC分类号: G06F15/173

    CPC分类号: H04L45/023

    摘要: Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the node, a network state update message; updating a first portion of a first set of routing information based on the network state update message; after updating the first portion of the first set of routing information, beginning an update of a second set of routing information; and after beginning the update of the second set of routing information, updating a second portion of the first set. In various alternative embodiments, the step of updating the first portion includes one or more of the following: determining at least one other node within the network for which routing information should be used to update the second set of routing information; and updating routing information associated with the at least one other node in the first set of routing information.

    摘要翻译: 各种示例性实施例涉及包括以下一个或多个的方法和相关网络节点:在节点处接收网络状态更新消息; 基于所述网络状态更新消息来更新第一组路由信息的第一部分; 在更新第一组路由信息的第一部分之后,开始第二组路由信息的更新; 并且在开始更新第二组路由信息之后,更新第一组的第二部分。 在各种替代实施例中,更新第一部分的步骤包括以下中的一个或多个:确定网络内的至少一个其他节点应为哪个路由信息用于更新第二组路由信息; 以及更新与所述第一组路由信息中的所述至少一个其他节点相关联的路由信息​​。

    REDUCTION OF MESSAGE AND COMPUTATIONAL OVERHEAD IN NETWORKS
    10.
    发明申请
    REDUCTION OF MESSAGE AND COMPUTATIONAL OVERHEAD IN NETWORKS 有权
    减少网络中的信息和计算量

    公开(公告)号:US20120120808A1

    公开(公告)日:2012-05-17

    申请号:US12945318

    申请日:2010-11-12

    IPC分类号: H04L12/26

    CPC分类号: H04L45/025 H04L45/028

    摘要: Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the node, a network update message; determining whether the network update message should be propagated to other nodes; if the network update message should be propagated to other nodes, forwarding the network update message to at least one other node; and if the network update message should not be propagated to other nodes, refraining from forwarding the network update message to any other node. Various further embodiments relate to a method and related network node including one or more of the following: determining a first time period for the network update message; setting the first time period as a delay time; waiting for the delay time; and after the delay time has elapsed, computing new routing information based on the network update message.

    摘要翻译: 各种示例性实施例涉及包括以下一个或多个的方法和相关网络节点:在节点处接收网络更新消息; 确定网络更新消息是否应传播到其他节点; 如果网络更新消息应该被传播到其他节点,则将网络更新消息转发到至少一个其他节点; 并且如果网络更新消息不应传播到其他节点,则不要将网络更新消息转发到任何其他节点。 各种另外的实施例涉及包括以下的一个或多个的方法和相关网络节点:确定网络更新消息的第一时间段; 将第一时间段设置为延迟时间; 等待延迟时间; 并且在延迟时间过去之后,基于网络更新消息来计算新的路由信息​​。