Abstract: A method for increasing bit-rate consumed by a consumer node in a real-time peer-to-peer (P2P) network delivering real-time multimedia content. The method comprises determining desirability to switch to a higher bit-rate consumption respective of a current bit-rate consumption; sending requests to resource nodes of the P2P network for supply of additional bandwidth to support a difference between the higher bit-rate consumption and the current bit-rate consumption; connecting to at least one resource node of the P2P network that can supply the additional bandwidth, thereby increasing bit-rate consumption; determining whether there are connection problems due to the increase in bit-rate consumption; and consuming from the at least one resource node the current bit-rate in addition to the additional bandwidth when no connection problems occur and it is established that the consumer node is capable of handling the higher bit-rate consumption of the real-time multimedia content.

Abstract: A method for broadcasting time sensitive content over an Internet protocol (IP) network for distribution in a peer-to-peer (P2P) network. The method comprises segmenting the time sensitive content into a plurality of segments; separating each segment of the plurality of segments into a plurality vectors; generating random linear combination equations respective of the plurality of vectors; interleaving equations of at least two different segments of the plurality of segments; and transmitting at least a portion of the equations over the IP network to at least one distribution node for the distribution of the time sensitive content in the P2P network, wherein the time sensitive content is recreated from the equations at least the distribution node.

Abstract: A method for dynamically adjusting resource nodes in a peer-to-peer (P2P) network including allocating an initial number of resource nodes to provide the time-sensitive content to a consumer node, each of the allocated resource nodes provides a portion of the time-sensitive content to the consumer node; checking if there is a need to receive at least an additional portion of the time-sensitive content from at least one reliable node of the P2P network, and if so, receiving the at least additional portion of the time-sensitive content from the at least one reliable node; and requesting an additional number of resource nodes to provide the at least portion of the time-sensitive content when an access to the at least one reliable node occurs more frequently than a first predetermined threshold value, thereby the number of resource nodes allocated to the consumer node is dynamically adjusted.

Abstract: A buffer for buffing multimedia content to enable reliable streaming of multimedia content in a peer-to-peer network. The buffer comprises a first section being loaded with a first portion of the multimedia content during a first time interval, wherein the first portion of the multimedia content is retrieved from at least one resource node; and a second section being loaded with a second portion of the multimedia content during a second time interval, wherein the second portion of the multimedia content is retrieved from at least one reliable node during a second time interval, wherein the buffer continuously delivers the multimedia content including the first and second portions thereof to a consumer node.

Abstract: A resource-node of a peer-to-peer (P2P) network adapted to manage the allocation of resources to channel swarms. Resource allocation is based on a distributed algorithm in which resource-nodes of the P2P network occasionally join and leave channel-swarms. Each resource-node independently decides whether or not to stay in the channel-swarm that it has joined to. These decisions are based on values of a transience parameter set by a transience mechanism of the resource-node.

Abstract: A method for controlling the provision of resource nodes for streaming multimedia content of a channel viewed by consumer nodes in a peer-to-peer network.

Abstract: A method for broadcasting time sensitive content over an Internet protocol (IP) network for distribution in a peer-to-peer (P2P) network. The method comprises segmenting the time sensitive content into a plurality of segments; separating each segment of the plurality of segments into a plurality vectors; generating random linear combination equations respective of the plurality of vectors; interleaving equations of at least two different segments of the plurality of segments; and transmitting at least a portion of the equations over the IP network to at least one distribution node for the distribution of the time sensitive content in the P2P network, wherein the time sensitive content is recreated from the equations at least the distribution node.

Abstract: A buffer for buffing multimedia content to enable reliable streaming of multimedia content in a peer-to-peer network. The buffer comprises a first section being loaded with a first portion of the multimedia content during a first time interval, wherein the first portion of the multimedia content is retrieved from at least one resource node; and a second section being loaded with a second portion of the multimedia content during a second time interval, wherein the second portion of the multimedia content is retrieved from at least one reliable node during a second time interval, wherein the buffer continuously delivers the multimedia content including the first and second portions thereof to a consumer node.

Abstract: A method for actively allocating available bandwidth to consumer nodes by a resource node delivering time-sensitive multimedia content in a peer-to-peer (P2P) network. The method comprises performing a check if the resource node can allocate bandwidth to at least one additional consumer node from the consumer nodes; selecting at least one consumer node from a list of consumer nodes addressable by the resource node; and sending an availability notification to each of the selected at least one consumer node from the list of consumer nodes.

Abstract: A method for loading a buffer of a consumer node operable in a system for streaming multimedia content. The method includes dividing the buffer to sections each section being filled with multimedia data during a different time interval; loading a first section of the buffer by accessing at least one resource node of the multimedia content during a first time interval; and loading a second section of the buffer by accessing at least one reliable node of the multimedia content during a second time interval; wherein the buffer continuously delivers the multimedia content to a display of the consumer node and wherein the at least one reliable node is adapted to guarantee delivery of multimedia content to connected nodes.

