摘要:
Embodiments of the present invention provide an approach for a publisher-assisted, broker-based cache that can be utilized to reduce a volume of data (e.g., network traffic) delivered between a publisher and broker in a publication/subscription (pub/sub) environment. Specifically, in a typical embodiment, when a message is being generated on a publisher system, the publisher system will determine if the message includes a set of data that has a potential to be repeated in subsequent messages. Once such a set of data has been identified, the set of data will be associated/marked/tagged (e.g., in the message) with a unique identifier/cache key corresponding thereto (i.e., to yield a modified message). The modified message will be sent to a broker system, which will detect/locate the unique identifier, cache the corresponding data, and send the message along to any applicable subscriber systems. When a subsequent message that is supposed to contain the cached set of data is generated, the publisher system will instead substitute the unique identifier for the set of data to yield an abbreviated message and send the abbreviated message to the broker system. Upon receipt, the broker system will detect/locate the unique identifier, retrieve the corresponding set of data from the cache, replace the unique identifier with the set of data to yield a completed message, and then send the completed message to the applicable subscriber systems.
摘要:
In general, embodiments of the present invention provide an approach for caching potentially repetitive data in a publication-subscription (pub/sub) system. Specifically, in a typical embodiment, when a message is received on a broker system from a publisher system, the broker system analyzes the message for potentially repetitive data. Such data can be determined from historical messages (e.g., determining that a certain set of data appeared in multiple messages and is thus flagged in a database or the like), a set of rules (e.g., if data set “Y” appears, flag it as potentially repetitive), etc. Regardless, once such a set of data has been identified, the set of data will be tagged/marked in the message with a unique identifier. The message and inserted unique identifier is then sent to the relevant subscriber system(s). Upon receiving the message, the subscriber system(s) will analyze the message, identify the unique identifier, and cache the tagged data. Thereafter, when the publisher system receives another message that contains the same set of data that was previously tagged, the publisher system will substitute the unique identifier for the repeated data to yield an abbreviated message. The publisher system will then send the abbreviated message to the subscriber system(s), which will analyze the abbreviated message, identify the unique identifier, and retrieve the associated data from cache. Thus, the substitution of unique identifiers for potentially repetitive data can avoid unnecessary communication of data and reduce overall network bandwidth consumption.
摘要:
A privilege discriminator selects a first user to be in a first group of participants to participate in a screen sharing session. The privilege discriminator selects at least one second user to be in a second group of participants to participate in a screen sharing session. The privilege discriminator selects a first screen region for sharing to at least the first group of participants and selects a second screen region for sharing only to the second group of participants. The privilege discriminator shares the first screen region with at least the first group of participants, wherein the sharing is selecting a device authenticated as being used by one of the first group of participants. The presentation privilege discriminator sharing the second screen region with only the second group, based on selecting the second screen region and selecting the second group, excludes the first group from receiving the second screen region.
摘要:
A mechanism for determining an optimal compression technique for each data file when creating a computer archive file from a set of data files. A local archiving application receives an instruction to archive a set of data files and determines the file type and size of a data file in the set of data files. An optimal compression method for the data file is selected based on the file type and size of the data file. The archiving application compresses the data file using the optimal compression method. The archiving application updates meta data associated with the compressed file to include a meta compression format identifier of the optimal compression method used to compress the data file. The archiving application then repeats the determining, selecting, compressing, and updating for each data file in the set of data files to create an archive of the set of data files.
摘要:
A server receives a sound file corresponding to a sound corresponding to a media file. The server compares the sound file to a library of media file sound recordings to identify a media file and a matching position in the media file of a final sound in the sound file. The server determines, from a data structure of media abbreviations, a media abbreviation that corresponds to a final sound data present in the sound file. The server transmits the media abbreviation to the addressable device.
摘要:
An addressable device receives a user-characterized rewind description. The addressable device stores the user-characterized rewind description. The addressable device renders an at least one media file to include a resume point of the at least one media file. The addressable device receives a command to preferentially rewind. The addressable device, responsive to receiving the command to preferentially rewind, re-renders the at least one media file to the user-characterized rewind description such that the display shows the at least one media file at a replay point of the media file at least the user-characterized rewind description prior to the resume point.
摘要:
In general, embodiments of the present invention provide an approach for caching potentially repetitive data in a publication-subscription (pub/sub) environment. Specifically, in a typical embodiment, when a message is received on a broker system from a publisher system, the broker system analyzes the message for potentially repetitive data. Once such a set of data has been identified, the set of data will be cached, and a unique identifier/tag corresponding thereto will be sent to the publisher system and to applicable subscribers. Thereafter, any subsequent message including the same data will contain the unique identifier in place of the cached data (i.e., an abbreviated message). The abbreviated message can be sent from the publisher system to the broker system, and then onto the subscriber system, which will retrieve the data from the shared cache and replace the unique identifier with the cached data to yield a complete message.
摘要:
Embodiments of the present invention provide an approach for broker facilitated, publisher peer-to-peer (P2P) collaboration in a publish-subscription (pub/sub) environment. Specifically, in a typical embodiment, a broker system acts as an intermediary between publisher systems and subscriber systems in the pub/sub environment. Along these lines, the broker creates an administrative communication channel between known publisher systems and the broker system. Using this administrative communication channel, the broker system informs individual publisher systems about other publisher systems such that peer-to-peer communication channels between two or more publisher systems can be established. This can be accomplished using the broker system's knowledge of data being published by the individual publisher systems. Regardless, the publisher systems can then use information received from the broker system to: establish a P2P communication channel with one or more other publishers; identify a set of data that has commonality to the peers (and thus has a potential to be cached); and negotiate a caching schema/approach to store the data in a cache. The broker system may generate a set of cache key/unique identifiers and communicate the unique identifiers to at least one of the publisher peers, which will then share the unique identifiers among the peers. The set of data will then be cached (e.g., by a publisher system, a broker system and/or a subscriber system) using the unique identifiers.
摘要:
An audio/video recording method and system is provided. The method includes receiving by a processor of an audio/video recording device, a request for recording broadcast audio/video data. The processor analyzes audio/video presentation capabilities for audio/video presentation devices and formats of a first group of broadcast audio/video files associated with the broadcast audio/video data. Results of the analysis are compared and in response a first audio/video file is selected from the first group of broadcast audio/video files. The first audio/video file includes a first format requiring a first amount of storage space within a storage device of the audio/video recording device. The first format is associated with the audio/video presentation capabilities of a first audio/video presentation device and the first audio/video file is recorded.
摘要:
In general, embodiments of the present invention provide an approach for caching potentially repetitive data in a publication-subscription (pub/sub) environment. Specifically, in a typical embodiment, when a message is received on a broker system from a publisher system, the broker system analyzes the message for potentially repetitive data. Such data can be determined from historical messages (e.g., determining that a certain set of data appeared in multiple messages and is thus flagged in a database or the like), a set of rules (e.g., if data set “Y” appears, flag it as potentially repetitive), etc. Regardless, once such a set of data has been identified, the set of data will be cached, and a unique identifier/tag corresponding thereto will be sent to the publisher system and to applicable subscribers. Thereafter, any subsequent message including the same data will contain the unique identifier in place of the cached data (i.e., an abbreviated message). The abbreviated message can be sent from the publisher system to the broker system, and then onto the subscriber system, which will retrieve the data from the shared cache and replace the unique identifier in the abbreviated message with the cached data to yield a complete message. Thus, once data has been cached, there is only a need to send an abbreviated message, which will save network bandwidth.