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

• US 20030051051A1
• Filed: 09/13/2001
• Published: 03/13/2003
• Est. Priority Date: 09/13/2001
• Status: Active Grant

• Current Assignee: NYIAX, Inc.
• Original Assignee: Network Foundation Technologies
• Inventors: OʼNeal, Michael, Kleinpeter, Joshua
• Granted Patent: US 7,035,933 B2
• Time in Patent Office: Days
• US Class Current: 709/242
• 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 system'"'"'s 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 process for docking a connection requesting user node with a distribution network, said process including the following steps:

(a) having an instructing node receive a connection request from said connection requesting user node;

(b) forming an instructing node topology database indicating, at a point in time,

(i) which, if any, user nodes are docked with said instructing node as child nodes;

which, if any, user nodes are docked with each of said child nodes as grandchild nodes of said instructing node;

which, if any, user nodes are docked with each of said grandchild nodes as great-grandchild nodes of said server node; and

so on; and

(ii) said docked user nodes respective bandwidth capacities;

(c) selecting from a group of nodes including the instructing node and said docked user nodes a recommended parent node for said connection requesting user node, 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 instructing node as any other docked user node having apparent available capacity to transmit content data to said connection requesting user node; and

(d) providing a connection address list to said connection requesting user node, said connection address list listing each node in said instructing node'"'"'s topology database from said recommended parent node back to said instructing node.

2. The process of claim 1, further comprising the following steps:

(e) having said connection requesting user node go to node at top of said connection address list;

(f) having said connection requesting user node determine whether node at top of said connection address list is part of the distribution network;

(g) 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 (e) and (f) with respect to next node at top of connection address list;

(h) if node at top of connection address list is part of said distribution network, having said connection requesting user node dock with said node at top of connection address list.

3. The process of claim 1, wherein step (d) further comprises the following step:

(i) if said instructing node is not a server node, including in said connection address list a list of nodes cascadingly connected with each other from the instructing node back to said server node.

4. The process of claim 3, further comprising the following steps:

(e) having said connection requesting user node go to node at top of said connection address list;

(f) having said connection requesting user node determine whether node at top of said connection address list is part of the distribution network;

(g) 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 (e) and (f) with respect to next node at top of connection address list;

(h) if node at top of connection address list is part of said distribution network, having said connection requesting user node dock with said node at top of connection address list.

5. The process of claim 3, further comprising the following steps:

(e) having said connection requesting user node go to node at top of connection address list;

(f) having said connection requesting user node determine whether node at top of said connection address list is part of the distribution network;

(g) 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 (e) and (f) with respect to next node at top of connection address list;

(h) if node at top of connection address list is part of said distribution network, determining 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, having said connection requesting user node dock with said node at top of connection address list.

6. The process of claim 5, further comprising the following steps:

(j) if node at top of connection address list is part of said distribution network and said node at top of connection address list does not have available capacity to transmit content data to said connection requesting user node, repeating steps (a)-(d), with said node at top of connection address list being said instructing node and a new connection address list being the product of steps (a)-(d).

7. The process of claim 6, further comprising the steps of counting the times that step (j) is performed and, when step (j) is performed a predetermined number of times, having said connection requesting user node repeat steps (a)-(d) with said primary server being the instructing node.

8. A process for docking a connection requesting user node with a distribution network, said process including the following steps:

(a) having an instructing node receive a connection request from said connection requesting user node;

(b) forming an instructing node topology database indicating, at a point in time,

(i) which, if any, user nodes are docked with said instructing node as child nodes;

which, if any, user nodes are docked with each of said child nodes as grandchild nodes of said instructing node;

which, if any, user nodes are docked with each of said grandchild nodes as great-grandchild nodes of said server node; and

so on; and

(ii) said docked user nodes'"'"' respective bandwidth capacities;

(c) assigning utility ratings to each of the docked user nodes, said utility ratings being a function of at least the bandwidth capacity of the docked user node and the elapsed time that the docked user node has been docked with the distribution network;

