Patent application number | Description | Published |
20080285654 | Multiview coding with geometry-based disparity prediction - Described herein is technology for, among other things, multiview coding with geometry-based disparity prediction. The geometry-based disparity prediction involves determining corresponding block pairs in a number of reconstructed images for an image being coded. The reconstructed images and the image represent different views of a scene at a point in time. Each corresponding block pair is projected on the image. This enables determination of disparity vector candidates. For each coding block of the image, a predicted disparity vector is determined based on the disparity vector candidates. Then, the predicted disparity vector may be utilized to obtain the bits to be encoded. The geometry-based disparity prediction reduces the number of encoded bits. | 11-20-2008 |
20080313188 | Distributed Kernel Density Estimation - 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. | 12-18-2008 |
20100142376 | Bandwidth Allocation Algorithm for Peer-to-Peer Packet Scheduling - 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. | 06-10-2010 |
20100146092 | Peer-to-Peer (P2P) Streaming Overlay Construction and Optimization - 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. | 06-10-2010 |
20100146099 | Network Address Translators (NAT) Type Detection Techniques - 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. | 06-10-2010 |
20100146126 | Peer-to-Peer Network Address Translator (NAT) Traversal Techniques - 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. | 06-10-2010 |
20100146136 | Peer-to-Peer Packet Scheduling Algorithm - Techniques for streaming media packets in a peer-to-peer network are disclosed. | 06-10-2010 |
20100250678 | PEER-TO-PEER AIDED LIVE VIDEO SHARING SYSTEM - 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. | 09-30-2010 |
20110083123 | AUTOMATICALLY LOCALIZING ROOT ERROR THROUGH LOG ANALYSIS - A computerized method for automatically locating a root error, the method includes receiving a first log having one or more log messages produced by one or more successful runs of a program, creating a finite state machine (FSM) from the first log of the program, the FSM representing an expected workflow of the program and creating a graph from the first log, the graph illustrating one or more dependencies between two or more components in the program. The method then includes receiving a second log produced by an unsuccessful run of the program, and determining, using a microprocessor, one or more root errors in the second log using the FSM and the graph. | 04-07-2011 |
20110296244 | LOG MESSAGE ANOMALY DETECTION - One or more techniques and/or systems are disclosed for detecting anomalies in a message log. A log message is parsed from an unstructured text string to a structured form, comprising messages signature and parameter values. Structured log messages that contain a same parameter value of a same program variable are grouped together. One or more invariants for are identified from respective types of log message groups. Invariants are applied to log sequences of respective log types. | 12-01-2011 |
20120030333 | Peer-to-Peer (P2P) Streaming Overlay Construction and Optimization - 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. | 02-02-2012 |