IP Library Granted Patent US 7,996,546
Granted Patent B2
US 7,996,546 · App. 12/244,756 · Granted Aug 9, 2011

Dynamic allocation of a quota of consumer nodes connecting to a resource node of a peer-to-peer network

Assignee: Ray-V Technologies, Ltd.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,996,546
App. No.
12/244,756
Granted
Aug 9, 2011
Kind
B2
Abstract

A method for determining a quota for connecting a plurality of consumer nodes to a resource node. The method comprises periodically determining the quota of consumer nodes acceptable for receiving connection requests by the resource node; receiving a connection request from a consumer node to connect to the resource node; and determining based on the quota whether to accept the connection request. In one embodiment the resource node and the consumer nodes are connected in a realtime peer-to-peer network, and the resource node is adapted to distribute multimedia content to the consumer nodes over the network.

Claims (39)

1. A system comprising:

at least one resource node adapted to deliver real-time multimedia content, the at least one resource node is any node in a real-time peer-to-peer network that has an available upload bandwidth that can be contributed to at least one channel-swarm; and

a plurality of consumer nodes associated with the at least one channel-swarm for receiving the real-time multimedia content distributed by the at least one resource node over the real-time peer-to-peer network;

wherein the at least one resource node:

accepts or rejects a connection request from a consumer node of the plurality of consumer nodes based on a dynamic quota value,

periodically performs a quality check to determine if the at least one resource node has encountered a bad connection in existing connections with any consumer node of the plurality of consumer nodes, and

updates the dynamic quota value based on the quality check, wherein updating the dynamic quota value includes reducing the dynamic quota value when the quality check determines that at least one of the existing connections between the at least one resource node and any consumer node of the plurality of consumer nodes is a bad connection, the dynamic quota reduction value includes computing a step down value from the dynamic quota value by: counting a number of bad connections with the plurality of consumer nodes; multiplying the number of bad connections with an acceptor drop ratio value to result with the step down value; and updating the dynamic quota value by reducing its current value by the step down value.

2. The system of claim 1 , wherein the at least one resource node accepts the connection request from the consumer node if the dynamic quota value is not filled out.

3. The system of claim 1 , wherein the at least one resource node rejects the connection request from the consumer node if the dynamic quota value is filled.

4. The system of claim 1 , wherein if the dynamic quota value is below a minimum quota value, the minimum quota value is used as a value of the dynamic quota value, wherein the minimum quota is equal to or greater than one, thereby preventing the resource node from not servicing any of the plurality of consumer nodes.

5. The system of claim 1 , wherein the dynamic quota value is increased when the quality check determines that no bad connection with any consumer node of the plurality of consumer nodes has been encountered during a predefined time interval and that the dynamic quota was filled.

6. The system of claim 5 , wherein the dynamic quota value is increased by performing:

computing a step up value from the dynamic quota value by multiplying a current value of the dynamic quota with an acceptor increase ratio value; and

updating the dynamic quota value by increasing its current value by the computed step up value.

7. The system of claim 6 , wherein if the dynamic quota value is above a maximum quota value, the maximum quota value is used as a value of the dynamic quota value, thereby ensuring that the number of consumer nodes connected to the resource node is bounded.

8. A method for determining a quota for connecting a plurality of consumer nodes to a resource node in a real-time peer-to-peer network, comprising:

setting the quota of consumer nodes acceptable for receiving connection requests by the resource node to an initial value;

receiving a connection request from at least one consumer node of a plurality of consumer nodes to connect to the resource node;

determining based on the quota whether to accept the connection request, the resource node is any node in the peer-to-peer network that has an available upload bandwidth that can be contributed to at least one channel-swarm and is adapted to distribute real-time multimedia content over the real-time peer-to-peer network to the plurality of consumer nodes associated with the at least one channel-swarm;

periodically performing a quality check to determine if the at least one resource node has encountered a bad connection in existing connections with any consumer node of the plurality of consumer nodes;

dynamically updating a value of the quota by a quota decrease value or a quota increase value based on the quality check, wherein the quota decrease value is computed by counting a number of bad connections with the plurality of consumer nodes; multiplying the number of bad connections with an acceptor drop ratio value to result with the quota decrease value; and updating the quota by reducing its current value by the quota decrease value.

9. The method of claim 8 , further comprising:

setting the quota to a minimum quota value if the updated quota is below the minimum quota value, wherein the minimum quota is equal to or greater than one, thereby preventing the resource node from not servicing any consumer node.

10. The method of claim 8 , further comprising:

determining if the resource node has filled the quota and no bad connections with any consumer node of the plurality of consumer nodes was found during a predefined time interval.

11. The method of claim 10 , further comprising:

computing a quota increase value by multiplying a current value of the dynamic quota with an acceptor increase ratio value; and

updating the quota by increasing its current value by the quota increase value.

12. The method of claim 11 , further comprising:

setting the quota to a maximum quota value if the updated quota exceeds the maximum quota value, thereby ensuring that the number of consumer nodes connected to the resource node is bounded.

13. The method of claim 8 , wherein determining based on the quota whether to accept the connection request, further comprising:

allowing the connection request if a total number of consumer nodes connected to the resource node is no more than the quota; and

rejecting the connection request otherwise.

14. A non-transitory computer readable medium having stored thereof computer executable code for, for determining a quota for connecting a plurality of consumer nodes to a resource node, in a peer-to-peer network comprising:

setting the quota of consumer nodes acceptable for receiving connection requests by the resource node to an initial value;

receiving a connection request from at least one consumer node of a plurality of consumer nodes to connect to the resource node;

determining based on the quota whether to accept the connection request, the resource node is any node in the peer-to-peer network that has an available upload bandwidth that can be contributed to at least one channel-swarm and is adapted to distribute resource node real-time multimedia content over the real-time peer-to-peer network to the plurality of consumer nodes associated with the at least one channel-swarm;

periodically performing a quality check to determine if the at least one resource node has encountered a bad connection in of existing connections with any consumer node of the plurality of consumer nodes; and

dynamically updating a value of the quota by a quota decrease value or a quota increase value based on the quality check, wherein the quota decrease value is computed by counting a number of bad connections with the plurality of consumer nodes; multiplying the number of bad connections with an acceptor drop ratio value to result with the quota decrease value; and updating the quota by reducing its current value by the quota decrease value.

Assignments (7)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 19, 2021
From: VERIZON MEDIA INC.
To: VERIZON PATENT AND LICENSING INC.
Reel/Frame 057453/0431 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 26, 2020
From: OATH INC.
To: VERIZON MEDIA INC.
Reel/Frame 054258/0635 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 2, 2018
From: YAHOO HOLDINGS, INC.
To: OATH INC.
Reel/Frame 045240/0310 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 23, 2017
From: YAHOO! INC.
To: YAHOO HOLDINGS, INC.
Reel/Frame 042963/0211 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 16, 2014
From: RAYV, INC
To: YAHOO! INC.
Reel/Frame 033750/0937 →
CHANGE OF NAME Recorded Jun 2, 2014
From: RAY-V TECHNOLOGIES, LTD
To: RAY V, INC.
Reel/Frame 033244/0369 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 3, 2008
From: LUZZATTI, OMER; WEISS, ERAN
To: RAY-V TECHNOLOGIES, LTD.
Reel/Frame 021628/0177 →
Continuity (1)
Related Publication 20100088422A1 · Apr 8, 2010