Samsung Electronics Co., Ltd.

City University of New York

New York University

Verizon Patent and Licensing Inc.

Applied Materials, Inc.

Thomson Licensing

Motorola Corporation

Intel Corporation

At&t Intellectual Property I, L.p.

Nxp B.v.

Mitsubishi Electric Research Laboratories, Inc.

Yong Liu

Myung-Jong Lee

Xu-hui Hu

Jong-hun Park

Xuhui Hu

Ming Chen

Yang Guo

Dahai Ren

Matthias Brunner

Shivendra S Panwar

Benjamin M Johnston

Hung T Nguyen

Keith W Ross

Myung Jong Lee

Sriram Krishnaswami

Chun-hui Zhu

Chao Liang

Guibin Tian

Rittwik Jana

Philip Orlik

Edgar Herbert Callaway, Jr

Zafer Sahinoglu

Lakshman Krishnamurthy

Salvador P Umotoy

Ralph Michael Kling

Vinay K Shah

Jasmeet Chhabra

Gopalakrishna B Prabhu

Ji-Hoon Lee

Yang Xu

Ralf Schmid

Vernon Anthony Allen

Zhiyong Li

Chunhui Zhu

Stevan Harvey Leiden

Jeffrey S Sullivan

Yacov Elgar

Lance Eric Hester

Jin Young Yang

Tai T Ngo

Lei Zhang

Iwona Turlik

Tom Mathew

Di-An Hong

Dhruv Gajaria

Robert Margolies

Ludwig Ledl

Yu-jin Lim

Michael Marriott

Rajeev Kumar

Phil A Jamieson

Ayaskant Rath

John Visitacion

Peter Crundwell

Ho Gene Choi

Dennis C Pierce

Chenguang Yu

Xiwang Yang

William Beaton

Tae-kyung Kwon

Phil Rudland

Hao Hu

Zachary Smith

Weinin Xiao

Eun Il Seo

Aspects of the subject disclosure may include, for example, a wireless framework for delivering TV services. The wireless framework can include a mix of wireless access technologies (e.g. Satellite, WiFi and/or LTE overlay links). One or more aspects of the subject disclosure include injecting TV content into the network at a few locations (e.g., residential locations) using satellite antennas (e.g., satellite dishes). The content is then further distributed to other homes using a house-to-house WiFi network and/or via an overlay LTE network. Other embodiments are disclosed.

Method and apparatus for wireless distribution of TV services

A method and apparatus are described for scheduling content delivery in a peer-to-peer network, including receiving a message from a peer, classifying the received message, storing the classified message in one of a plurality of queues based on the classification, generating responses to messages based on a priority of the queue in which the classified message is stored and transmitting content to all peers in the peer-to-peer network. Also described are a method and apparatus for scheduling content delivery in a peer-to-peer network, including receiving one of a message and content from one of a content source server and a peer, classifying the received message, storing the classified message in one of a plurality of queues based on the classification, storing the received content, generating responses to messages based on a priority of the queue in which the classified message is stored and transmitting content to all other peers in the peer-to-peer network.

Queue-based adaptive chunk scheduling for peer-to-peer live streaming

The determination of user perceived delay in audio and video conferencing systems/services is described. Example embodiments consistent with the present invention measure delays in audio and/or video conferencing systems and services, by treating such systems and services as black boxes, thereby providing end-to-end delays as they would be perceived by users. For example, the user perceived round-trip delay in a video conference system/service may include time delays from each of video capture, video encoding, video transmission, video decoding and video rendering.

Determining user perceived delays in voice conferencing systems and video conferencing systems

A device includes a processor. The processor is configured to determine a hit time for each of a plurality of content items based on at least one of users' history of access to the content items on content distribution clusters in a content distribution network, the users' past ratings of the content items, and social network information associated with the users. The hit time of a content item indicates a number of times that the content item is likely to be accessed by the users. The processor is further configured to compute caching priorities of the content items based on a caching policy of the device and the determined hit times, and initiate a redistribution, over a network, of the plurality of content items over the content distribution clusters of the content distribution network based on the caching priorities.

Recommender system for content delivery networks

Method, device, and non-transitory storage medium to obtain program historical data and social network data associated with users that receive one or more programs via one or more channels; calculate a social similarity value; calculate a channel-interest similarity value; calculate a similarity index value based on the social similarity value and the channel-interest similarity value; calculate a program weight value for each program; calculate a stay-time, for each channel, that indicates a time period each of the users remained on each channel; calculate based on each program weight value, each stay-time, and each similarity index value, a channel weight for each channel; and select based on each channel weight, one or more channels to recommend to at least one of the users.

