Patent application number | Description | Published |
20100322255 | PROVIDING CLOUD-BASED SERVICES USING DYNAMIC NETWORK VIRTUALIZATION - The invention is directed to providing cloud-based services using dynamic network virtualization. Embodiments of the invention provide a cloud-based service over a system that has a dynamic network virtualization architecture. The architecture includes a set of distributed forwarding elements with centralized control, and at least one virtual machine that is bound to one of the forwarding elements. These features enable the virtual machine to be migrated across a wide area network while maintaining its original IP address and service continuity. | 12-23-2010 |
20110016119 | SYSTEM AND METHOD FOR MANAGING USER PROFILES - The present invention relates to a system and method for managing user profiles based on keyword content associated with a user. The user associated keyword content represents a website requested by the user or video data viewed by the user, in which the user profile is created and maintained at the customer premise equipment as opposed to the network infrastructure associated with the service provider. For example, the system includes a customer premise equipment (CPE) configured to create a user profile. The user profile includes at least one keyword representing keyword content associated with the user and at least one score representing importance of a corresponding keyword. | 01-20-2011 |
20110016206 | SYSTEMS AND METHODS FOR CREATING USER INTEREST PROFILES - Example methods include monitoring Internet traffic for a user, analyzing content of the Internet traffic, correlating the analyzed content with a simplified classifier set, ranking each correlated simplified classifier in the simplified classifier set, and storing the ranked simplified classifiers in a user interest profile for the user. Customer premise equipment may include a residential gateway, such as a wireless router, and user equipment such as a personal computer. Example systems may be configured from customer premise equipment or Internet service providers to generate user interest profiles in accordance with example methods. | 01-20-2011 |
20110029374 | DYNAMIC AD SCHEDULING METHOD FOR IMPROVING UTILITY IN INTERACTIVE TV ENVIRONMENT - Example embodiments provide scheduling a plurality of ads to be shown to a plurality of viewers of a multimedia network. One example embodiment includes determining target view rates for each of the plurality of ads based on expected revenue associated with each of the plurality of ads, determining, for each of the plurality of ads, a queue value based on a target view rate and an actual view rate associated with the ad, the actual view rate being a number of views of the ad in a previous time slot, and selectively showing ads, from among the plurality of ads, to the plurality of viewers based on the queue values. | 02-03-2011 |
20110029511 | KEYWORD ASSIGNMENT TO A WEB PAGE - A method, system and apparatus for a assigning keywords to a web page using keyword data from the web page itself, web pages having links pointing to the web page, and web pages pointed to by a link in the web page, wherein the keyword data from the multiple web pages is processed to provide a relevant set of keyword data for the web page. | 02-03-2011 |
20110035277 | SYSTEM FOR SCHEDULING ADVERTISEMENTS AND METHOD THEREOF - The system for scheduling advertisements includes at least one ad bidder and an ad scheduler. The ad bidder is configured to receive bidding information for a plurality of ads from one or more advertisers. The bidding information for each ad includes at least one target profile information and a bid associated with the target profile information. The bid indicates expected revenue for showing the ad to a viewer having actual profile information corresponding to the target profile information associated with the bid. The ad scheduler is configured to schedule which of the plurality of ads is received by which of a plurality of viewers based on the actual profile information of the plurality of viewers and the bidding information such that an ad scheduled for one of the plurality of viewers is influenced by a correspondence of the scheduled ad to others of the plurality of viewers. | 02-10-2011 |
20110090911 | METHOD AND APPARATUS FOR TRANSPARENT CLOUD COMPUTING WITH A VIRTUALIZED NETWORK INFRASTRUCTURE - A capability is provided for providing transparent cloud computing with a virtualized network infrastructure. A method for enabling use of a resource of a data center as an extension of a customer network includes receiving, at a forwarding element (FE), a packet intended for a virtual machine hosted at an edge domain of the data center, determining a VLAN ID of the VLAN for the customer network in the edge domain, updating the packet to include the VLAN ID of the VLAN for the customer network in the edge domain, and propagating the updated packet from the FE toward virtual machine. The edge domain supports a plurality of VLANs for a respective plurality of customer networks. The packet includes an identifier of the customer network and a MAC address of the virtual machine. The VLAN ID of the VLAN for the customer network in the edge domain is determined using the identifier of the customer network and the MAC address of the virtual machine. The FE may be associated with the edge domain at which the virtual machine is hosted, an edge domain of the data center that is different than the edge domain at which the virtual machine is hosted, or the customer network. Depending on the location of the FE at which the packet is received, additional processing may be provided as needed. | 04-21-2011 |
20130254248 | Method And Apparatus For A Distributed File System In A Cloud Network - Various embodiments provide a method and apparatus of providing a distributed network file system in a cloud network that provides performance guarantees in cloud storage that are independent of the accessed files and the access locations. A client's file system is provisioned using a file placement strategy that is based on client's access locations and determined maximum access bandwidths and does not require knowledge of file access patterns. | 09-26-2013 |
Patent application number | Description | Published |
20080212763 | Network-based methods and systems for responding to customer requests based on provider presence information - An “always-on” network and associated systems enable customers to compare and select products and services offered by one or more providers faster than previously thought possible. In addition, communication connections may be established between customers and providers in real-time. | 09-04-2008 |
20090291763 | APPARATUS AND METHOD FOR FAIR MESSAGE EXCHANGES IN DISTRIBUTED MULTI-PLAYER GAMES - The Fair-Order Service of the present invention delivers action messages to the server as soon as it is feasible. Because action messages from different players exhibit different reaction times with respect to an update message, the Fair-Ordering Service executed at the server dynamically enforces a sufficient waiting period on each action message to guarantee the fair processing of all action messages. In reality, the waiting period at the server is bounded because of the real-time nature of interactive games. The algorithms that offer Fair Ordering Service take into consideration delayed and out-of-order action messages. When action messages corresponding to multiple update messages are interleaved, the Fair-Ordering Service matches the action message to the appropriate update message. It accomplishes this by maintaining a window of update messages and using the reaction times for an action message for each of the update messages in the window. This enables state changes at the game server to be performed with fairness to all the players. The Fair-Order Service invention is based on a framework that uses a proxy architecture making it transparent to any specific game application. The service is well suited to client-server based, online multi-player games, where a fair order of player actions is critical to the game outcome. | 11-26-2009 |
20100125883 | CREATING CHANNEL SEQUENCE SEGMENTS FOR FAST CHANNEL CHANGE IN IPTV - Embodiments of the present invention are methods for selecting, out of a lineup of IPTV channels, a subset of channels for caching. The methods take into account viewers' tendency to walk through the channels that lie between their current channel and their desired channel if that walking distance is short, and, alternatively, viewers' tendency to jump to a distant channel. Accordingly, embodiments of the present invention include any channel selection method which selects for caching any number of channels less than the entire lineup, and where at least two of those channels form a segment of adjacent channels. Other embodiments include methods which rely upon specific extrinsic data, e.g., IGMP and EPG information, for selecting a subset of channels to be cached. | 05-20-2010 |
20100251290 | ADVERTISEMENT SCHEDULING IN A PACKET-BASED MEDIA-DELIVERY SYSTEM - In one embodiment, a scheme for the display of targeted and personalized advertisements in a packet-based media-delivery system, such as an Internet Protocol Television (IPTV) service. An Internet keyword-based advertisement-bidding model is used to place the most-appropriate IPTV advertisements for viewers depending on their interests as determined through the users' Internet activities, while maximizing advertising revenue for the IPTV service provider. One method for scheduling an advertisement for rendering in one or more time slots in packet-based media programming comprises: (a) obtaining at least one keyword from one or more Internet sessions corresponding to at least one user; (b) receiving a plurality of bid amounts corresponding to a plurality of available advertisements for the one or more time slots; and (c) scheduling, based on the at least one keyword and at least one of the bid amounts, the advertisement to be rendered to the at least one user in the one or more time slots. | 09-30-2010 |
20110009196 | APPARATUS AND METHOD FOR FAIR MESSAGE EXCHANGES IN DISTRIBUTED MULTI-PLAYER GAMES - The Fair-Order Service of the present invention delivers action messages to the server as soon as it is feasible. Because action messages from different players exhibit different reaction times with respect to an update message, the Fair-Ordering Service executed at the server dynamically enforces a sufficient waiting period on each action message to guarantee the fair processing of all action messages. In reality, the waiting period at the server is bounded because of the real-time nature of interactive games. The algorithms that offer Fair Ordering Service take into consideration delayed and out-of-order action messages. When action messages corresponding to multiple update messages are interleaved, the Fair-Ordering Service matches the action message to the appropriate update message. It accomplishes this by maintaining a window of update messages and using the reaction times for an action message for each of the update messages in the window. This enables state changes at the game server to be performed with fairness to all the players. The Fair-Order Service invention is based on a framework that uses a proxy architecture making it transparent to any specific game application. The service is well suited to client-server based, online multi-player games, where a fair order of player actions is critical to the game outcome. | 01-13-2011 |
20120284727 | Scheduling in Mapreduce-Like Systems for Fast Completion Time - A method and system for scheduling tasks is provided. A plurality of lower bound completion times is determined, using one or more computer processors and memory, for each of a plurality of jobs, each of the plurality of jobs including a respective subset plurality of tasks. A task schedule is determined for each of the plurality of processors based on the lower bound completion times. | 11-08-2012 |
20130060601 | PRIVACY-PRESERVING ADVERTISEMENT TARGETING USING RANDOMIZED PROFILE PERTURBATION - A distribution and scheduling system for advertisements that targets ads to users and maximizes service-provider revenue without having full knowledge of user-profile information. Each user device stores a user profile and is pre-loaded with a set of ads that could possibly be shown during a timeslot. Each user device selects and displays an ad based on the user profile but does not identify the selected ad to the service provider. Instead, the user devices provide perturbed user-profile information in the form of Boolean vectors, which the service provider uses in conjunction with a guaranteed-approximation online algorithm to estimate the number of users that saw a particular ad. Thus, the service provider can charge advertisers for the number of times their ads are viewed, without knowing the users' profiles or which ads were viewed by individual users, and users can view the targeted ads while maintaining privacy from the service provider. | 03-07-2013 |
20130290539 | RESOURCE PLACEMENT IN NETWORKED CLOUD BASED ON RESOURCE CONSTRAINTS - Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the cloud controller, a request message including a first request for a first cloud resource; identifying a set of potential devices for providing the first cloud resource; calculating a plurality of weight values corresponding to at least a portion of the set of potential devices for providing the first cloud resource, wherein the plurality of weight values are calculated based on a plurality of delta values associated with the at least a portion of the set of potential devices; selecting a device based on the plurality of weight values to provide the first cloud resource; and updating the delta value associated with the selected device. | 10-31-2013 |
20140089510 | JOINT ALLOCATION OF CLOUD AND NETWORK RESOURCES IN A DISTRIBUTED CLOUD SYSTEM - A capability is provided for allocating cloud and network resources in a distributed cloud system including a plurality of data centers. A request for resources is received. The request for resources includes a request for cloud resources and an indication of an amount of cloud resources requested. The request for resources also may include a request for network resources or one or more constraints. A set of feasible resource mappings is determined based on the request for resources and information associated with the distributed cloud system. A resource mapping to use for the request for resources is selected from the set of feasible resource mappings. The selected resource mapping includes a mapping of the requested cloud resources to cloud resources of one or more of the data centers and an identification of network resources configured to support communications for the cloud resources of the one or more data centers. | 03-27-2014 |