Patent application number | Description | Published |
20100161797 | BALANCING USER REGISTRATION LIFETIMES IN A NETWORK - 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. | 06-24-2010 |
20100295659 | IDENTIFYING RFID CATEGORIES - 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. | 11-25-2010 |
20110023028 | VIRTUALIZATION SOFTWARE WITH DYNAMIC RESOURCE ALLOCATION FOR VIRTUAL MACHINES - 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. | 01-27-2011 |
20120044813 | METHOD AND APPARATUS FOR COPING WITH LINK FAILURES IN CENTRAL CONTROL PLANE ARCHITECTURES - 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. | 02-23-2012 |
20120120808 | REDUCTION OF MESSAGE AND COMPUTATIONAL OVERHEAD IN NETWORKS - 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. | 05-17-2012 |
20120124235 | LOOKAHEAD COMPUTATION OF ROUTING INFORMATION - 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. | 05-17-2012 |
20120124238 | PRIORITIZATION OF ROUTING INFORMATION UPDATES - 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. | 05-17-2012 |
20120143678 | COLLABORATION RECOMMENDATION AND EMBEDDED TRIGGER SELECTION IN DISTRIBUTED HETEROGENEOUS MEDIUMS - A method of determining relevance values for triggers, in order to select relevant embedded triggers to be displayed with ads and/or content shown on billboards of various media types. The method includes determining a potential relevance of preselected ads and/or content that may provide a threshold relevance value for all triggers that are to be displayed with the preselected ad and/or content. Relevance values and potential relevance are determined by summing entity values. Entity values are determined by multiplying entity weights by a summation of keyword weights. Entity weights and keyword weights may be assigned based on industry experience or based on the ability of displayed entities and/or displayed keywords to generate revenue. | 06-07-2012 |
20120143695 | CONTENT COLLABORATION AMONG HETEROGENEOUS DISTRIBUTED MEDIUMS - 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. | 06-07-2012 |
20120300647 | System and Method for Providing Communication Services - 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. | 11-29-2012 |
20130121156 | EFFICIENT PROPAGATION OF LINK STATE ADVERTISEMENTS IN DENSELY INTERCONNECTED OSPF NETWORKS - 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. | 05-16-2013 |
20130177312 | METHOD AND SYSTEM FOR ENERGY EFFICIENT ROUTING OF IP PACKETS OVER OPTICAL BACKBONE NETWORKS - A method and system for energy-efficient routing of IP packets in which ingress traffic is forward from ingress nodes directly to source dominator nodes without address destination processing such that related address processing elements may be avoided in the ingress nodes. The source dominator nodes perform address destination processing and forward the packets to destination dominator nodes proximate the destination node. | 07-11-2013 |
20130179490 | Reducing Latency and Cost in Resilient Cloud File Systems - 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. | 07-11-2013 |
20140341078 | REDUCTION OF MESSAGE AND COMPUTATIONAL OVERHEAD IN NETWORKS - 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. | 11-20-2014 |