Systems for distributing content data over a computer network and method of arranging nodes for distribution of data over a computer network

• US 7,543,074 B2
• Filed: 09/22/2005
• Issued: 06/02/2009
• Est. Priority Date: 09/13/2001
• Status: Expired due to Term

• Current Assignee: NYIAX, Inc.
• Original Assignee: Network Foundation Technologies, LLC
• Inventors: O'Neal, Michael, Kleinpeter, Joshua
• Primary Examiner(s): NGUYEN, THANH T
• Application Number:
  US11/233,190
• Publication Number:
  US 20060212596A1
• Time in Patent Office: 1,349 Days
• Field of Search: 709/223, 709/252, 709/239, 709/203, 370/408
• US Class Current: 709/233
• CPC Class Codes: H04L 12/1854 with non-centralised forwarding system, e.g. chaincast
• CPC Class Codes: H04L 65/611 for multicast or broadcast systems for broadcast or conference H04L12/18; arrangements for broadcast or distribution combined with broadcast H04H20/00; arrangements for broadcast applications with a direct linkage to broadcast information or to broadcast space-time H04H60/00; selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS], H04W4/06
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1046 Joining mechanisms
• CPC Class Codes: H04L 67/1089 Hierarchical topologies
• CPC Class Codes: H04L 67/1091 Interfacing with client-server systems or between P2P systems

Abstract

The invention is a system for distributing content data over a computer network and a method of arranging receiver nodes in a computer network such that the capacity of the server is effectively multiplied many times over, and may even be increased exponentially. The invention takes advantage of the excess capacity many receiver nodes possess, and uses them as repeaters. The distribution system includes nodes having databases which indicate their ancestors and descendants so that reconfiguration of the distribution network may be accomplished without burdening the systems primary server. The invention includes a process for configuring a computer information distribution network having a primary server node and user nodes docked in a cascaded relationship, and reconfiguring the network in the event that a user node departs from it. The process includes the steps of providing a new user node (or connection requesting user node) with a connection address list of nodes within the network, having the new user node (or connection requesting user node) go to the node at the top of the connection address list, determine whether that node is still part of the distribution network, and connect thereto if it is, and if it is not, to go to the next node on the connection address list. When a user node departs from the distribution network, a propagation signal is transmitted to the nodes below it in the network, causing them to move up in the network in a predetermined order.

Claims

1. A distribution network for the distribution of content data from a server node to user nodes, wherein said user nodes are connected to said server and each other in cascaded relationship, wherein,

(a) at least one of said user nodes is a repeater node connected directly to said server node, wherein said repeater node retransmits content data received by said repeater node to a second user node which is a child node of said repeater node, said second user node being docked to said repeater node for the purpose of receiving content data from said repeater node;

(b) wherein each repeater node has the ability to provide connection address instructions to a connection requesting user nodes attempting to dock with it, said connection address instructions comprising a connection address list from a recommended parent node back to said server node;

(c) wherein said recommended parent node has apparent available capacity to transmit content data to said connection requesting user node and is at least as close to said repeater node as any other user node docked to the repeater node having apparent available capacity to transmit content data to said connection requesting user node;

(d) wherein each repeater node includes a descendant database indicating (i) which child nodes, if any, at a point in time, are docked with it so as to receive content data from said repeater node, and (ii) which user nodes, if any, at said point in time, are purportedly docked with each of said child nodes, said descendant database containing utility ratings for each child node in said descendant database; and

(e) wherein each repeater node is able to use said descendant database to create a primary recommended parent list and a secondary recommended parent list, said secondary recommended parent list containing all child nodes of said repeater node having sufficient bandwidth available to support another child node, but are fully occupied, and at least one of its child nodes is incapable of retransmitting content data to another child node, wherein said child nodes which are closest to said repeater are placed at the top of the secondary recommended parent list, and those nodes which are in the same level are ranked such that the nodes with the highest utility rating are listed first.

2. The distribution network of claim 1 wherein the connection address instructions refer said user node which is attempting to dock with said repeater node to a node in said descendant database.

