Method and system for improving content diversification in data driven P2P streaming using source push

• US 8,108,537 B2
• Filed: 07/24/2008
• Issued: 01/31/2012
• Est. Priority Date: 07/24/2008
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Fu, Zhenghua, Wu, Chai Wah
• Primary Examiner(s): Caldwell, Andrew
• Assistant Examiner(s): Pollack, Melvin H
• Application Number:
  US12/179,150
• Publication Number:
  US 20100023633A1
• Time in Patent Office: 1,286 Days
• Field of Search: 709/204, 709/205, 709/226, 709/229, 709231-235, 709/241, 709/242, 718104-106
• US Class Current: 709/231
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/101 based on network conditions
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1072 Discovery involving ranked list compilation of candidate peers

Abstract

A system and method for improving content diversification in data driven streaming includes computing a weight factor and a qualification factor for each of at least two nodes among a plurality of nodes, based upon a bandwidth of each node. Content is pushed to a node based on the qualification factor and the weight factor of each node. The qualification factor is updated for the node which received pushed content.

Claims

1. A method for data driven streaming, comprising:

computing a weight factor and a qualification factor for each of at least two nodes among a plurality of nodes, based upon a bandwidth of each node;

pushing content to a node based on the qualification factor and the weight factor of the node in accordance with a scheme for increasing content diversity among the nodes, wherein the content is stored on a computer readable storage medium at the node; and

updating the qualification factor for the node which received pushed content.

2. The method as recited in claim 1, wherein updating the qualification factor includes:

dynamically updating the qualification factor for the node which received pushed content, based on a current qualification factor and the weight factor of the node.

3. The method as recited in claim 1, wherein computing a weight factor includes a weight factor for node i (w(i)) being computed by w(i)=bw(i)/sum(bw(j)), for all nodes j in a host cache located at a stream source where bw is the bandwidth and sum is the summation function.

4. The method as recited in claim 1, wherein the weight factor is maintained at a respective node.

5. The method as recited in claim 1, wherein maintaining an updated qualification factor includes computing the qualification factor (q(i)) for node i by q(i)=q(i)+w(i) where w(i) is the weight factor for node i.

6. The method as recited in claim 1, wherein distributing includes pushing content to K nodes with a highest qualification factor to increase content diversity among the nodes, where K=B/R, B is a reserved portion for upload bandwidth and R is a current streaming rate.

7. The method as recited in claim 1, further comprising maintaining a host cache located at each stream source to list a subset of peer nodes currently in a system and upon new content arrival selecting K nodes from the host cache to push the new content to.

8. The method as recited in claim 7, wherein updating includes subtracting 1/K from the qualification factor of each of the K nodes.

9. A non-transitory computer readable storage medium comprising a computer readable program, wherein the computer readable program when executed on a computer causes the computer to perform the steps of:

computing a weight factor and a qualification factor for each of at least two nodes among a plurality of nodes, based upon a bandwidth of each node;

pushing content to a node based on the qualification factor in accordance with a scheme for increasing content diversity among the nodes; and

updating the qualification factor for the node which received pushed content.

10. The computer readable storage medium as recited in claim 9, wherein updating the qualification factor includes dynamically updating the qualification factor for the node which received pushed content, based on a current qualification factor and the weight factor of the node.

11. The computer readable storage medium as recited in claim 9, wherein computing a weight factor includes a weight factor for node i (w(i)) being computed by w(i)=bw(i)/sum(bw(j)), for all nodes j in a host cache located at a stream source where bw is the bandwidth and sum is the summation function.

12. The computer readable storage medium as recited in claim 9, wherein the weight factor is maintained at a respective node.

13. The computer readable storage medium as recited in claim 9, wherein maintaining an updated qualification factor includes computing the qualification factor (q(i)) for node i by q(i)=q(i)+w(i) where w(i) is the weight factor for node i.

14. The computer readable storage medium as recited in claim 9, wherein distributing includes pushing content to K nodes with a highest qualification factor to increase content diversity among the nodes, where K=B/R, B is a reserved portion for upload bandwidth and R is a current streaming rate.

15. The computer readable storage medium as recited in claim 9, further comprising maintaining a host cache located at each stream source to list a subset of peer nodes currently in a system and upon new content arrival selecting K nodes from the host cache to push the new content to.

16. The computer readable storage medium as recited in claim 15, wherein updating includes subtracting 1/K from the qualification factor of each of the K nodes.

17. A method for data driven streaming, comprising:

computing a probability for at least two nodes where the probability represents a node'"'"'s likelihood of being selected to receive new content;

selecting nodes for a target list based upon the probability;

pushing new content in a data streaming environment to nodes selected from the target list in accordance with a scheme for increasing content diversity among the nodes, wherein the new content is stored on a computer readable storage medium at the nodes; and

reducing the probability of a node which received pushed content to maintain fairness.

18. The method as recited in claim 17, where fairness is measured via a qualification factor.

19. The method as recited in claim 17, wherein pushing includes pushing content to K nodes in the target list to increase content diversity among the nodes, where K=B/R, B is a reserved portion for upload bandwidth and R is a current streaming rate.

20. The method as recited in claim 17, further comprising maintaining a host cache at a node to list a subset of peer nodes currently in a system and upon new content arrival selecting K nodes from the host cache to push the new content to.

21. A non-transitory computer readable storage medium comprising a computer readable program for improving content diversification in data driven streaming, wherein the computer readable program when executed on a computer causes the computer to perform the steps of claim 17.

22. A system for data driven streaming, comprising:

a source configured to push content to a plurality of nodes in accordance with a scheme for increasing content diversity among the nodes, the source including a host cache configured to store a listing of at least a portion of nodes in the system to which content is to be pushed; and

a qualification factor maintained at at least two nodes, the qualification factor being updated for a node which received pushed content based upon available upload bandwidth, the source employing the qualification factor of the at least two nodes to select K nodes to push new content to thereby increasing content diversity among the nodes, wherein the new content is stored on a non-transitory computer readable storage medium at the K nodes.

23. The system as recited in claim 22, where 1/K is subtracted from the qualification factor of each of the K nodes to update the qualification factor.

24. The system as recited in claim 22, wherein the qualification factor is computed by q(i)=q(i)+w(i) where w(i) is the weight factor for node i.

25. The system as recited in claim 22, wherein the weight factor is computed by w(i)=bw(i)/sum(bw(j)), for all nodes j in the host cache where bw is the bandwidth and sum is the summation function.