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

• US 7,664,840 B2
• Filed: 07/11/2005
• Issued: 02/16/2010
• Est. Priority Date: 09/13/2001
• Status: Expired due to Fees

• Current Assignee: NYIAX, Inc.
• Original Assignee: Network Foundation Technologies, LLC
• Inventors: Talton, John P., O'Neal, Mike
• Primary Examiner(s): NGUYEN, THANH T
• Application Number:
  US11/179,063
• Publication Number:
  US 20050283526A1
• Time in Patent Office: 1,681 Days
• Field of Search: 709/223, 709/201, 709/208, 370/407, 707/102
• US Class Current: 709/223
• CPC Class Codes: H04L 12/1854 with non-centralised forwarding system, e.g. chaincast
• CPC Class Codes: H04L 61/00 Network arrangements, protocols or services for addressing or naming
• 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/04 specially adapted for terminals or networks with limited capabilities; specially adapted for terminal portability
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1044 Group management mechanisms management of multicast group membership H04L12/185; reconfiguring of node membership in a computing system to eliminate errors G06F11/1425
• CPC Class Codes: H04L 67/1046 Joining mechanisms
• CPC Class Codes: H04L 67/1048 Departure or maintenance mechanisms
• CPC Class Codes: H04L 67/1089 Hierarchical topologies
• CPC Class Codes: H04L 67/1091 Interfacing with client-server systems or between P2P systems
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes

Abstract

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). In one embodiment the present invention may take advantage of the excess capacity many receiver nodes possess, and may use such receiver nodes as repeaters. The distribution system may include node(s) having database(s) which indicate ancestor(s) and/or descendant(s) of the node so that reconfiguration of the distribution network may be accomplished without burdening the system'"'"'s primary server. An embodiment of the present invention may include 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 the network. In one example (which example is intended to be illustrative and not restrictive), the process may include 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 (or attempt to 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 (or attempt to go to) the next node on the connection address list. In another example (which example is intended to be illustrative and not restrictive), when a user node departs from the distribution network, a propagation signal may be transmitted to the nodes below it in the network, causing them to move up in the network in a predetermined order. In another example (which example is intended to be illustrative and not restrictive), the present invention may provide a decentralized approach which provides, to each new user node (or connection requesting user node) a path back to the root server.

Claims

1. A super-node formed from a plurality of nodes in a binary tree topology network, the super-node comprising:

a multitasking computing system having a memory;

a first node running on the computing system, the first node being docked downtree of and with a parent node running on a first separate computing system, the first node having a first socket adapted to be docked uptree of a first child node and a second socket adapted to be docked uptree of a second child node;

a second node running on the computing system, the second node being virtually docked downtree of and with the first node over the first socket, the second node having a third socket adapted to be docked uptree of a third child node and a fourth socket adapted to be docked uptree of a fourth child node; and

a third node running on the computing system, the third node being virtually docked downtree of and with at least one of the first node over the second socket or the second node over the third socket or the fourth socket, the third node having a fifth socket adapted to be docked uptree of a fifth child node and a sixth socket adapted to be docked uptree of a sixth child node;

at least one selected from the second socket, the third socket or the fourth socket being configured to be docked uptree of and with a child node running on a second separate computing system,

whereby a super-node comprising the first node and the second node is formed on the same computing system.

2. The super-node claimed in claim 1, wherein the second socket, the third socket and the fourth socket are configured to be docked uptree of and with respective children nodes not running on the multitasking computing system.

3. The super-node claimed in claim 1, wherein the third socket, the fourth socket, the fifth socket and the sixth socket are configured to be docked uptree of and with respective children nodes not running on the multitasking computing system, thus proving a super-node capable of having four children in a binary tree topology network.

4. The super-node of claim 1 wherein the first node and the second node are implemented on the computing system as separate instances of software, each of which instance provides the functionality for one of the virtual nodes.

5. The super-node of claim 1 wherein the first node, the second node and the third node are implemented on the computing system as separate instances of software, each of which instance provides the functionality for one of the virtual nodes.

6. The super-node of claim 1 wherein the first node and the second node are implemented on the computing system by a single instance of software to provide the functionality for the first node and the second node.

7. The super-node of claim 1 Wherein the first node, the second node and the third node are implemented on the computing system by a single instance of software to provide the functionality for the first node, the second node and the third node.

8. A super-node formed from a plurality of nodes in a binary tree topology network, the super-node comprising:

a multitasking computing system having a memory;

a plurality of nodes running the computing system, each of the plurality of nodes being adapted to be docked downtree of and with another node, and being adapted to be docked uptree of and with two other nodes, the plurality of nodes including a first node, a second node and a third node, the third node being virtually docked downtree of and with at least one of the first node or the second node, the third node having a first socket adapted to be docked uptree of a first child node and a second socket adapted to be docked uptree of a second child node;

the first node being docked downtree of and with a parent node running on a first separate computing system;

each node of the plurality of nodes except the first node being docked downtree of and with another one of the plurality of nodes;

thereby forming a super-node on the multitasking computer system comprising the plurality of nodes and having more than two sockets available for connection with nodes not running on the multitasking computing system.

9. The super-node claimed in claim 8, wherein each of the plurality of nodes running the computing system are separate instances of the same software.

10. A method of forming a virtual tree in a binary tree topology network, the method comprising the steps of:

instantiating a first node on a first computer, the first node being adapted to dock downtree of and with one node, and adapted to dock uptree of and with two nodes;

docking the first node downtree of and with a parent node running on a first separate computer system;

instantiating a second node on the first computer, the second node being adapted to dock downtree of and with one node, and adapted to dock uptree of and with two nodes;

docking the second node downtree of and with the first node, thereby forming a virtual tree capable of docking uptree of and with at least three nodes in a binary tree topology network, which three nodes are not running on the first computer,

instantiating a third node on the first computer, the third node being adapted to dock downtree of and with one node, and adapted to dock uptree of and with two nodes; and

docking the third node downtree of and with the first node, thereby forming a virtual tree capable of docking uptree of and with at least four nodes in a binary tree topology network, which four nodes are not ruining on the first computer;

whereby a supernode comprising the first node and the second node is formed on the first computer.

11. The method of claim 10, further comprising the steps of:

instantiating a fourth node on the first computer, the fourth node being adapted to dock downtree of and with one node, and adapted to dock uptree of and with two nodes; and

docking the fourth node downtree of and with the second node,

instantiating a fifth node on the first computer, the fifth node being adapted to dock downtree of and with one node, and adapted to dock uptree of and with two nodes; and

docking the fifth node downtree of and with the third node, thereby forming a virtual tree capable of docking uptree of and with a plurality of nodes not running on the first computer.