International Business Machines Corporation

Sushma Bharat Patel

Christina Karen Lauridsen

Loulwa F Salem

Robert Ross Peterson

Timothy R Chavez

Lisa A Seacat

Shaw-Ben Shi

Jinfang Chen

Lisa Seacat DeLuca

Irgelkha Mejia

Ronald Bruce Baker

Benjamin Nelson Jeffcoat

Joseph Arcuri Anthony

A method, system, and computer usable program product for dynamic grouping of email recipients are provided in the illustrative embodiments. A first recipient and a second recipient of a first email are identified and an association is formed between them. A selection of the first recipient is detected in a second email. Using the association, the second recipient is suggested as a recipient of the second email. The first email may be a previously sent email, and the second email may be an email being composed. A characteristic of the first email is identified and the characteristic may be used as a basis for the association in forming the association. The characteristic may be a phrase in, a type of content in, an attachment in, or a periodicity of the first email. Strength of the association may be modified based on the third email.

Dynamic grouping of email recipients

A peer-to-peer file sharing client with background file sharing is provided in a segmented peer-to-peer file sharing network. A user may elect to 'tag' a torrent when a new file is submitted to the peer-to-peer system. A user may view the various tags with one or more file fragments that the user is hosting in the background. The user may view the tags for all fragments being shared in the background and search the tags. The peer-to-peer system may store metadata tags for the torrents in a central repository, such as a relational database, or in a distributed hash table.

Mapping file fragments to file information and tagging in a segmented file sharing system

A computer implemented method, data processing system, and computer program product for allowing users with minimal database skills to produce efficient, extended configuration management databases. Input is received from a user to extend a configuration management database, wherein the input includes a generic data type. The generic data type is mapped to a database data type of the configuration management database. An SQL statement is then generated to create the database data type in the configuration management database. Responsive to a successful execution of the SQL statement, the tables in the configuration management database are updated with the database data type to reduce a number of tables created for the database data type.

Extending configuration management databases using generic datatypes

A mechanism is provided for distributing file fragments in the background of a segmented peer-to-peer network using list passing between peers. Rather than trading actual content, peers may trade file names or file fragment identifiers. Upon receiving a new file name or identifier, a peer may request that file from the network, either in the background or the foreground. For example, once a client begins background file sharing in a swarm, the client may propagate file information for files it possesses to all or a portion of the peers in a swarm. Those clients then have the file information for a file without the user having to locate and specifically request that file. The file list may piggyback on a file fragment that is transferred as a result of a file sharing request.

List passing in a background file sharing network

A mechanism is provided for file fragment pricing in a segmented file sharing system. The mechanism allows peers to set a price for distributing a file through the file sharing system. A peer then becomes a file distributor on behalf of an original file provider. The original file provider may compensate the file distributor based on a compensation agreement. The peer's client may be configured to download file fragments from file distributors, or the original file provider, based on preferences, such as price, peer rating, upload speed, or similarity. As a result, a peer may download a file for a price that is less than the original price from the original file provider. Thus, the mechanism provides an incentive for peers to participate in file sharing, which results in larger swarms.

File fragment pricing in a segmented file sharing network

Computer implemented method, system and computer usable program code for processing a data object, for example, for searching for, creating or updating a data object. A computer implemented method for processing a data object includes receiving a request for the data object. A static portion and a dynamic portion for the data object are determined, and an instruction for the static portion and an instruction for the dynamic portion are processed separately. To search for a data object, a result from processing an instruction for the static portion and a result from processing the instruction for the dynamic portion are merged to form a hybrid data object. To create or update a data object, a result from processing an instruction for the static portion and a result from processing the instruction for the dynamic portion is saved in a database.

Hybrid data object model

A peer-to-peer file sharing client with background file sharing is provided in a segmented peer-to-peer file sharing network. Each file sharing participant may designate an amount of bandwidth and/or storage space for background file sharing. Peer-to-peer file sharing clients then share file data and content in the background automatically. The client may participate in additional swarms, in the background, to generally increase the number of peers in file sharing networks, thus increasing the speed of downloading desired files for other users.

Background file sharing in a segmented peer-to-peer file sharing network

A method, apparatus, and computer usable program product for managing received calls. In response to receiving a first call from a user, the process stores a record of the first call in a table of received calls. Thereafter, in response to receiving a second call from the user within a predefined period of time after the first call was prematurely disconnected, the process identifies a second call as a prematurely terminated call. The process then places the prematurely terminated call in a queue of calls according to a set of configurable criteria and updates the record of the first call with a progress of the prematurely terminated call.

Managing received calls

Peer-to-peer file sharing clients share file fragments in the background based on rarity values. When a first peer offers a fragment to a second peer to be shared in the background, the second peer checks the rarity of the fragment and identifies one or more fragments from its swarm that is approximately as rare as the fragment being offered. The second peer then offers the one or more fragments in exchange for the originally offered fragment. The first peer may then offer the one or more fragments to other peers in its swarm to be shared in the background.

File fragment trading based on rarity values in a segmented file sharing system

In accordance with one illustrative embodiment, when a file is moved from the background to the foreground in a peer-to-peer client, the client makes a local request for file pieces. The client sends a handshake message to itself to check for available pieces. The client then exchanges messages locally the same way it would with external peers. As an alternative approach to local message passing, the client may keep a local record of file fragments in a data structure, such as a markup language document or other data repository. The client may then query the data structure for needed file fragments before submitting a request to the peer-to-peer network. Every time a new file segment is downloaded and validated in the background, or the foreground, the peer-to-peer client may update the data structure. Then, the client may simply query the data structure for the specific segment it wishes to download.

Growing community of inventors

Austin, TX, United States of America

Sushma Bharat Patel