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 |
Patent application number | Description | Published |
20090086625 | Method and Apparatus For Providing a Distributed Control Plane for a Mobility Home Agent - The invention includes a method and apparatus for providing a distributed control plane for a mobility home agent by enabling multiple home addresses associated with multiple home agents to be assigned to a mobile node contemporaneously. A first home agent assigns a first home address to the mobile node. The first home agent propagates the first home address to the mobile node, which stores the first home address. The first home address is also propagated to a naming server and stored by the naming server for the mobile node. A second home agent, or the first home agent on behalf of the second home agent, assigns a second home address to the mobile node. The first home agent, or second home agent, propagates the second home address to the mobile node, which stores the second home address while continuing to store the first home address. The second home address is also propagated to the naming server and stored by the naming server for the mobile node while the naming server continues to store the first home address for the mobile node. | 04-02-2009 |
20090086734 | Method and Apparatus for Providing a Distributed Forwarding Plane for a Mobility Home Agent - The invention includes a method and apparatus for providing a distributed forwarding plane for a mobility home agent. The invention provides a method for controlling routing of packets for a mobile node in a network comprising a network domain including a plurality of forwarding elements being controlled by a control element. A method includes computing a route from one of the forwarding elements toward the mobile node and propagating the computed route toward that one of the forwarding elements. The route is computed using location information associated with the mobile node and routing information associated with the network domain. | 04-02-2009 |
20090089793 | Method and Apparatus for Performing Load Balancing for a Control Plane of a Mobile Communication Network - The invention includes a method and apparatus for providing load balancing of control traffic received by a mobility home agent implemented using multiple control elements. A method includes receiving, from a node, a control message intended for the network element, performing a load-balancing operation to select one of the control elements to handle the control message, and propagating the control message toward the selected one of the control elements. The load-balancing operation is performed using at least two load-balancing metrics comprising a first metric and a second metric. The load-balancing operation is performed in a manner for maintaining a context between the node from which the control message is received and the selected one of the control elements, such that subsequent control messages received from the node are propagated to the selected one of the control elements. | 04-02-2009 |
20090135793 | METHOD AND APPARATUS FOR MANAGING AN IP ADDRESS SPACE OF AN ADDRESS SERVER IN A MOBILITY NETWORK - The invention manages an IP address space in a mobility network, including partitioning of the IP address space, assignment of IP addresses from the IP address space, and/or use of hysteresis to control reassignment of IP addresses from the IP address space. The IP address assignment is performed using one or more residual time statistics from a residual time profile maintained for the mobile node requesting assignment of an IP address. A residual time profile of a mobile node includes one or more residual time statistics associated with the mobile node. The residual time statistics for a mobile node are determined using a residual time associated with each IP address assigned to the mobile node. The IP address space partitioning is performed using residual time statistics maintained for mobile nodes of the network. The reassignment of IP addresses from the IP address space is controlled using hysteresis. | 05-28-2009 |
20090135816 | METHOD AND APPARATUS FOR ASSIGNING IP ADDRESSES - The invention includes a method and apparatus for assigning an IP address to a mobile node (MN) from an IP address space represented using an address aggregation tree. A method includes receiving a request for an IP address for the MN, identifying each of a plurality of sub-tree gaps in the address aggregation tree, selecting one of the identified sub-tree gaps, and assigning an available IP address from the selected sub-tree gap to the MN. The sub-tree gaps of the address aggregation tree are identified using a recursive algorithm that traverses the address aggregation tree. The selected one of the sub-tree gaps is selected based on respective sizes of the identified sub-tree gaps. The assigned IP address is communicated to the MN for use by the MN in accessing various services. | 05-28-2009 |
20100165855 | Apparatus and method for a multi-level enmeshed policer - An enmeshed hierarchy of policers, different from traditional tree-based hierarchical system of policers is used in accordance with the present invention. A goal of using an enmeshed architecture of policing systems is to allow for a more complex set of policies to be defined across a network. Hierarchical/cascading systems ensure that the higher granularity assignments essentially dictate/constrain the behavior of finer grained assignments at higher levels for sub-flows. There is only one type of metric possible for the largest granular policer, so the only way to implement multiple system-wide metrics is to repeat the hierarchy multiple times over, which adds to the delay of the packet and the complexity of the router. In accordance with the enmeshed architecture of the present invention, multiple system-wide metrics can be implemented simultaneously, which allows for easier management of the various macro-level policies by the manager of an access network. | 07-01-2010 |
20100195504 | SINGLE AND DUAL RATE THREE COLOR MARKER SYSTEMS - An advance is made over the prior art in accordance with the principles of the present invention that is directed to a new approach for a system and method of Single Rate Three Color Marker (srTCM) and Two Rate Three Color Marker (trTCM) methodology. The invention eliminates deficiencies present in existing standards that allow a user to defeat the traffic meter that is used to ensure bandwidth usage is within limits imposed by the provider. Adoption of these invention will ensure compliance with the goals of an ideal Single Rate Three Color Marker (srTCM) and Two Rate Three Color Marker (trTCM) scheme. | 08-05-2010 |
20100217866 | Load Balancing in a Multiple Server System Hosting an Array of Services - A method and system for load balancing in a multiple server system supporting multiple services are provided to determine the best server or servers supporting a service with the best response time. An induced aggregate load is determined for each of the multiple services in accordance with corresponding load metrics. A maximum induced aggregate load on a corresponding server that generates a substantially similar QoS for each of the plurality of services is determined. A load balancing server distributes the multiple services across the multiple servers in response to the determined induced aggregate and maximum induced aggregate loads, such that the QoS for each of the multiple services is substantially uniform across the servers. | 08-26-2010 |
20100251123 | MULTI-LEVEL ENMESHED DIRECTORY STRUCTURES - A method for creating a multi-level enmeshed structure is provided. The multi-level enmeshed directory structure of the present embodiments contain objects described by multiple object descriptors, which can be thought of as tags. Each object can be accessed by any one of the descriptors that describe the object and the descriptors of an object are also accessible. | 09-30-2010 |
20110055845 | Technique for balancing loads in server clusters - In a network arrangement where a client requests a service from a server system, e.g., through the Internet, a multiple-load balancer is used for balancing loads in two or more server clusters in the server system to completely identify a sequence of servers for processing the service request. Each server in the resulting sequence belongs to a different server cluster. The service request is sent to the first server in the sequence, along with information for routing the request through the sequence of servers. | 03-03-2011 |
20110320524 | Technique For Effectively Reducing Latency Of Locating A Resource On A Network - A local domain name system (DNS) server communicates a request for resolving a domain name to a first remote DNS server. The first remote DNS server resolves part of the domain name and relays the request to a second remote DNS server in a hierarchy according to the DNS, thereby obviating the need of repeating by the local DNS server the request to the second remote DNS server. As a result, the latency of locating a network resource by the domain name is reduced. | 12-29-2011 |
20120082141 | Method And Apparatus For Improved Paging In Wireless Communication - Various methods and devices are provided to address the need to reduce paging latency. In one method, a wireless network determines ( | 04-05-2012 |
20120083293 | Method And Apparatus For Group Paging In Wireless Communication - Various methods and devices are provided to address the need to reduce paging latency. In one method, a wireless network determines ( | 04-05-2012 |
20120140648 | Method And Apparatus For Improved Multicast Service - Various methods and devices are provided to address the need for improved multicast operation. In one method, a station transmits ( | 06-07-2012 |
20120150654 | Method And Apparatus For Interactive Media Control - A method and apparatus for controlling an interactive billboard. A billboard controller builds a UAP dataset, using the UAP dataset for audience estimation, and causing selected content to be displayed on one or more billboards based on the estimate. The UAP dataset preferably contain scored or ranked user association sets that associate users with content and other characteristics of detected interactions with the billboard. | 06-14-2012 |
20120179786 | MANAGING MEDIA CONTENT STREAMED TO USERS VIA A NETWORK - A method for managing media content streamed to users via a network includes streaming a media content file via the network to a media player for playing the media content file. When the media content file is played by a user, a media mark associated with the played media content file is created to identify a section of the played media content file which is of interest to the user. The media mark includes a start indicator, a stop indicator and a content identifier. The media mark is stored. It may be stored locally, or at a store included in the network, or at the content provider, or in any combination of these. | 07-12-2012 |
20120195228 | Method For Improved Topology Mapping In Wireless Communication Networks - A method is provided for enabling a base station to infer a compact topology graph among a set of mobile nodes in its cell, the mobile nodes having a secondary radio to enable inter-nodal communication. This methodology ensures that nodal membership information is gathered within approximately 100 ms, and additional topology information is gathered from all the mobile nodes within approximately 300 ms over Wi-Fi radios. In dense networks, this time can be reduced to within 100 ms. | 08-02-2012 |
20120213097 | Method And Apparatus For Improved Multicast Service Using Feedback Mobiles - Various methods and devices are provided to address the need for improved multicast operation. In one method, a mobile device receives a multicast packet from a station, the mobile device being one of a plurality of mobile devices that includes a group of feedback mobile devices. The mobile device transmits an indication that it is volunteering to become a member of the group of feedback mobile devices and determines whether to begin operating as a member of the group of feedback mobile devices. If the mobile device is to begin operating as a member of the group of feedback mobile devices, the mobile device transmits an indication of channel quality and/or a level of interference observed by the mobile device. | 08-23-2012 |
20130041753 | System and Method for Identifying a Path of a Billboard Audience Group and Providing Advertising Content Based on the Path - A plurality of mappings corresponding to respective points of interest is generated. Each mapping indicates at least one group detected at the corresponding point of interest and respective times when each respective group among the at least one group was detected at the corresponding point of interest. A standard representation corresponding to a set of one or more groups appearing in a selected one of the plurality of mappings is defined. A path associated with the standard representation is determined, based on the plurality of mappings, the path defining a second plurality of points of interest at which the standard representation was detected and time information indicating when the standard representation was detected at each respective point of interest within the second plurality of points of interest. A point of interest may comprise a location associated with a billboard. | 02-14-2013 |
20130077525 | Method And Apparatus For Neighbor Discovery - Various methods and devices are provided to address the need for improved neighbor detection. In a first method, a node (e.g., a mobile node or a network transceiver node) transmits ( | 03-28-2013 |
20130095862 | NETWORKS AND METHODS FOR PAGING MESSAGE CONTROL - At least one example embodiment discloses a paging message controller. The paging message controller includes a processor and an associated memory. The processor is configured to obtain an indication of a paging message for a user equipment (UE), the indication indicating that a paging message is to be forwarded to at least one destination cell of a first set of cells for paging the UE, and forward the paging message for paging the UE to at least one destination cell of a second set of cells in response to the indication. | 04-18-2013 |
20130174172 | DATACENTER DATA TRANSFER MANAGEMENT SYSTEM AND METHOD - An exemplary data transfer manager includes a datacenter configured to communicate over at least one link and a scheduler that is configured to schedule a plurality of jobs for communicating data from the datacenter. The scheduler determines a minimum bandwidth requirement of each job and determines a maximum bandwidth limit of each job. The scheduler determines a flex parameter of each job. The flex parameter indicates how much a data transfer rate can vary between adjacent data transfer periods for the job. | 07-04-2013 |
20130185229 | APPARATUS AND METHOD FOR MANAGING STORAGE OF DATA BLOCKS - A data block storage management capability is presented. A cloud file system management capability manages storage of data blocks of a file system across multiple cloud storage services (e.g., including determining, for each data block to be stored, a storage location and a storage duration for the data block). A cloud file system management capability manages movement of data blocks of a file system between storage volumes of cloud storage services. A cloud file system management capability provides a probabilistic eviction scheme for evicting data blocks from storage volumes of cloud storage services in advance of storage deadlines by which the data blocks are to be removed from the storage volumes. A cloud file system management capability enables dynamic adaptation of the storage volume sizes of the storage volumes of the cloud storage services. | 07-18-2013 |
20130185257 | CLOUD DATA RESILIENCY SYSTEM AND METHOD - An exemplary cloud data system includes a primary datacenter device that maintains a complete copy of a file. A plurality of secondary datacenter devices maintain respective encoded, partial copies of the file. At least some of the encoded partial copies are sufficient to recreate the complete copy of the file. The primary datacenter device makes any changes to the complete copy of the file responsive to any write operation on the file. The primary datacenter device provides correspondingly changed encoded partial copies to the respective secondary datacenter devices. | 07-18-2013 |
20130185530 | Method And Apparatus For A Frugal Cloud File System - Various embodiments provide a method and apparatus of providing a frugal cloud file system that efficiently uses the blocks of different types of storage devices with different properties for different purposes. The efficient use of the different types of available storage devices reduces the storage and bandwidth overhead. Advantageously, the reduction in storage and bandwidth overhead achieved using the frugal cloud file system reduces the economic costs of running the file system while maintaining high performance. | 07-18-2013 |
20130208593 | METHOD AND APPARATUS PROVIDING FLOW CONTROL USING ON-OFF SIGNALS IN HIGH DELAY NETWORKS - A method and apparatus controlling, either individually or in the aggregate, traffic flows associated with a plurality of queues by transmitting traffic source FlowON messages at first times selected to avoid queue underflow conditions, and traffic source FlowOFF message at second times selected to avoid queue overflow conditions, where the first and second times are determined as a function of delay time D of a link supporting the traffic source. | 08-15-2013 |
20140351531 | APPARATUS AND METHOD FOR MANAGING STORAGE OF DATA BLOCKS - A data block storage management capability is presented. A cloud file system management capability manages storage of data blocks of a file system across multiple cloud storage services (e.g., including determining, for each data block to be stored, a storage location and a storage duration for the data block). A cloud file system management capability manages movement of data blocks of a file system between storage volumes of cloud storage services. A cloud file system management capability provides a probabilistic eviction scheme for evicting data blocks from storage volumes of cloud storage services in advance of storage deadlines by which the data blocks are to be removed from the storage volumes. A cloud file system management capability enables dynamic adaptation of the storage volume sizes of the storage volumes of the cloud storage services. | 11-27-2014 |