Social network-based automated program channel recommender

A method and apparatus are described including receiving buffer maps of neighbor peers, measuring serving rates from the neighbor peers, measuring serving rates to the neighbor peers, requesting a unit of data from one of the neighbor peers responsive to information in the buffer maps of the neighbor peers at a rate responsive to the serving rate from the one of the neighbor peers, receiving incoming requests for units of data, sorting the incoming requests into a plurality of queues, selecting one of the incoming requests to serve responsive to the serving rates to the neighbor peers corresponding to the incoming request, updating the queues and selecting a new neighbor peer.

Method and apparatus for peer-to-peer streaming of layered content

A server is configured to receive a request for content from a user of a user device. The server is configured further to obtain a group of bookmarks for the content, the group of bookmarks being obtained based on at least one of viewing behavior of the user or viewing behavior of another user. The server is configured further to provide the content and the group of bookmarks to the user.

Bookmarking system

A HCPS (hierarchically clustered P2P streaming system) comprising peers grouped into clusters and hierarchies. The HCPS actively balances the uploading capabilities among clusters and executes an optimal scheduling algorithm within each cluster to ensure that system resources are optimally utilized. The HCPS comprises an architecture which can be used in practical applications, yet can achieve the streaming rate close to the theoretical upper bound.

Hierarchically clustered P2P streaming system

A service list acquisition apparatus is provided for acquiring, from at least one service list provision apparatus located in a wireless network coverage area, a service list related to a wireless network which can embody a portion where a service list is exchanged with the service list provision apparatus in a layer lower than an Internet protocol (IP) layer, thereby acquiring the service list without an additional IP address allocation procedure.

Apparatus and method for acquiring service information in wireless network

A method for relaying a route request RREQ message by an intermediate node which is connected with at least one node using a tree topology in a mobile communication system including a destination node and a source node which sends the RREQ message to the destination node via at least one intermediate node, to thus establish an optimal route for communications. The RREQ message is received along the route other than the tree route, and the first information is updated using its information. The intermediate node relays to a next intermediate node the RREQ message containing the updated first information.

Apparatus and method for setup of optimum route using tree-topology

An optical network terminal receives, from a user device associated with the optical network terminal, a call to a called party, and checks a table, which may be locally cached in the optical network terminal, for a network location of another optical network terminal associated with the called party. The device also establishes a connection with another user device associated with the other optical network terminal, based on the network location, and exchanges voice data with the other user device associated with the other optical network terminal via the connection.

Peer-to-peer voice over internet protocol

The present invention generally relates to an edge deletion module positioned within an automated solar cell fabrication line. The edge deletion module may include a grinding wheel device for removing material from edge regions of a solar cell device and cleaning the edge regions of the solar cell device after removing the material. The edge deletion module may also include an abrasive element, a portion of which is ground as it is periodically, laterally advanced toward the grinding wheel device. A controller is provided for controlling the operation and function of various facets of the module.

Solar panel edge deletion module

A method of detecting and solving a network ID conflict is provided. The method of detecting and solving a network ID conflict includes generating and transmitting a personal area network identifier (PAN ID) report command frame that includes an extended PAN ID, and receiving a PAN ID update command frame in response to the transmitted PAN ID report command frame. According to the method, the PAN ID report command and the PAN ID update command are generated and provided by providing an extended PAN ID (EPID), and thus a network ID conflict can be detected and a new PAN ID is provided to solve the network ID conflict.

Method of detecting and solving network ID conflict

A new P2P streaming method and apparatus disseminates video chunks to all peers with the minimum (or at least reduced) delay. After obtaining a new video chunk, a peer keeps transmitting (uploading) that video chunk to other peers until all peers receive it. The approach quickly increases the aggregate bandwidth that can be utilized to transmit a video chunk. For example, the aggregate peer bandwidth used to transmit a video chunk can double every time slot. For a homogeneous P2P streaming system with N peers, a time slot is defined as a unit of the single chunk transmission delay between two peers. Using the P2P streaming method, a video chunk can be disseminated to all peers within 1+logN time slots.

Reducing or minimizing delays in peer-to-peer communications such as peer-to-peer video streaming

Growing community of inventors

Brooklyn, NY, United States of America

Yong Liu