Patent application number | Description | Published |
20100250718 | METHOD AND APPARATUS FOR LIVE REPLICATION - A method and apparatus is disclosed herein for live replication. In one embodiment, the method comprises replicating a source server to create a replica server, assigning a routable Internet Protocol (IP) address to the replica server; and migrating one or more, but not all, on-going connections from the source server to the replica server. | 09-30-2010 |
20110029675 | RESOURCE ALLOCATION PROTOCOL FOR A VIRTUALIZED INFRASTRUCTURE WITH RELIABILITY GUARANTEES - A method and apparatus is disclosed herein for a resource allocation protocol. In one embodiment, the apparatus comprises a resource allocation engine to allocate physical resources to primary and redundant virtual infrastructures, wherein, when the resource allocation engine allocates virtual infrastructures, physical resources of redundant virtual infrastructures are shared across multiple primary virtual infrastructures. | 02-03-2011 |
20140365664 | RESOURCE ALLOCATION PROTOCOL FOR A VIRTUALIZED INFRASTRUCTURE WITH RELIABILITY GUARANTEES - A method and apparatus is disclosed herein for a resource allocation protocol. In one embodiment, the apparatus comprises a resource allocation engine to allocate physical resources to primary and redundant virtual infrastructures, wherein, when the resource allocation engine allocates virtual infrastructures, physical resources of redundant virtual infrastructures are shared across multiple primary virtual infrastructures. | 12-11-2014 |
Patent application number | Description | Published |
20080225751 | METHOD AND APPARATUS FOR PRIORITIZED INFORMATION DELIVERY WITH NETWORK CODING OVER TIME-VARYING NETWORK TOPOLOGIES - A method and apparatus is disclosed herein for information delivery with network coding over time-varying network topologies. In one embodiment, the method comprises decomposing a sequence of topology graphs that model a time-varying network topology into a plurality of virtual graphs, where each virtual graph of the plurality of virtual graphs corresponds to a distinct traffic class, and the virtual topology graph representing a partial topology of a time-varying network. The method also includes selecting a network code for each virtual graph in the plurality of the virtual graphs to meet requirements of the distinct traffic class corresponding to said each topology graph, where the network code is used to encode packets of the associated traffic class, and processing packets of each traffic class using the network code determined by its corresponding virtual topology and the requirements of said each traffic class, including using a virtual buffer system to implement the network code corresponding to each traffic class over the physical network topology. The method also includes using a scheduler to determine the transmission schedules for each output packet from the virtual buffer system of each traffic class where the scheduling decisions are based, at least in part, on the QoS requirements of each class. | 09-18-2008 |
20090055471 | MEDIA STREAMING WITH ONLINE CACHING AND PEER-TO-PEER FORWARDING - A system, method and apparatus are disclosed herein for media streaming. In one embodiment, the system comprises one or more media servers to serve media content and a plurality of peers communicably coupled to one or more other peers of the plurality of peers and at least one of the one or more media servers to receive segments of media content, where at least one of peers allocates a set of resources for serving the segments of media content including cache memory to store the segments and media files and uplink bandwidth to send the segments of media content to the one or more peers to which the one peer is communicably coupled. The system also includes a first control server to track media content demand and the allocated resources of the plurality of peers to determine which peer should cache which segment of the media file and to return peer location information specifying the one or more peer locations from which each peer is to receive each segment of each media content requested. The control server is operable to send the location information to each peer. In one embodiment, the one control server is also operable to calculate a utility of each caching option and enforce it by sending triggers to the peers to initiate the caching at those peers. | 02-26-2009 |
20090205046 | METHOD AND APPARATUS FOR COMPENSATING FOR AND REDUCING SECURITY ATTACKS ON NETWORK ENTITIES - Security attacks on network entities can be compensated for and reduced through insurance that modifies incentives. In one example, a virtual slice provider includes a secure and non-secure slice having resources to provide network access to users through a service provider. The secure slice is assigned a first security level and a non-secure slice is assigned a second lower security level. In one embodiment, the second slice is isolated from the first slice. The virtual slice provider also has a risk policy between the slice provider and the service provider to establish different rates charged to the service provider for access to the secure and non-secure slices and to provide different levels of payment to the service provider for losses resulting from a lack of security in each slice. | 08-13-2009 |
20100058147 | METHOD AND APPARATUS FOR RELIABLE MEDIA TRANSPORT - Methods and apparatuses to model the relation between the delay samples and congestion losses and to protect media flows against congestion losses are disclosed. In one embodiment, the method comprises measuring congestion by delay samples, and performing a dynamic FEC algorithm that uses convex hull clustering for loss-event classification, including determining an FEC rate according to the loss-event classification. In another embodiment, the method comprises measuring congestion by delay samples, modeling loss events associated with the delay samples by grouping loss events as unions of convex hulls to identify a period of potentially increased congestion, dynamically changing the FEC rate based on the modeling, and applying FEC protection to the media flow during the period based on the FEC rate. In yet another embodiment, the method comprises forming clusters using past loss events and their {FTT, F{dot over (T)}T} or {RTT, R{dot over (T)}T} estimates, and estimating future loss events using most recent {FTT, F{dot over (T)}T} or {RTT, R{dot over (T)}T} estimates and their membership in convex hull clusters. | 03-04-2010 |
20100077470 | METHOD AND APPARATUS FOR SECURITY-RISK BASED ADMISSION CONTROL - A method and apparatus is disclosed herein for security risk-based admission control. In one embodiment, the method comprises: receiving a request from the user device to access the network; determining whether to admit the user device based on a security-based admission control policy that admits user devices based on a constraint optimization that attempts to maximize the sum utility of the currently admitted user devices in view of a security assessment of the user device and security risk imposed on the network and already admitted user devices if the user device is admitted to the network, wherein the constraint optimization is based on a utility associated with admitting the user device to the network, a reputation value associated with the user device, and a botnet damage estimation on the network associated with the user device; and admitting the user device to the network based on results of determining whether to admit the user device. | 03-25-2010 |
20100323708 | METHOD AND APPARATUS FOR SENDING INFORMATION VIA SILENT SYMBOL CODING OVER UNDER-UTILIZED CHANNELS IN WIRELESS SYSTEMS - A method and apparatus is disclosed herein for sending information over under-utilized channels in wireless systems. In one embodiment, a method for use in a cellular system in which a channel allocated to a primary user is underutilized at times, comprises: creating a unique 0-1 valued permutation code to transmit bits of a secondary user on a channel of the primary user; creating one or more codewords based on a first set of symbols to be transmitted for the primary user and the permutation code; and transmitting the one or more codewords on the channel. | 12-23-2010 |
20110029347 | METHOD FOR WIRELESS NETWORK VIRTUALIZATION THROUGH SEQUENTIAL AUCTIONS AND CONJECTURAL PRICING - A method and apparatus is disclosed herein for wireless network virtualization through sequential auctions and conjectural pricing. In one embodiment, the apparatus comprises a plurality of service providers operable to bid on network resources on behalf of a plurality of individual receivers and a wireless network operator, communicably coupled to the plurality of service providers, to perform resource allocation using an auction to allocate network resources to the plurality of service providers based on instantaneous channel conditions and traffic information of each of the individual receivers and to schedule transmissions in time and space to the individual receivers. | 02-03-2011 |
20110154327 | METHOD AND APPARATUS FOR DATA CENTER AUTOMATION - A method and apparatus is disclosed herein for data center automation. In one embodiment, a virtualized data center architecture comprises: a buffer to receive a plurality of requests from a plurality of applications; a plurality of physical servers, wherein each server of the plurality of servers having one or more server resources allocable to one or more virtual machines on said each server, wherein each virtual machine handles requests for a different one of a plurality of applications, and local resource managers each running on said each server to generate resource allocation decisions to allocate the one or more resources to the one or more virtual machines running on said each server; a router communicably coupled to the plurality of servers to control routing of each of the plurality of requests to an individual server in the plurality of servers; an admission controller to determine whether to admit the plurality of requests into the buffer, and a central resource manager to determine which server of the plurality of servers are active, wherein decisions of the central resource manager depends on backlog information per application at each of the plurality of servers and the router. | 06-23-2011 |
20150063144 | METHOD AND APPARATUS FOR SOFTWARE DEFINED FLOW CONTROL IN WIRELESS SYSTEMS - A method and apparatus is disclosed herein for performing flow control. In one embodiment, the method is for use in a wireless network apparatus that includes a controller, wireless entities, user equipments, and includes the following operations: collecting, by the controller, signal strength measurements from entities of the plurality of wireless entities; collecting, by the controller, channel quality indicators (CQI) information provided by one or more UEs of the at least one UEs; generating a CQI estimate for each entity of the plurality of entities not serving a flow to a UE; and determining, by the controller, forwarding decisions for one or more flows to specify which wireless entity is to serve which flow, based on one or more of the signal strength measurements, the channel quality indicators (CQIs) provided by one or more UEs, and one or more generated CQI estimates associated with entities not serving a flow to a UE. | 03-05-2015 |
20150074222 | METHOD AND APPARATUS FOR LOAD BALANCING AND DYNAMIC SCALING FOR LOW DELAY TWO-TIER DISTRIBUTED CACHE STORAGE SYSTEM - A method and apparatus is disclosed herein for load balancing and dynamic scaling for a storage system. In one embodiment, an apparatus comprises a load balancer to direct read requests for objects, received from one or more clients, to at least one of one or more cache nodes based on a global ranking of objects, where each cache node serves the object to a requesting client from its local storage in response to a cache hit or downloads the object from the persistent storage and serves the object to the requesting client in response to a cache miss, and a cache scaler communicably coupled to the load balancer to periodically adjust a number of cache nodes that are active in a cache tier based on performance statistics measured by one or more cache nodes in the cache tier. | 03-12-2015 |