(d) selecting from a group of nodes including the instructing node and said docked user nodes a recommended parent node for said connection requesting user node, 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 instructing node as any other docked user node having apparent available capacity to transmit content data to said connection requesting user node, and when the closest docked user node with apparent available capacity to transmit content data to said connection requesting user node is equidistant to said instructing node with at least one other docked user node with apparent available capacity to transmit content data to said connection requesting user node, said recommended parent node is the docked user node having the highest utility rating among such equidistant docked user nodes with apparent available capacity; and

(e) providing a connection address list to said connection requesting user node, said connection address list listing each node in said instructing node'"'"'s topology database from said recommended parent node back to said instructing node and, if said instructing node is not a primary server node, back to said primary server node.

9. A process for docking a connection requesting user node with a distribution network, said process including the following steps:

(a) having an instructing node receive a connection request from said connection requesting user node;

(b) forming an instructing node topology database indicating, at a point in time,

(i) which, if any, user nodes are docked with said instructing node as child nodes;

which, if any, user nodes are docked with each of said child nodes as grandchild nodes of said instructing node;

which, if any, user nodes are docked with each of said grandchild nodes as great-grandchild nodes of said instructing node; and

so on; and

(ii) said docked user nodes'"'"' respective bandwidth capacities, including a designation of whether said respective docked user node'"'"'s bandwidth capacity is below a predetermined threshold (i.e., said respective docked user node is a low-bandwidth node) or at least said predetermined threshold (i.e., said respective docked user node is a high-bandwidth node);

(c) forming a primary recommended parent node list (“

PRPL”

) comprised of the instructing node (if it has available capacity to transmit content data to said connection requesting user node) plus those docked user nodes having apparent available capacity to transmit content data to said connection requesting user node, with said instructing node being placed first on the PRPL (if it is on the PRPL) and said docked user nodes having apparent available capacity to transmit content data to said connection requesting user node being ranked with those docked nodes which are closer to the instructing node being ranked higher than those docked nodes which are further away and with equidistant docked user nodes being ranked such that those docked nodes which have the higher utility ratings being ranked higher than docked nodes having lower utility ratings;

(d) forming a secondary recommended parent node list (“

SRPL”

) comprised of the instructing node (if it has no available capacity to transmit content data to said connection requesting user node but does have at least one low-bandwidth node docked directly to it) plus said docked user nodes which (i) are high-bandwidth nodes with no available capacity to transmit content data to said connection requesting user node and (ii) have at least one low-bandwidth node docked directly to it, with said instructing node being placed first on the SRPL (if it is on the SRPL) and said docked user nodes on the SRPL being ranked with those docked nodes which are closer to the instructing node being ranked higher than those docked nodes which are further away and with equidistant docked user nodes being ranked such that those docked nodes which have the higher utility ratings being ranked higher than docked nodes having lower utility ratings;

(e) determining whether the connection requesting user node is a low-bandwidth node;

(f) if the connection requesting user node is a low-bandwidth node,

(i) selecting the highest ranked node on the PRPL as a recommended parent node; and

(ii) providing a connection address list to said connection requesting user node, said connection address list listing each node in said instructing node'"'"'s topology database from said recommended parent node back to said instructing node and, if said instructing node is not a primary server node, back to said primary server node; and

(g) if the connection requesting user node is a high-bandwidth node,

(i) selecting the highest ranked node on the PRPL as a recommended parent node;

(ii) selecting the highest ranked node on the SRPL as an alternate recommended parent node;

(iii) determining whether the alternate recommended parent node is closer to the server node than the recommended parent node;

(iv) if the alternate recommended parent node is not closer to the server node than the recommended parent node, providing a connection address list to said connection requesting user node, said connection address list listing each node in said instructing node'"'"'s topology database from said recommended parent node back to said instructing node and, if said instructing node is not the primary server node, back to said primary server node;

(v) if the alternate recommended parent node is closer to the server node than the recommended parent node,

(1) forcing the disconnection of a low-bandwidth node from the alternate recommended parent node and

(2) providing a connection address list to said connection requesting user node, said connection address list listing each node in said instructing node'"'"'s topology database from said alternate recommended parent node back to said instructing node and, if said instructing node is not the primary server node, back to said primary server node.

10. The process of claim 9, wherein step (f)(ii) and includes the following steps:

(1) adding said connection requesting user node to the topology database as a child of the recommended parent node; and

