Abstract: Techniques described herein enable peers to determine each peer's NAT type much more efficiently and quickly than when compared with existing techniques. To do so, a peer simultaneously sends multiple test messages to a server. The peer then waits to either receive a response for each of the multiple test messages or may store an indication that no response has been received after a predetermined timeout period. The peer then analyzes the received responses and/or the stored timeout indications to determine the peer's NAT type or to determine that the peer is operating free from concealment by a NAT/firewall device. By simultaneously sending the multiple test messages, the peer may determine the NAT type within a maximum time defined by the predetermined timeout period or a roundtrip time period that is required for communication between the peer and the server. As such, the tools allow for efficient NAT-type detection.

Abstract: Techniques for streaming media packets in a peer-to-peer network are disclosed.

Abstract: This document describes a directed graph model using a peer-to-peer overlay structure and a gossip-based protocol to maintain the distributed membership. A protocol suite for peers to join the live streaming session, form the P2P streaming overlay, and exchange video packets with others has also been presented. The different capabilities of the heterogeneous peers are well depicted using an adaptive out-degree mechanism. The performance of the whole system is maintained by a contribution-aware mechanism, which ensures that the peers with large contribution will get more chance to be served than those with small or no contribution.

Abstract: An end-to-end lecture broadcast system (LBS) is described. The LBS system typically comprises three modules: a schedule module, a capture module and a transmission module. The schedule module is comprised of a scheduler that is implemented as a software add-on on the lecture host's computing device, a schedule server, and a schedule agent component in the uploading peer to provide for channel based management. The capture module is comprised of a video camera for capturing video content, one or more microphones for capturing audio content, and a VGA signal capture for capturing presentation materials. The transmission module is comprised of an uploading peer and a web server. The uploading peer is responsible for transmitting video/audio content to the Internet/intranet using peer-to-peer (P2P) streaming technology. The web server is responsible for the delivery of captured presentation materials and for ensuring the synchronous play back of video/audio content and presentation materials.

Abstract: Video data from an upload client is received at a hosting node. A request from a download client is received at a bootstrapping node to receive the video data. The download client to receive the video data directly from the hosting node when the hosting node is below a threshold, wherein the threshold is based at least in part on the maximum number of download clients the hosting node can stream to simultaneously. The download client to receive the video data from peers in a peer-to-peer overlay when the hosting node above the threshold.

Abstract: This document describes a directed graph model using a peer-to-peer overlay structure and a gossip-based protocol to maintain the distributed membership. A protocol suite for peers to join the live streaming session, form the P2P streaming overlay, and exchange video packets with others has also been presented. The different capabilities of the heterogeneous peers are well depicted using an adaptive out-degree mechanism. The performance of the whole system is maintained by a contribution-aware mechanism, which ensures that the peers with large contribution will get more chance to be served than those with small or no contribution.

Abstract: This document describes a directed graph model using a peer-to-peer overlay structure and a gossip-based protocol to maintain the distributed membership. A protocol suite for peers to join the live streaming session, form the P2P streaming overlay, and exchange video packets with others has also been presented. The different capabilities of the heterogeneous peers are well depicted using an adaptive out-degree mechanism. The performance of the whole system is maintained by a contribution-aware mechanism, which ensures that the peers with large contribution will get more chance to be served than those with small or no contribution.

Abstract: Method and system for altering a sending rate of media packets in a peer-to-peer network that includes a client node and a plurality of serving peer nodes.

Abstract: Techniques described herein perform network address translator (NAT) traversal using a peer of a peer-to-peer architecture in lieu of a server. A first peer maintains a list of public domain peers that are not hidden behind a NAT or a firewall and have previously been connected with the first peer. The first peer distributes the list to other peers via a gossip-based protocol. When a second peer desires to connect with the first peer, the second peer initiates a connection with the first peer and sends a request to a public domain peer of the list, requesting that the public domain peer instruct the first peer to initiate a connection with the second peer. By leveraging a public domain peer to establish a connection between the first and second peers, these techniques lessen the burden on the server of the architecture. Furthermore, because different peers may make requests to different public domain peers, the techniques allow for better scalability of the architecture.

Abstract: Video data from an upload client is received at a hosting node. A request from a download client is received at a bootstrapping node to receive the video data. The download client to receive the video data directly from the hosting node when the hosting node is below a threshold, wherein the threshold is based at least in part on the maximum number of download clients the hosting node can stream to simultaneously. The download client to receive the video data from peers in a peer-to-peer overlay when the hosting node above the threshold.

