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

• US 20060212596A1
• Filed: 09/22/2005
• Published: 09/21/2006
• Est. Priority Date: 09/13/2001
• Status: Active Grant

• Current Assignee: NYIAX, Inc.
• Original Assignee: Network Foundation Technologies, LLC
• Inventors: O'Neal, Michael, Kleinpeter, Joshua
• Granted Patent: US 7,543,074 B2
• Time in Patent Office: Days
• 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. (canceled)

2. (canceled)

3. (canceled)

4. (canceled)

5. (canceled)

6. (canceled)

7. (canceled)

8. (canceled)

9. (canceled)

10. (canceled)

11. (canceled)

12. (canceled)

13. (canceled)

14. (canceled)

15. (canceled)

16. (canceled)

17. (canceled)

18. (canceled)

19. (canceled)

20. (canceled)

21. (canceled)

22. (canceled)

23. (canceled)

24. (canceled)

25. (canceled)

26. (canceled)

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. (canceled)

34. (canceled)

35. (canceled)

36. (canceled)

37. (canceled)

38. (canceled)

39. (canceled)