(2) if said recommended parent node would have no apparent available capacity to transmit content data to an additional node with said connection requesting user node docked with it, deleting the recommended parent node from the PRPL and adding it to the SRPL.

11. The process of claim 9, wherein step (g)(iv) includes the following steps:

(1) adding said connection requesting user node to the topology database as a child of the recommended parent node;

(2) if said recommended parent node would have no apparent available capacity to transmit content data to an additional node with said connection requesting user node docked with it, deleting the recommended parent node from the PRPL; and

(3) if said recommended parent node is deleted from the PRPL but has at least one low-bandwidth node docked directly to it, adding the recommended parent node to the SRPL.

12. The process of claim 9, wherein step (g)(v) includes the following steps:

(3) adding said connection requesting user node to the topology database as a child of the alternate recommended parent node; and

(4) if said alternate recommended parent node would have no apparent available capacity to transmit content data to an additional node with said connection requesting user node docked with it, deleting the alternate recommended parent node from the SRPL.

13. The process of claim 9, further comprising the following steps:

(h) having said connection requesting user node go to node at top of connection address list;

(i) having said connection requesting user node determine whether node at top of said connection address list is part of the distribution network;

(j) 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 (h) and (i) with respect to next node at top of connection address list; and

(k) if node at top of connection address list is part of said distribution network, having said connection requesting user node dock with said node at top of connection address list.

14. The process of claim 9, further comprising the following steps:

(h) having said connection requesting user node go to node at top of connection address list;

(i) having said connection requesting user node determine whether node at top of said connection address list is part of the distribution network;

(j) 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 (h) and (i) with respect to next node at top of connection address list;

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

(l) 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, having said connection requesting user node dock with said node at top of connection address list.

15. The process of claim 14, further comprising the following steps:

(m) if node at top of connection address list is part of said distribution network and said node at top of connection address list does not have available capacity to transmit content data to said connection requesting user node, repeating steps (a)-(g), with said node at top of connection address list being said instructing node and a new connection address list being the product of steps (a)-(g).

16. The process of claim 15, further comprising the steps of counting the times that step (m) is performed and, when step (m) is performed a predetermined number of times, having said connection requesting user node repeat steps (a)-(g) with said primary server being the instructing node.

17. A process for docking a connection requesting user node with a distribution network, said process including the following steps:

(a) having an instructing node receive a connection request from said connection requesting user node;

(b) determinining whether said connection requesting user node'"'"'s bandwidth capacity is below a predetermined threshold (i.e., said respective docked user node is a low-bandwidth node) or at least said predetermined threshold (i.e., said respective docked user node is a high-bandwidth node);

(c) forming an instructing node topology database indicating, at a point in time,

(i) which, if any, user nodes are docked with said instructing node as child nodes;

which, if any, user nodes are docked with each of said child nodes as grandchild nodes of said instructing node;

which, if any, user nodes are docked with each of said grandchild nodes as great-grandchild nodes of said server node; and

so on; and

(ii) said docked user nodes'"'"' respective bandwidth capacities;

(d) if said connection requesting user node is a high-bandwidth user node, selecting from a group of nodes including the instructing node and said docked user nodes a recommended parent node for said connection requesting user node, 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 instructing node as any other docked user node having apparent available capacity to transmit content data to said connection requesting user node;

(e)if said connection requesting user node is a low-bandwidth user node, selecting from a group of nodes including the instructing node and said docked user nodes a recommended parent node for said connection requesting user node, wherein said recommended parent node has apparent available capacity to transmit content data to said connection requesting user node and is at least as far from said instructing node as any other docked user node having apparent available capacity to transmit content data to said connection requesting user node; and

(f) providing a connection address list to said connection requesting user node, said connection address list listing each node in said instructing node'"'"'s topology database from said recommended parent node back to said instructing node.

18. The process of claim 17, wherein step (f) further comprises the following step:

(i) if said instructing node is not a server node, including in said connection address list a list of nodes cascadingly connected with each other from the instructing node back to said server node.

19. A process for connecting a connection requesting user node to a computer information distribution network having a primary server node and user nodes docked therewith in a cascaded relationship, said process further comprising the following steps:

(a) providing said connection requesting user node with a connection address list which sets forth a list of user nodes docked in series with each other back to said primary server;