Abstract: An end-to-end lecture broadcast system (LBS) is described. The LBS system typically comprises three modules: a schedule module, a capture module and a transmission module. The schedule module is comprised of a scheduler that is implemented as a software add-on on the lecture host's computing device, a schedule server, and a schedule agent component in the uploading peer to provide for channel based management. The capture module is comprised of a video camera for capturing video content, one or more microphones for capturing audio content, and a VGA signal capture for capturing presentation materials. The transmission module is comprised of an uploading peer and a web server. The uploading peer is responsible for transmitting video/audio content to the Internet/intranet using peer-to-peer (P2P) streaming technology. The web server is responsible for the delivery of captured presentation materials and for ensuring the synchronous play back of video/audio content and presentation materials.

Abstract: The described systems and methods can be used to estimate the global distributed kernel density without prior information of data using a gossip based method. In the gossip based method, a node in a distributed network periodically selects and exchanges kernels with a random node in the network. After exchanging, both the initiating and the target node use the received kernels to update their local estimates. In addition, a data reduction method can be used to optimize the size of the kernel set at each node.

Abstract: Method and system for altering a sending rate of media packets in a peer-to-peer network that includes a client node and a plurality of serving peer nodes.

Abstract: Techniques for streaming media packets in a peer-to-peer network are disclosed.

Abstract: This document describes a directed graph model using a peer-to-peer overlay structure and a gossip-based protocol to maintain the distributed membership. A protocol suite for peers to join the live streaming session, form the P2P streaming overlay, and exchange video packets with others has also been presented. The different capabilities of the heterogeneous peers are well depicted using an adaptive out-degree mechanism. The performance of the whole system is maintained by a contribution-aware mechanism, which ensures that the peers with large contribution will get more chance to be served than those with small or no contribution.

Abstract: Techniques described herein enable peers to determine each peer's NAT type much more efficiently and quickly than when compared with existing techniques. To do so, a peer simultaneously sends multiple test messages to a server. The peer then waits to either receive a response for each of the multiple test messages or may store an indication that no response has been received after a predetermined timeout period. The peer then analyzes the received responses and/or the stored timeout indications to determine the peer's NAT type or to determine that the peer is operating free from concealment by a NAT/firewall device. By simultaneously sending the multiple test messages, the peer may determine the NAT type within a maximum time defined by the predetermined timeout period or a roundtrip time period that is required for communication between the peer and the server. As such, the tools allow for efficient NAT-type detection.

Abstract: Techniques described herein perform network address translator (NAT) traversal using a peer of a peer-to-peer architecture in lieu of a server. A first peer maintains a list of public domain peers that are not hidden behind a NAT or a firewall and have previously been connected with the first peer. The first peer distributes the list to other peers via a gossip-based protocol. When a second peer desires to connect with the first peer, the second peer initiates a connection with the first peer and sends a request to a public domain peer of the list, requesting that the public domain peer instruct the first peer to initiate a connection with the second peer. By leveraging a public domain peer to establish a connection between the first and second peers, these techniques lessen the burden on the server of the architecture. Furthermore, because different peers may make requests to different public domain peers, the techniques allow for better scalability of the architecture.

Abstract: Video data from an upload client is received at a hosting node. A request from a download client is received at a bootstrapping node to receive the video data. The download client to receive the video data directly from the hosting node when the hosting node is below a threshold, wherein the threshold is based at least in part on the maximum number of download clients the hosting node can stream to simultaneously. The download client to receive the video data from peers in a peer-to-peer overlay when the hosting node above the threshold.

Abstract: The described systems and methods can be used to estimate the global distributed kernel density without prior information of data using a gossip based method. In the gossip based method, a node in a distributed network periodically selects and exchanges kernels with a random node in the network. After exchanging, both the initiating and the target node use the received kernels to update their local estimates. In addition, a data reduction method can be used to optimize the size of the kernel set at each node.

Abstract: Video data from an upload client is received at a hosting node. A request from a download client is received at a bootstrapping node to receive the video data. The download client to receive the video data directly from the hosting node when the hosting node is below a threshold, wherein the threshold is based at least in part on the maximum number of download clients the hosting node can stream to simultaneously. The download client to receive the video data from peers in a peer-to-peer overlay when the hosting node above the threshold.