Systems for distributing data over a computer network and methods for arranging nodes for distribution of data over a computer network
Various embodiments of the present invention relate to a system for distributing data (e.g., content data) over a computer network and a method of arranging receiver nodes in a computer network such that the capacity of a server is effectively increased (e.g., the capacity of a server may be effectively multiplied many times over; the capacity of the server may be effectively increased exponentially).
1. A method of operation for a network node capable of operating in a binary tree topology network, the network node having one uptree channel, and a first and second downtree channels, each channel capable of docking with a node, the method comprising the steps of
sending a standard connection request to a parent node, and receiving an acknowledgement of that request, thereby permitting the network node and the parent node to be docked on the uptree channel;
receiving a standard connection request from a first child node, and acknowledging that request, thereby permitting the first node to be docked with the network node on a first downtree channel;
receiving a standard connection request from a second child node, and acknowledging that request, thereby permitting the second node to be docked with the network node on a second downtree channel;
maintaining a network model comprising an address for a grandparent node, and for any node docked with the network node;
receiving a priority join request from a third node, and in response to the priority join request:
if nodes are docked on both of the first and second downtree channels of the network node,
sending a depart propagate message to a node selected from the set of: a first child node or a second child node,
thereby causing the selected node and the network node to be no longer docked; and
sending an acknowledgement of the priority join request to the third node, thereby permitting the network node and the third node to be docked on one of the first and second downtree channels.
2. The method of claim 1 wherein the step of sending a depart propagate message to the selected node further comprises sending the address of the unselected node to the selected node.
3. The method of claim 1 further comprising the step of
maintaining a first utility rating for the first downtree channel and a second utility rating for the second downtree channel; and
wherein the node is selected from the set of: a first child node or a second child node, is selected by comparing the utility ratings of the first child node and the second child node.
4. The method of claim 3 wherein the utility rating for a channel is based upon at least one selected from the set of: the time a node has been docked on that channel; the bandwidth of that channel; or the performance of that channel.
5. A method of operation for a network node capable of operating in a binary tree topology network, the network node having one uptree channel, and a first and second downtree channels, each channel capable of docking with a node, the method comprising the steps of:
sending a standard connection request to a parent node, and receiving an acknowledgement of that request, thereby permitting the network node and the parent node to be docked on the uptree channel;
maintaining a network model comprising an address for a grandparent node;
maintaining a utility identifier provided by the parent node reflecting the relative utility between the network node and a sibling node;
determining that the parent node is no longer docked on the upstream channel;
sending a standard connection request to a grandparent node, and receiving an acknowledgement of that request, thereby permitting the network node and the grandparent node to be docked on the uptree channel; and
if the utility identifier reflects lower relative utility of the network node, pausing prior to the step of sending a standard connection request to the grandparent node.