(b) having said connection requesting user node go to node at top of said connection address list;

(c) having said connection requesting user node determine whether node at top of said connection address list is part of the distribution network;

(d) 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 (b) and (c) with respect to next node at top of connection address list; and

(e) if node at top of connection address list is part of said distribution network, having said connection requesting user node dock with said node at top of connection address list.

20. A process for connecting a connection requesting user node to a computer information distribution network having a primary server node and user nodes docked therewith in a cascaded relationship, said process further comprising the following steps:

(a) providing said connection requesting user node with a connection address list which sets forth a list of user nodes docked in series with each other back to said primary server;

(b) having said connection requesting user node go to node at top of connection address list;

(c) having said connection requesting user node determine whether node at top of said connection address list is part of the distribution network;

(d) 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 (b) and (c) with respect to next node at top of connection address list;

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

(f) 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, having said connection requesting user node dock with said node at top of connection address list.

21. In a computer information distribution network comprising a primary server node and user nodes docked therewith in a cascaded relationship, wherein each user node may have no more than a predetermined maximum number of child nodes docked with it, a process for reconfiguring the network in the event of a user node'"'"'s departure therefrom, said process including the following steps:

(a) providing information at a point in time to a node in the distribution network as follows;

(i) the node'"'"'s propagation rating if it is a user node having a parent node which is a user node, wherein a propagation rating is one of a predetermined number of grades ranging from highest to second highest to third highest and so on, with the number of grades being equal to said predetermined maximum number;

(ii) an ancestor list setting forth the node'"'"'s ancestor nodes'"'"' addresses (if it has any ancestor nodes) back to the primary server node, with the node'"'"'s parent node being atop the ancestor list;

(iii) a sibling list of the node'"'"'s sibling nodes'"'"' addresses (if it has any sibling nodes) and their respective propagation ratings; and

(iv) a child list of the node'"'"'s child nodes'"'"' addresses (if it has any child nodes) and their respective propagation ratings;

(b) having a first node send a propagation signal to each former child node of a departed node, wherein said first node is an ancestor of said former child node of said departed node;

(c) with respect to each child node receiving the propagation signal which did not have the highest propagation rating prior to its receiving the propagation signal (hereinafter referred to as a “

red node”

), upon its receiving the propagation signal,

(i) setting the propagation rating of the red node to the next higher grade above the propagation rating of that red node before it received the propagation signal;

(ii) having the red node undock from its parent node (if it was docked with its parent node before it received the propagation signal); and

(iii) having the red node dock with its sibling node which had the highest propagation rating prior to the red node'"'"'s receiving the propagation signal;

(d) with respect to each child node receiving the propagation signal which had the highest propagation rating prior to its receiving a propagation signal (hereinafter referred to as a “

green node”

), upon its receiving the propagation signal,

(i) setting the propagation rating of that green node to the lowest grade; and

(ii) having the green node retransmit the propagation signal to its child nodes (if it has any); and

(iii) determining whether the green node is docked with the node from which the green node received the propagation signal and if it is, having the green node remain docked with said node from which the green node received the propagation signal, and if it is not, having the green node dock with said node from which the green node received the propagation signal; and

(e) repeating steps (c) and (d) with respect to each user node which receives a retransmitted propagation signal.

22. In a computer information distribution network comprising a primary server node and user nodes docked therewith in a cascaded relationship, wherein each user node may have no more than a predetermined maximum number of child nodes docked with it, a process for reconfiguring the network in the event of a user node'"'"'s departure therefrom, said process including the following steps:

(a) providing information at a point in time to a node in the distribution network as follows;

(i) the node'"'"'s propagation rating if it is a user node having a parent node which is a user node, wherein a propagation rating is one of a predetermined number of grades ranging from highest to second highest to third highest and so on, with the number of grades being equal to said predetermined maximum number;

(ii) an ancestor list setting forth the node'"'"'s ancestor nodes'"'"' addresses (if it has any ancestor nodes) back to the primary server node, with the node'"'"'s parent node being atop the ancestor list;

(iii) a sibling list of the node'"'"'s sibling nodes'"'"' addresses (if it has any sibling nodes) and their respective propagation ratings; and