Abstract: A method for increasing bit-rate consumed by a consumer node in a real-time peer-to-peer (P2P) network delivering real-time multimedia content. The method comprises determining desirability to switch to a higher bit-rate consumption respective of a current bit-rate consumption; sending requests to resource nodes of the P2P network for supply of additional bandwidth to support a difference between the higher bit-rate consumption and the current bit-rate consumption; connecting to at least one resource node of the P2P network that can supply the additional bandwidth, thereby increasing bit-rate consumption; determining whether there are connection problems due to the increase in bit-rate consumption; and consuming from the at least one resource node the current bit-rate in addition to the additional bandwidth when no connection problems occur and it is established that the consumer node is capable of handling the higher bit-rate consumption of the real-time multimedia content.

Abstract: A method for dynamically allocating upload bandwidth to consumer nodes by a resource node that are communicatively connected by a channel-swarm in a peer-to-peer network. The method comprises periodically computing a dynamic quota value to determine a number of acceptable connections between the resource node and one or more of the consumer nodes connected by the channel-swarm; and allocating an available upload bandwidth to the one or more of the consumer nodes in the channel-swarm based on the computed dynamic quota value.

Abstract: A method for determining a quota for connecting a plurality of consumer nodes to a resource node. The method comprises periodically determining the quota of consumer nodes acceptable for receiving connection requests by the resource node; receiving a connection request from a consumer node to connect to the resource node; and determining based on the quota whether to accept the connection request. In one embodiment the resource node and the consumer nodes are connected in a realtime peer-to-peer network, and the resource node is adapted to distribute multimedia content to the consumer nodes over the network.

Abstract: A resource-node of a peer-to-peer (P2P) network adapted to manage the allocation of resources to channel swarms. Resource allocation is based on a distributed algorithm in which resource-nodes of the P2P network occasionally join and leave channel-swarms. Each resource-node independently decides whether or not to stay in the channel-swarm that it has joined to. These decisions are based on values of a transience parameter set by a transience mechanism of the resource-node.

Abstract: A method for dynamically adjusting resource nodes supplying time-sensitive content to a consumer node in a peer-to-peer (P2P) network. The method comprises allocating an initial number of resource nodes to provide the time-sensitive content to the consumer node, each of the allocated resource nodes provides a portion of the time-sensitive content to the consumer node; checking if there is a need to receive at least an additional portion of the time-sensitive content from at least one reliable node of the P2P network, and if so, receiving the at least additional portion of the time-sensitive content from the at least one reliable node; and requesting an additional number of resource nodes to provide the at least portion of the time-sensitive content when an access to the at least one reliable node occurs more frequently than a first predetermined threshold value, thereby the number of resource nodes allocated to the consumer node is dynamically adjusted.

Abstract: A method for controlling the provision of resource nodes for streaming multimedia content of a channel viewed by consumer nodes in a peer-to-peer network.

Abstract: A method for loading a buffer of a consumer node operable in a system for streaming multimedia content. The method includes dividing the buffer to sections each section being filled with multimedia data during a different time interval; loading a first section of the buffer by accessing at least one resource node of the multimedia content during a first time interval; and loading a second section of the buffer by accessing at least one reliable node of the multimedia content during a second time interval; wherein the buffer continuously delivers the multimedia content to a display of the consumer node and wherein the at least one reliable node is adapted to guarantee delivery of multimedia content to connected nodes.

Abstract: A method for managing the allocation of resources to channel swarms in a peer-to-peer (P2P) network. The method is based on a distributed algorithm in which resource-nodes occasionally join and leave channel-swarms. Each resource-node independently decides whether or not to stay in the channel-swarm that it has joined to. These decisions are based on values of a transience parameter set by a transience mechanism.

Abstract: A method for determining a quota for connecting a plurality of consumer nodes to a resource node. The method comprises periodically determining the quota of consumer nodes acceptable for receiving connection requests by the resource node; receiving a connection request from a consumer node to connect to the resource node; and determining based on the quota whether to accept the connection request. In one embodiment the resource node and the consumer nodes are connected in a realtime peer-to-peer network, and the resource node is adapted to distribute multimedia content to the consumer nodes over the network.

Abstract: A method for managing the allocation of resources to channel swarms in a peer-to-peer (P2P) network. The method is based on a distributed algorithm in which resource-nodes occasionally join and leave channel-swarms. Each resource-node independently decides whether or not to stay in the channel-swarm that it has joined to. These decisions are based on values of a transience parameter set by a transience mechanism.