| Patent application number | Description | Published |
|---|
| 20080244040 | Method and Apparatus for Dynamically Pushing Content Over Wireless Networks - The invention includes a method and apparatus for dynamically pushing content over a wireless network A method includes obtaining network-level state information and user-level state information for a user in response to an indication that content is available for the user, determining whether a network-level condition is satisfied using the network-level state information, determining whether a user-level condition is satisfied using the user-level state information, and pushing the available content toward the user terminal of the user using the wireless network in response to the conditions being satisfied. The network-level state information includes cell utilization information for a cellular region associated with the user terminal of the user. The user-level state information includes at least one of a user channel quality, a user terminal power state, a user terminal battery power status, a user terminal memory status, at least one user terminal capability, and user subscription information for the user. | 10-02-2008 |
| 20090089882 | Methods and Apparatus for Restricting End-User Access to Content - Methods and apparatus are provided for restricting end-user access to content Access of an end-user to content is restricted by receiving a request from the end-user to access the content; identifying and authorizing user associated with the end-user; providing an authorization message to the authorizing user, wherein the authorizing user is remote from a location of the end-user; and providing the end-user with access to the content if authorized by the authorizing user. For example, the end-user can be a child and the authorizing user can be an individual responsible for the child, such as a parent or guardian. In a further variation, the end-user can be an automated recording device and authorization request is responsive to an attempt by the recording device to record the content. | 04-02-2009 |
| 20090213775 | DETERMINISTIC FEEDBACK CONTROL FOR MULTICAST OR BROADCAST SERVICES - The invention relates to a method for controlling the transmission of feedback of mobile terminals receiving via an air interface of a mobile communication system a multicast or broadcast service transmitted or forwarded by a feedback control entity and to a mobile terminal, the feedback control entity using this method. Further, a communication system comprising a feedback control entity and a mobile terminal receiving a multicast or broadcast service is provided. To enable configurable and adaptive feedback for multicast or broadcast services provided via an air interface maintaining the end-to-end session concept the invention suggests that a feedback control entity deterministically selects a subset of the mobile terminals of the mobile communication system and which receive the multicast or broadcast service for providing feedback to the feedback control entity. In one embodiment of the invention the terminals are instructed to start or stop feedback provision by the feedback control entity by means of signaling. | 08-27-2009 |
| 20100057748 | Method and Apparatus for Parameterized Promotion and Delivery of Data - The invention includes a method and apparatus for promoting a data item within a data distribution network. In one embodiment, a method includes monitoring at least one parameter for the data item where the data item is associated with an application or service, propagating the data item from a first data server toward a second data server based on the monitoring of the at least one parameter for the data item, and propagating, toward at least one device, a message indicative of the propagation of the data item from the first data server toward the second data server. The message is for adapting the at least one device to identify the second data server as a source of the data item capable of serving future requests for the data item. | 03-04-2010 |
| 20100070700 | CACHE MANAGEMENT SYSTEM AND METHOD AND CONTENT DISTRIBUTION SYSTEM INCORPORATING THE SAME - A cache management system and method and a content distribution system. In one embodiment, the cache management system includes: (1) a content request receiver configured to receive content requests, (2) a popularity lifetime prediction modeler coupled to the content request receiver and configured to generate popularity lifetime prediction models for content that can be cached based on at least some of the content requests, (3) a database coupled to the popularity lifetime prediction modeler and configured to contain the popularity lifetime prediction models and (4) a popularity lifetime prediction model matcher coupled to the content request receiver and the database and configured to match at least one content request to the popularity lifetime prediction models and control a cache based thereon. | 03-18-2010 |
| 20100217869 | TOPOLOGY AWARE CACHE COOPERATION - A content distribution network (CDN) comprising a hierarchy of content storage nodes (CSNs) or caches having storage space that is allocated between local space for storing locally popular content objects and federated space for storing a portion of the less popular content objects. Local space and federated space based upon changes in content object popularity and/or other utility factors. Optionally, parent/child (upstream/downstream) communication paths are used to migrate content between CSNs or caches of the same or different hierarchical levels to avoid utilizing higher price top hierarchical level communications channels. | 08-26-2010 |
| 20100293294 | PEER-TO-PEER COMMUNICATION OPTIMIZATION - A peer-to-peer communication optimizer uses both peer locality and content diversity in a peer group to reduce network usage cost associated with using remote peers in a peer-to-peer system while reducing impact on the download time relative to peer-to-peer protocols operating with locality optimization alone or no localization of peers. The optimizer intercepts control messages in the peer-to-peer system and substitutes peer lists that meet both diversity indicator and network usage cost thresholds. Transparent embodiments operate without requirement to change peer or tracker implementations. Such embodiments include control message redirection, interception, and modification transparent to the client and tracker applications. Other embodiments include proxy designation. Still other embodiments include the use of gateway peers selected as function of diversity of content and network topology. Still other embodiments involve modification to one or more of client and/or tracker software and potentially the use of a standard interface for network topology determination. | 11-18-2010 |
| 20110078312 | Method and system for monitoring incoming connection requests in a Peer-to-Peer network - The present invention relates to a system and method for controlling peer-to-peer (P2P) traffic in an internet service provider (ISP) network. The system includes an ISP server configured to determine whether to accept or reject an incoming connection request to connect to a requested peer from a requesting peer in a P2P application. According to one embodiment, the ISP is configured to determine whether to accept or reject the incoming connection request based on current peer connectivity and cost of the incoming connection request. According to another embodiment, the ISP server determines whether to accept or reject the incoming connection request based on preference information available at the ISP server. | 03-31-2011 |
| 20110153802 | LOCALIZATION OF PEER TO PEER TRAFFIC - A method of processing peer-to-peer requests is provided. The method may include; storing, at a network element, peer information in a database for each peer of a plurality of peers, the peer information indicating at least one ISP associated with the peer and the content contained by the peer, receiving a request for content from a requester, and sending a response to the content requester based on the ISP with which the requester is associated and the stored peer information. | 06-23-2011 |
| 20110153835 | SYSTEM AND METHOD FOR CONTROLLING PEER-TO-PEER CONNECTIONS - The present invention relates to a system and method for controlling peer-to-peer connections in a Peer-to-Peer (P2P) streaming application for individual Internet Service Provider (ISP) networks over a localized overlay. The system may include a tracker local to a first ISP network configured to select edge peers among local peers of the first ISP network. The selected edge peers have external connections to peers outside the first ISP network in order to transfer sub-streams to or from the first ISP network, and the local peers not selected as edge peers have internal connections to other local peers within the first ISP network to transfer the sub-streams over the localized overlay. | 06-23-2011 |
| 20110173248 | Method for providing on-path content distribution - In one embodiment, the method includes receiving a content request from the end user at a proxy. A modified TCP connection request message is generated such that the modified TCP connection request message includes a content identifier. The content identifier identifies the requested content. The modified TCP connection request message is sent from the proxy towards an origin server associated with the requested content, and a response to the TCP connection request message is received from a network element. A TCP connection is established with the network element. | 07-14-2011 |
| 20110202651 | PRICE-AWARE NEIGHBORHOOD SELECTION FOR PEER-TO-PEER NETWORKS - A method and apparatus for peer-to-peer file sharing is provided. In some embodiments, the method includes receiving a request for a list of neighbor peers, where the request is made by a requesting peer device, and where the requesting peer device has a local internet service provider (ISP). The method may also include employing a server device to rank each neighbor peer in a plurality of neighbor peers based on whether the respective neighbor peer is external to the local ISP, and if the respective neighbor peer is external to the ISP, further based on a cost metric associated with a next ISP hop from the requesting peer device to the respective neighbor peer. The method may also include generating the list of neighbor peers based on the ranking of the neighbor peers, and enabling transmission of the list of neighbor peers to the requesting peer device. | 08-18-2011 |
| 20110276718 | Decreasing latency in anonymity networks - According to one embodiment, a method of decreasing latency in an anonymity network includes filtering a list of anonymity routers for a client device based on one of (i) loads of the anonymity routers on the list and (ii) distances of the anonymity routers from the client device. | 11-10-2011 |
| 20110299392 | QUALITY OF SERVICE AWARE RATE THROTTLING OF DELAY TOLERANT TRAFFIC FOR ENERGY EFFICIENT ROUTING - The invention is directed to energy-efficient network processing of delay tolerant data packet traffic. Embodiments of the invention determine if an aggregate of time critical traffic flow rates and minimum rates for meeting QoS requirements of delay tolerant traffic flows exceeds a combined optimal rate of packet processing engines of a network processor. In the affirmative case, embodiments set the processing rate of individual packet processing engines to a minimum rate, such that the cumulative rate of the packet processing engines meets the aggregate rate, and schedule the delay tolerant flows to meet their respective minimum rates. Advantageously, by throttling the processing rate of only delay tolerant traffic, energy consumption of network processors can be reduced while at the same time QoS requirements of the delay tolerant traffic and time critical traffic can be met. | 12-08-2011 |
| 20110307538 | NETWORK BASED PEER-TO-PEER TRAFFIC OPTIMIZATION - A peer-to-peer accelerator system is disclosed for reducing reverse link bandwidth bottlenecking of peer-to-peer content transfers. The peer-to-peer accelerator system contains a peer-to-peer proxy which resides in the core of the network. When a peer-to-peer bootstrap message from an asymmetrically connected client occurs, the proxy intercepts the message and instantiates an agent which will perform file transfers on the asymmetrically connected client's behalf thereby eliminating the need for the client to effect file content transfers over the reverse link. The peer-to-peer accelerator system is particularly useful for overcoming the bottlenecking and reverse link contention problems of peer-to-peer file transfer systems known in the art. | 12-15-2011 |
| 20120071174 | METHODS OF LOCATING DATA SPOTS AND NETWORKS AND USER EQUIPMENT FOR USING THE SAME - Methods determine data spots in a network by identifying a transmission resource and its characteristics so as to determine geography of a data spot. Users are then directed to, locate, and/or move to the data spot and retrieve desired content. Users may be directed to the determined data spot, with a map or compass. Transmission resources include ad hoc hotspots for need by sideloading network users in a communicative proximity. Methods may match characteristics of the requesting network user with determined transmission resources to position a data spot. Example methods may be configured based on amounts of network resources consumed, third-party costs to a user, maximizing user experience by providing nearer and faster data spots, and/or any other desired criteria. Different portions of the methods may be performed by the network, the user, and/or third-parties, to reduce network burden while supplying users with desired content through data spots. | 03-22-2012 |
| 20120072528 | METHODS OF PROCESSING REQUESTS FOR CONTENT AND INITIATING AN INTERCONNECTION FOR THE CONTENT - At least one example embodiment is directed to a method of processing a request for content including storing, at a network element, user information for a plurality of users, the user information including a location of the user and received content information, receiving a request for content from a requester, determining a potential peer from the plurality of users based on the request for content and the user information, and sending a response to the requester based on the determining | 03-22-2012 |
| 20120195362 | System and Method for Managing Cache Storage in Adaptive Video Streaming System - A normalized cost measure is determined for each encoded video segment within each of a plurality of sequences of encoded video segments that are associated with a video program and stored in a cache memory, relative to the sequence to which the encoded video segment belongs. One or more encoded video segments are selected from among the encoded video segments in the plurality of sequences, based on the normalized cost measures. The selected encoded video segments are removed from the cache memory. An encoded video segment having a lowest normalized cost measure among the encoded video segments in the plurality of sequences may be selected, for example. | 08-02-2012 |
| 20120324102 | QUALITY OF SERVICE AWARE RATE THROTTLING OF DELAY TOLERANT TRAFFIC FOR ENERGY EFFICIENT ROUTING - The invention is directed to energy-efficient network processing of delay tolerant data packet traffic. Embodiments of the invention determine if an aggregate of time critical traffic flow rates and minimum rates for meeting QoS requirements of delay tolerant traffic flows exceeds a combined optimal rate of packet processing engines of a network processor. In the affirmative case, embodiments set the processing rate of individual packet processing engines to a minimum rate, such that the cumulative rate of the packet processing engines meets the aggregate rate, and schedule the delay tolerant flows to meet their respective minimum rates. Advantageously, by throttling the processing rate of only delay tolerant traffic, energy consumption of network processors can be reduced while at the same time QoS requirements of the delay tolerant traffic and time critical traffic can be met. | 12-20-2012 |
| 20130007187 | TOPOLOGY AWARE CACHE STORAGE - A content distribution network (CDN) comprising a hierarchy of content storage nodes (CSNs) or caches having storage space that is allocated between local space for storing locally popular content objects and federated space for storing a portion of the less popular content objects. Local space and federated space based upon changes in content object popularity and/or other utility factors. Optionally, parent/child (upstream/downstream) communication paths are used to migrate content between CSNs or caches of the same or different hierarchical levels to avoid utilizing higher price top hierarchical level communications channels. | 01-03-2013 |
| 20130166739 | Localization Of Peer To Peer Traffic - A method of processing peer-to-peer requests is provided. The method may include; storing, at a network element, peer information in a database for each peer of a plurality of peers, the peer information indicating at least one ISP associated with the peer and the content contained by the peer, receiving a request for content from a requester, and sending a response to the content requester based on the ISP with which the requester is associated and the stored peer information. | 06-27-2013 |
| Patent application number | Description | Published |
|---|
| 20120311073 | ROUTING BY RESOLUTION - Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving a request message, the request message including a pointer; determining whether the network node is associated with the pointer; and if the network node is associated with the pointer: determining a label associated with the pointer, modifying the request message to produce a modified message, the modified message including the label, and transmitting the modified message to at least one other network node. Various embodiments additionally or alternatively relate a method and related network node including one or more of the following receiving a publish message, wherein the publish message includes a pointer; generating a label to be associated with the pointer; modifying the publish message to produce a modified message, wherein the modified message includes the label; and transmitting the modified message to at least one other network node. | 12-06-2012 |
| 20130031241 | DISTRIBUTED SERVICE INSTANTIATION FOR INFORMATION-CENTRIC NETWORKS - An exemplary communication device includes a node having a processor configured to instantiate a service at the node responsive to the processor determining that the node is a superior instantiation candidate relative to a next upstream node on a downstream path of the service. An exemplary method of communicating includes instantiating a service at a node responsive to the node determining that the node is a superior instantiation candidate relative to a next upstream node on a downstream path of the service. | 01-31-2013 |
| 20130227102 | Chunk Request Scheduler for HTTP Adaptive Streaming - A chunk request scheduler is provided for HTTP adaptive streaming. Requests for media chunks are scheduled over a network by requesting the media chunks over at least one connection; storing the media chunks in at least one buffer; monitoring a level of the at least one buffer; and selectively switching between at least two predefined download strategies for the request based on the buffer level. Requests for media chunks can also be scheduled over a network by obtaining an ordering of the connections based on a rate of each connection; storing the media chunks in at least one buffer; and requesting the media chunks over the ordered plurality of connections based on a size of the media chunks. For example, audio chunk requests can be scheduled over TCP connections having a lower rate order and video chunk requests can be scheduled over TCP connections having a higher rate order. | 08-29-2013 |
| 20140089452 | CONTENT STREAM DELIVERY USING VARIABLE CACHE REPLACEMENT GRANULARITY - A method comprises associating at least one cache replacement granularity value with a given one of a plurality of content streams comprising a number of segments, receiving a request for a given segment of the given content stream in a network element, identifying a given portion of the given content stream which contains the given segment, updating a value corresponding to the given portion of the given content stream, and determining whether to store the given portion of the given content stream in a memory of the network element based at least in part on the updated value corresponding to the given portion. The at least one cache replacement granularity value represents a given number of segments, the given content stream being separable into one or more portions based at least in part on the at least one cache replacement granularity value. | 03-27-2014 |
| 20140089467 | CONTENT STREAM DELIVERY USING PRE-LOADED SEGMENTS - A method comprises receiving a first request for a first segment of a content stream in a network element from a given one of a plurality of clients, determining in the network element whether the first segment is stored in a memory of the network element, sending a second request for the first segment from the network element to a server responsive to the determining step, receiving a response comprising the first segment in the network element from the server responsive to the second request, and sending the first segment from the network element to the given one of the plurality of clients. The first segment is related to a second segment of the content stream, the relationship being transparent to the network element but being inferable based at least in part on at least one of the first request, the response and one or more prior requests. | 03-27-2014 |
| 20140149493 | METHOD FOR JOINT SERVICE PLACEMENT AND SERVICE ROUTING IN A DISTRIBUTED CLOUD - Various exemplary embodiments relate to a method for distributing an application in a distributed cloud computing system including a plurality of clients with demand and a plurality of data centers, including: determining a list of candidate clients for each of the plurality of data centers; determining a set of data centers having capacity; determining a cost of providing service by each data center having capacity; and determining the data center having capacity with the lowest cost of providing service, wherein the determined data center is selected to provide service to the plurality of clients. | 05-29-2014 |