(iv) a child list of the node'"'"'s child nodes'"'"' addresses (if it has any child nodes) and their respective propagation ratings;

(b) having a first node send a propagation signal to each former child node of a departed node, wherein said first node is an ancestor of said former child node of said departed node;

(c) with respect to each child node receiving the propagation signal which did not have the highest propagation rating prior to its receiving the propagation signal (hereinafter referred to as a “

red node”

), upon its receiving the propagation signal,

(i) setting the propagation rating of the red node to the next higher grade above the propagation rating of that red node before it received the propagation signal;

(ii) having the red node undock from its parent node (if it was docked with its parent node before it received the propagation signal);

(iii) devising a first connection address list comprising the address of the red node'"'"'s sibling node which had the had the highest propagation rating prior to the red node'"'"'s receiving the propagation signal followed by the red node'"'"'s ancestor list;

(iv) having said red node go to node at top of first connection address list;

(v) having said red node determine whether node at top of said first connection address list is part of the distribution network;

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

(vii) if node at top of first connection address list is part of said distribution network, determining whether said node at top of connection address list has available capacity to transmit content data to said red node; and

(vii) if node at top of first connection address list is part of said distribution network and has available capacity to transmit content data to said red node, having said red node dock with said node at top of connection address list;

(d) with respect to each child node receiving the propagation signal which had the highest propagation rating prior to its receiving a propagation signal (hereinafter referred to as a “

green node”

), upon its receiving the propagation signal,

(i) setting the propagation rating of that green node to the lowest grade; and

(ii) having the green node retransmit the propagation signal to its child nodes (if it has any);

(iii) determining whether the green node is docked with the node from which the green node received the propagation signal and if it is, having the green node remain docked with said node from which the green node received the propagation signal, and if it is not, devising a second connection address list starting with said node from which the green node received the propagation signal and followed by that portion of said green node'"'"'s ancestor list extending back to the primary server from said node from which the green node received the propagation signal;

(iv) having said green node go to node at top of second connection address list;

(v) having said green node determine whether node at top of said second connection address list is part of the distribution network;

(vi) if node at top of connection address list is not part of the distribution network, deleting such node from second connection address list and repeating steps (d)(iv) and (d)(v) with respect to next node at top of second connection address list;

(vii) if node at top of second connection address list is part of said distribution network, determining whether said node at top of connection address list has available capacity to transmit content data to said green node; and

(viii) if node at top of second connection address list is part of said distribution network and has available capacity to transmit content data to said green node, having said green node dock with said node at top of connection address list; and

(e) repeating steps (c) and (d) with respect to each user node which receives a retransmitted propagation signal.

23. The process of claim 22, wherein step (c)(iii) includes the following additional step:

(1) waiting a predetermined period of time so as to allow the red node'"'"'s sibling with the highest propagation rating prior to the red node'"'"'s receipt of the propagation signal (hereinafter the “

green node”

) to retransmit the propagation signal to the green node'"'"'s child nodes (if any).

24. In a computer information distribution network comprising an instructing node having a fist user node docked with said instructing node to receive content data therefrom and a second user node docked with said first user node to receive content data therefrom, a process for handling a purported communication interruption between said first user node and said second user node, said process including the following steps:

(a) having said instructing node receive a first complaint about said first user node from said second user node;

(b) if the second user node is the only user node docked with said first user node at a point in time, if said instructing node receives another complaint about first user node from another user node within a predetermined period of time from when said instructing node received said first complaint or if said instructing node experiences a communication problem between it and said first user node during said predetermined period of time,

(i) disconnecting said first user node from said instructing node; and

(c) if said instructing node has not experienced a communication problem between it and said first user node during said predetermined period of time and if a plurality of user nodes are docked with said first user node at said point in time and said instructing node has not received another complaint about said first user node from user node other than said second user node within said predetermined period of time,

(i) disconnecting said second user node from said fist user node.

25. The process of claim 24, wherein step (b) includes the following step:

(ii) sending a signal to the user nodes docked with said first user node indicating the departure of said first user node from said network.

26. The process of claim 24, wherein each user node may have no more than a predetermined maximum number of child nodes docked with it, wherein step (b) includes the following steps:

