公开(公告)号：US20120120808A1

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

申请号：US12945318

申请日：2010-11-12

申请人： Thyaga Nandagopal ,  Kiran M. Rege ,  Krishan Sabnani ,  Wim Henderickx

发明人： Thyaga Nandagopal ,  Kiran M. Rege ,  Krishan Sabnani ,  Wim Henderickx

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.

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

公开(公告)号：US20100295659A1

公开(公告)日：2010-11-25

申请号：US12470061

申请日：2009-05-21

申请人： Murali Kodialam ,  Thyaga Nandagopal ,  Wing C. Lau

发明人： Murali Kodialam ,  Thyaga Nandagopal ,  Wing C. Lau

IPC分类号： H04Q5/22

CPC分类号： G06K7/0008 ,  G06K7/10059

摘要： The set T of all categories in a population of RFID tags is estimated within a specified error bound. For each of one or more frames, a reader broadcasts a probability p, a multiplicity d, a frame size M, and a seed value R to the present tags. A deterministic algorithm on each tag, and known to the reader, calculates (i) whether the tag will transmit in this frame, and, if so, (ii) in which slots the tag will transmit a single “1.” When the tags have responded, the reader calculates set T by initially assuming that all possible categories are in set T and then eliminating those categories that would have transmitted in those slots in which no tag transmitted. Alternatively, the reader initially assumes that set T is empty, and adds those categories that would have transmitted in those slots in which one or more tags did transmit.

摘要翻译： 估计RFID标签中所有类别的集合T在指定的误差范围内。 对于一个或多个帧中的每一个，读取器向当前标签广播概率p，多重度d，帧大小M和种子值R. 每个标签上的确定性算法，并且由读者知道，计算（i）标签是否将在该帧中传输，如果是，则（ii）标签将在哪个时隙中传送单个“1”。当标签 读者通过最初假设所有可能的类别都在T中计算集合T，然后消除那些在没有标签发送的那些时隙中传送的类别。 或者，读取器最初假设集合T为空，并且添加将在一个或多个标签确实发送的那些时隙中传送的那些类别。

公开(公告)号：US08619546B2

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

申请号：US12858050

申请日：2010-08-17

申请人： Thyaga Nandagopal ,  Maulik Desai

发明人： Thyaga Nandagopal ,  Maulik Desai

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。

公开(公告)号：US08250210B2

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

申请号：US12343608

申请日：2008-12-24

申请人： Thyaga Nandagopal ,  Thomas Woo

发明人： Thyaga Nandagopal ,  Thomas Woo

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.

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

公开(公告)号：US20110023028A1

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

申请号：US12563668

申请日：2009-09-21

申请人： Thyaga Nandagopal ,  Thomas Woo

发明人： Thyaga Nandagopal ,  Thomas Woo

IPC分类号： G06F9/455

CPC分类号： G06F9/45533 ,  G06F9/44505 ,  G06F9/5077 ,  G06F11/2023 ,  G06F11/2038 ,  G06F2201/815

摘要： 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。

公开(公告)号：US08868647B2

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

申请号：US13348243

申请日：2012-01-11

申请人： Krishna Puttaswamy Naga ,  Thyaga Nandagopal ,  Yadi Ma

发明人： Krishna Puttaswamy Naga ,  Thyaga Nandagopal ,  Yadi Ma

IPC分类号： G06F15/16

CPC分类号： G06F17/30091 ,  G06F17/30132 ,  G06F17/30165 ,  G06F17/30197 ,  H04L29/08729 ,  H04L67/1097

摘要： 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.

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

公开(公告)号：US20130179490A1

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

申请号：US13348243

申请日：2012-01-11

申请人： Krishna Puttaswamy Naga ,  Thyaga Nandagopal ,  Yadi Ma

发明人： Krishna Puttaswamy Naga ,  Thyaga Nandagopal ,  Yadi Ma

IPC分类号： G06F15/16

CPC分类号： G06F17/30091 ,  G06F17/30132 ,  G06F17/30165 ,  G06F17/30197 ,  H04L29/08729 ,  H04L67/1097

摘要： 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.

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

公开(公告)号：US20130121156A1

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

申请号：US13296934

申请日：2011-11-15

申请人： Kiran M. Rege ,  Thyaga Nandagopal

发明人： Kiran M. Rege ,  Thyaga Nandagopal

IPC分类号： H04L12/26

CPC分类号： H04L45/026 ,  H04L45/04 ,  H04L45/48

摘要： 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的减少对于减少与洪泛事件相关联的网络收敛时间特别有用。 此外，公开了以集中和分散的方式执行方法的系统。

公开(公告)号：US09125147B2

公开(公告)日：2015-09-01

申请号：US13115519

申请日：2011-05-25

申请人： Thyaga Nandagopal ,  Ajay Sathyanath

发明人： Thyaga Nandagopal ,  Ajay Sathyanath

IPC分类号： H04W48/20 ,  H04L12/26 ,  H04W24/02

CPC分类号： H04W48/20 ,  H04L43/0882 ,  H04L43/0894 ,  H04W24/02

摘要： A method for determining a load measure associated with a wireless communications node, such as a Wi-Fi access point or cellular base station, is described. A time interval measure representing a time interval between frames transmitted by a node is determined, and a number of user devices associated with the node is determined based on information in the frames transmitted by the node. A load measure associated with the node is determined, based at least on the number of user devices associated with the node and the time interval measure. Systems and apparatus are also described.

摘要翻译： 描述了用于确定与诸如Wi-Fi接入点或蜂窝基站的无线通信节点相关联的负载测量的方法。 确定表示由节点发送的帧之间的时间间隔的时间间隔度量，并且基于由节点发送的帧中的信息来确定与节点相关联的多个用户设备。 至少基于与节点相关联的用户设备的数量和时间间隔测量来确定与节点相关联的负载测量。 还描述了系统和装置。

公开(公告)号：US08614952B2

公开(公告)日：2013-12-24

申请号：US13296934

申请日：2011-11-15

申请人： Kiran M. Rege ,  Thyaga Nandagopal

发明人： Kiran M. Rege ,  Thyaga Nandagopal

IPC分类号： G08C15/00

CPC分类号： H04L45/026 ,  H04L45/04 ,  H04L45/48

摘要： 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的减少对于减少与洪泛事件相关联的网络收敛时间特别有用。 此外，公开了以集中和分散的方式执行方法的系统。