3. The distribution network of claim 1 wherein each user node includes an ancestor database indicating a parent node to which said user node is docked so that said user node is enabled to receive content data from the parent node, and to which node, if any, at said point in time, said parent node is docked so that it may receive content data therefrom.

4. The distribution network of claim 3 wherein, if said parent node of said user node departs from said distribution network, said user node contacts another node on its ancestor database.

5. The distribution network of claim 1 wherein each child node of a repeater node includes a sibling database indicating which user nodes, if any, are also child nodes of said repeater node.

6. The distribution network of claim 1 wherein said connection requesting user node has the ability to:

(a) go to node at top of said connection address list;

(b) determine whether node at top of said connection address list is part of the distribution network;

(c) if node at top of connection address list is not part of the distribution network, deleting such node from connection address list and repeating steps (a) and (b) with respect to next node at top of connection address list; and

(d) if node at top of connection address list is part of said distribution network, dock with said node at top of connection address list.

7. The distribution network of claim 1 wherein said connection requesting user node has the ability to:

(a) go to node at top of said connection address list;

(b) determine whether node at top of said connection address list is part of the distribution network;

(c) if node at top of connection address list is not part of the distribution network, deleting such node from connection address list and repeating steps (a) and (b) with respect to next node at top of connection address list; and

(d) if node at top of connection address list is part of said distribution network, determine whether said node at top of connection address list has available capacity to transmit content data to said connection requesting user node; and

(i) if node at top of connection address list is part of said distribution network and has available capacity to transmit content data to said connection requesting user node, dock with said node at top of connection address list

the utility ratings of the nodes below the node in which that particular topology database resides.

8. The distribution network of claim 7 wherein each repeater node has the ability to use said descendant database to create a primary recommended parent list containing all child nodes of said repeater node having sufficient bandwidth available to support another child node and which are not fully occupied, wherein said child nodes which are closest to said repeater are placed at the top of the primary recommended parent list, and those nodes which are in the same level are ranked such that the nodes with the highest utility rating are listed first.

9. The distribution network of claim 7 wherein if said repeater node has room for another child node or is the parent of a low bandwidth node, said repeater node is listed in the primary recommended parent list.

10. The distribution network of claim 7 wherein said repeater node is configured to select the recommended parent node from the top of the primary recommended parent list.

11. The distribution network of claim 10 wherein said repeater node is configured to select the recommended parent node from the top of the secondary recommended parent list if the node at the top of the secondary recommended parent list is closer to the server than the child the node at the top of the primary recommended parent list.

12. A distribution network for the distribution of content data comprising:

a server node;

a plurality of user nodes wherein the server node and the plurality of user nodes are connected to each other in cascaded relationship,

wherein at least one of the plurality of user nodes is a repeater node connected directly to the server node, wherein the repeater node retransmits content data received by the repeater node to a second one of the plurality of user nodes which is a child node of the repeater node, the second one of the plurality of user nodes being docked to the repeater node for the purpose of receiving content data from the repeater node,

wherein each repeater node has the ability to provide connection address instructions to any of the plurality of user nodes which attempt to dock with it, and

wherein the connection address instructions comprise a connection address list from a recommended parent node back to the server node wherein the recommended parent node has sufficient bandwidth to transmit content data to the user node attempting to dock with the repeater node and is at least as close to the repeater node as any other user node docked to the repeater node having sufficient bandwidth to transmit content data to the user node;

(f) wherein each repeater node includes a descendant database indicating (i) which child nodes, if any, at a point in time, are docked with it so as to receive content data from said repeater node, and (ii) which user nodes, if any, at said point in time, are purportedly docked with each of said child nodes, said descendant database containing utility ratings for each child node in said descendant database; and

(g) wherein each repeater node is able to use said descendant database to create a primary recommended parent list and a secondary recommended parent list, said secondary recommended parent list containing all child nodes of said repeater node having sufficient bandwidth available to support another child node, but are fully occupied, and at least one of its child nodes is incapable of retransmitting content data to another child node, wherein said child nodes which are closest to said repeater are placed at the top of the secondary recommended parent list, and those nodes which are in the same level are ranked such that the nodes with the highest utility rating are listed first.