(ii) providing information at said point in time to each of said second user node, the other user nodes which had been docked with said first user node (if any) and at least one of any user nodes cascadingly connected in the distribution network under said first user node prior to said first user node'"'"'s being disconnected from said instructing node (if any) as follows;

(1) the node'"'"'s propagation rating, wherein a propagation rating is one of a predetermined number of grades ranging from highest to second highest to third highest and so on, with the number of grades being equal to said predetermined maximum number;

(2) an ancestor list setting forth the node'"'"'s ancestor nodes'"'"' addresses (if it has any ancestor nodes) back to the instructing node, with the node'"'"'s parent node being atop the ancestor list;

(3) a sibling list of the node'"'"'s sibling nodes'"'"' addresses (if it has any sibling nodes) and their respective propagation ratings; and

(4) a child list of the node'"'"'s child nodes'"'"' addresses (if it has any child nodes) and their respective propagation ratings;

(iii) having said instructing node send a propagation signal to each of said second user node and the other user nodes which had been docked with said first user node (if any);

(iv) with respect to each user node receiving the propagation signal which did not have the highest propagation rating prior to its receiving the propagation signal (hereinafter referred to as a “

red node”

), upon its receiving the propagation signal,

(1) setting the propagation rating of the red node to the next higher grade above the propagation rating of that red node before it received the propagation signal;

(2) having the red node undock from its parent node (if it was docked with its parent node before it received the propagation signal); and

(3) having the red node dock with its sibling node which had the highest propagation rating prior to the red node'"'"'s receiving the propagation signal;

(v) with respect to each user node receiving the propagation signal which had the highest propagation rating prior to its receiving a propagation signal (hereinafter referred to as a “

green node”

), upon its receiving the propagation signal,

(1) setting the propagation rating of that green node to the lowest grade; and

(2) having the green node retransmit the propagation signal to its child nodes (if it has any); and

(3) determining whether the green node is docked with the node from which the green node received the propagation signal and if it is, having the green node remain docked with said node from which the green node received the propagation signal, and if it is not, having the green node dock with said node from which the green node received the propagation signal; and

(vi) repeating steps (iv) and (v) with respect to each user node which receives a retransmitted propagation signal.

35. The distribution network of claim 24 wherein said point in time is an event experienced approximately simultaneously by substantially all user nodes.

27. 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 it to a user node docked to it for purpose of receiving content date from said repeater node (hereinafter referred to as a “

child node”

);

(b) wherein each repeater node has the ability to provide to a user node which is attempting to dock with said repeater node connection address instructions.

28. The distribution network of claim 27 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.

29. The distribution network of claim 28 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.

30. The distribution network of claim 27 wherein each user node includes an ancestor database indicating to which node said user node is docked so that said user node may receive content data therefrom (hereinafter referred to as a “

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.

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

32. The distribution network of claim 28 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.

33. A distribution network for the distribution of content data from a server node to user nodes, wherein n levels of user nodes are cascadingly connected to said server node, wherein n is a number greater than one, wherein each user node includes a delay which causes the playing of content data by such node to be delayed a period of time (hereinafter “

delay time”

) from a point in time, and wherein delays in higher level nodes create greater delay times than do delays in lower level nodes.

34. A distribution network for the distribution of content data from a server node to user nodes, wherein n levels of user nodes are cascadingly connected to said server node, wherein n is a number greater than one, wherein each user node includes a delay which causes the playing of content data by such node to be delayed a period of time (hereinafter “

delay time”

) from a point in time, wherein x is a number from and including 2 to and including n, and wherein delays in (x-1) level nodes create greater delay times than do delays in x level nodes.

36. The distribution network of claim 34 wherein said point in time is when said node receives content data.

37. A distribution network for the distribution of content data from a server node to user nodes, wherein n levels of user nodes are cascadingly connected to said server node, wherein n is a number greater than one, wherein each user node includes a delay which causes the playing of content data by such node to be delayed a period of time (hereinafter “

delay time”

) from a point in time, wherein x is a number from and including 2 to and including n, and wherein delays in (x-1) level nodes create greater delay times than do delays in x level nodes.

38. The distribution network of claim 37 wherein said point in time is an event experienced approximately simultaneously by substantially all user nodes.

39. The distribution network of claim 37 wherein said point in time is when said node receives content data.