Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A method, system, and computer-readable medium embodying a computer program for securing a communication against access by unintended users is presented. A communication is initiated from a person using an originating telecommunication device to an intended receiving wireless telecommunication device. In response to the communication failing to connect to the intended receiving wireless telecommunication device, a telecommunications host carrier provider may re-route the communication to an alternate telecommunication device. A business authentication logic of the host carrier then determines any security or quality of service filters established by the user of the originating telecommunication device prior to the communication being initiated to prevent unintended users from accessing the communication. Upon the business authentication logic of the host carrier authorizing the communication, the communication is encrypted and re-routed to the alternate telecommunication device.

Abstract: A method, system, and computer program for routing an outgoing communication in real time is presented. A communication is received from a caller to an intended receiving wireless telecommunication device. In response to the communication failing to connect to the intended receiving wireless telecommunication device, scan of other alternate telecommunication devices is initiated to determine if other communication devices are available for receiving a re-route of the original communication. If an alternate telecommunication device is available to receive the communication, then the communication is rerouted to the preferred alternate telecommunication device based on the alternate telecommunication device being a mutual contact of the contact list of the caller telecommunication device and the mapping profile of the intended receiving telecommunication device.

Abstract: A method, system, and computer program for routing an incoming voice call in real time is presented. A call is received from a caller to an intended receiving wireless telecommunication device. In response to the call failing to connect to the intended receiving wireless telecommunication device, a short range wireless query signal is transmitted to determine if another wireless communication device is within a predefined proximity to the intended receiving wireless telecommunication device. If the intended receiving wireless telecommunication device receives a response from the other wireless telecommunication device indicating that the other wireless telecommunication device is within the predefined proximity to the intended receiving wireless telecommunication device, then the call is rerouted to the other wireless telecommunication device based on preferences internal to the intended receiving wireless device.

Abstract: A method, system, and computer program for routing an incoming voice call in real time is presented. A call is received from a caller to an intended receiving wireless telecommunication device. In response to the call failing to connect to the intended receiving wireless telecommunication device, a short range wireless query signal is transmitted to determine if an other wireless communication device is within a predefined proximity to the intended receiving wireless telecommunication device. If the intended receiving wireless telecommunication device receives a response from the other wireless telecommunication device indicating that the other wireless telecommunication device is within the predefined proximity to the intended receiving wireless telecommunication device, then the call is rerouted to the other wireless telecommunication device.

Abstract: A method, system, and computer program for routing an outgoing voice call in real time is presented. A call is received from a caller to an intended receiving wireless telecommunication device. In response to the call failing to connect to the intended receiving wireless telecommunication device, a caller initiated short range wireless query signal is transmitted to determine if an other wireless communication device is within a predefined proximity to the intended receiving wireless telecommunication device. If the intended receiving wireless telecommunication device receives a response from an other proximate telecommunication device indicating that the proximate telecommunication device is within the predefined proximity to the intended receiving wireless telecommunication device, then the call is rerouted to the proximate telecommunication device based on preferences internal to the caller telecommunication device.

Abstract: A method, system, and computer program for routing an outgoing communication in real time is presented. A communication is received from a caller to an intended receiving wireless telecommunication device. In response to the communication failing to connect to the intended receiving wireless telecommunication device, a host carrier initiated query of third party priority of contacts routing preferences of the intended receiving wireless telecommunication device is initiated to determine if other communication devices are available for receiving a re-route of the original communication. If third party routing preferences of the intended receiving wireless telecommunication device have previously been established, then the call is rerouted through one or more alternate telecommunication devices to the intended receiving wireless telecommunication device. The priority of contacts is stored with the host carrier.

Abstract: 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.

Abstract: A portal summary controller stores detected usage of at least one instance of at least one portlet application within at least one portal page at each of a plurality of different times. Responsive to a trigger to generate a summary portal page, the portal summary controller dynamically creates a summary portal page displaying a separate instance of the at least one portlet application for at least one of each of the plurality of different times specified according to the separate usage stored at each of the plurality of different times, such that the summary portal page provides a summary of at least a selection of previous usage of the at least one portal page. The trigger to generate a summary portal page includes a user selecting which previous stored portal usage, including usage of individual portlet applications, to summarize in the summary portal page, such that the summary portal page renders a summary of only that content selected by the user.

Abstract: A portal summary controller monitors usage metadata indicating current usage of at least one portlet within at least one portal page for one of multiple events specified to trigger storage of the usage metadata. Responsive to detecting one of the multiple events within the usage metadata which triggers storage, the portal summary controller stores the detected usage metadata at a current time of at least one instance of at least one portlet application within the at least one portal page.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.