Abstract:
Sessions, such as on-line gaming sessions, are maintained by proxy agents on behalf of users even when the users are inactive. The agents, along with other components, form a novel "always-on" architecture that greatly reduces the time it takes to initiate and carry out sessions.
Abstract:
A group key management system (20) and method for providing secure many-to-many communication is presented. The system (20) employs a binary distribution tree structure (26). The binary tree (26) includes a first internal node having a first branch and a second branch depending therefrom. Each of the branches includes a first member (22, 22a) assigned to a corresponding leaf node. The first member (22, 22a) has a unique binary ID (24) that is associated with the corresponding leaf node to which the first member (22, 22a) is assigned. A first secret key (28) of the first member (22, 22a) is operable for encrypting data to be sent to other members (22, 22a). The first member (22, 22a) is associated with a key association group (33) that is comprised of other members (22, 22a). The other members (22, 22a) have blinded keys (30). A blinded key (30) derived from the first secret key (28) of the first member (22, 22a) is transmitted to the key association group (33). Wherein, the first member (22, 22a) uses the blinded keys (30) received from the key association group (33) and the first secret key (28) to calculate an unblinded key of the first internal node. The unblinded key is used for encrypting data that is communicated between members (22, 22a) located on branches depending from the first internal node.
Abstract:
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.
Abstract:
Intuitive indicators are presented to the user of a communications device in order to reduce the time it takes the user to launch an application and carry out a communication session, such as an on-line game. Each indicator may be updated by an agent that acts as a proxy for the device even when the device is inactive. Some examples of the indicators presented are: those individuals presently available to play a specific game with the user; the games that are played most often by the user; and those individuals that the user plays games with most often.
Abstract:
A logical tree structure (10) and method for managing membership in a multicast group provides scalability and security from internal attacks. The structure defines key groups (20) and subgroups (24, 22), with each subgroup having a subgroup manager (12, 14, 18). Dual encryption allows the sender (12) of the multicast data to manage distribution of a first set of encryption keys whereas the individual subgroup managers (12, 14, 18) manage the distribution of a second set of encryption keys. The two key sets allow the sender (12) to delegate much of the group management responsibilities without compromising security because a key from each set is required to access the multicast data. Security is further maintained via a method in which subgroup managers (12, 14, 18) can be either members (18) or participants (14). Access to both keys is provided to members (18) whereas access to only one key is provided to participants (14). Nodes can be added without generating a new encryption key at the top level which provides improved scalability.
Abstract:
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.
Abstract:
Sessions, such as on-line gaming sessions, are maintained by proxy agents on behalf of users even when the users are inactive. The agents, along with other components, form a novel "always-on" architecture that greatly reduces the time it takes to initiate and carry out sessions.
Abstract:
The invention includes a method and apparatus for regenerative signaling. Specifically, the method includes receiving at least one base protocol message formatted in accordance with at least one base protocol, obtaining service information associated with at least one network service, and generating, in response to the at least one base protocol message, at least one companion protocol message formatted in accordance with at least one companion protocol. The at least one base protocol message is associated with at least one service endpoint. The service information associated with at least one network service is obtained using the at least one base protocol message. The at least one companion protocol message is generated using at least a portion of the service information. The at least one companion protocol message is operable for controlling the at least one network service in a manner substantially transparent to the at least one service endpoint.
Abstract:
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.
Abstract:
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.