FLEXIBLE BANDWIDTH ALLOCATION IN A CONTENT DISTRIBUTION NETWORK

• US 20150188842A1
• Filed: 12/31/2013
• Published: 07/02/2015
• Est. Priority Date: 12/31/2013
• Status: Abandoned Application

• Current Assignee: Sonic IP Incorporated (Endeavor Group Holdings Inc.)
• Original Assignee: Sonic IP Incorporated (Endeavor Group Holdings Inc.)
• Inventors: Amidei, William, Chan, Francis, Grab, Eric, Kiefer, Michael, McDaniel, Aaron, Mickus, John, Mombourquette, Ronald, Popov, Nikolai, Zuill, Fred
• Application Number:
  US14/144,996
• Publication Number:
  US 20150188842A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: H04L 43/0894 Packet rate
• CPC Class Codes: H04L 47/762 triggered by the network
• CPC Class Codes: H04L 47/783 Distributed allocation of resources, e.g. bandwidth brokers

Abstract

Methods and systems to improve the efficiency of a content delivery system. A local distribution node is introduced to the network, between the content provider and the end user device (i.e., the leaf node). The local distribution node is responsible for servicing a localized subset of the leaf nodes that would otherwise be serviced by a conventional server of the content delivery system. Requests for content are received at the local distribution node from leaf nodes, and content is received at the local distribution node for transmission to the leaf node(s). Content may be cached at the local distribution node to allow faster service of subsequent requests for this content. Caching may also be used to make the channel surfing process more efficient. If demand is high, a leaf node may be promoted to serve as an additional local distribution node. Leaf nodes may also share content among themselves. Bandwidth may be allocated and reallocated by the local distribution node for the local population of leaf nodes.

Claims

1. A method of bandwidth location at a local distribution node, comprising:

for each leaf node in a content distribution network, at a local distribution node, determining values for bandwidth parameters;

based on the bandwidth parameter values, projecting bandwidth needs for a future period for each leaf node; and

reallocating bandwidth for one or more of the leaf nodes based on said projection.

2. The method of claim 1, wherein the bandwidth parameters at a leaf node comprise one or more of:

maximum bandwidth capacity for infrastructure of the leaf node;

historical bandwidth requirements of the leaf node; and

historical viewing habits of the user of the leaf node.

3. The method of claim 1, wherein said projection comprises:

determining an expected number of requests in the future period;

determining an average volume of data per request in the future period; and

calculating the expected bandwidth needs for the future period.

4. The method of claim 1, wherein said reallocation comprises:

identifying a leaf node needing additional bandwidth;

determining if the new additional bandwidth would exceed the maximum bandwidth capacity for the infrastructure of the leaf node; and

if not, allocating the needed additional bandwidth to the leaf node if the needed additional bandwidth is available.

5. The method of claim 1, wherein one or more leaf nodes are prioritized or receiving needed additional bandwidth on the basis of fees paid by users of the respective one or more leaf nodes.

6. A computer program product for bandwidth allocation at a local distribution node, including a non-transitory computer readable medium having computer program logic stored therein, the computer program logic comprising:

logic for determining, at a local distribution node, values for bandwidth parameters for each leaf node in a content distribution network;

logic for projecting bandwidth needs for a future period for each leaf node, based on the bandwidth parameter values; and

logic for reallocating bandwidth for one or more of the leaf nodes based on the projection.

7. The computer program product of claim 6, wherein the bandwidth parameters at a leaf node comprise one or more of:

maximum bandwidth capacity for infrastructure of the leaf node;

historical bandwidth requirements of the leaf node; and

historical viewing habits of the user of the leaf node.

8. The computer program product of claim 6, wherein said logic for projection comprises:

logic for determining an expected number of requests in the future period;

logic for determining an average volume of data per request in the future period; and

logic for calculating the expected bandwidth needs for the future period.

9. The computer program product of claim 6, wherein said logic for reallocation comprises:

logic for identifying a leaf node needing additional bandwidth;

logic for determining if the new additional bandwidth would exceed the maximum bandwidth capacity for the infrastructure of the leaf node; and

logic for allocating the needed additional bandwidth to the leaf node if the needed additional bandwidth is available, if the new additional bandwidth would not exceed the maximum bandwidth capacity for the infrastructure of the leaf node.

10. The computer program product of claim 6, wherein one or more leaf nodes are prioritized or receiving needed additional bandwidth on the basis of fees paid by users of the respective one or more leaf nodes.

11. A system for bandwidth location at a local distribution node, comprising:

a processor; and

memory in communication with said processor, said memory for storing a plurality of processing instructions for directing said processor to;

for each leaf node in a content distribution network, at a local distribution node, determine values for bandwidth parameters;

based on the bandwidth parameter values, project bandwidth needs for a future period for each leaf node; and

reallocate bandwidth for one or more of the leaf nodes based on said projection.

12. The system of claim 11, wherein the bandwidth parameters at a leaf node comprise one or more of:

maximum bandwidth capacity for infrastructure of the leaf node;

historical bandwidth requirements of the leaf node; and

historical viewing habits of the user of the leaf node.

13. The system of claim 11, wherein the projection comprises:

determining an expected number of requests in the future period;

determining an average volume of data per request in the future period; and

calculating the expected bandwidth needs for the future period.

14. The system of claim 11, wherein the reallocation comprises:

identifying a leaf node needing additional bandwidth;

determining if the new additional bandwidth would exceed the maximum bandwidth capacity for the infrastructure of the leaf node; and

if not, allocating the needed additional bandwidth to the leaf node if the needed additional bandwidth is available.

15. The system of claim 11, wherein one or more leaf nodes are prioritized or receiving needed additional bandwidth on the basis of fees paid by users of the respective one or more leaf nodes.