公开(公告)号：US07536472B2

公开(公告)日：2009-05-19

申请号：US11179041

申请日：2005-07-11

申请人： Mike O'Neal ,  John P. Talton

发明人： Mike O'Neal ,  John P. Talton

IPC分类号： G06F15/16

CPC分类号： H04L41/12 ,  H04L12/1854 ,  H04L65/4076 ,  H04L67/06 ,  H04L67/104 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1089 ,  H04L67/1091 ,  H04L67/1095 ,  H04L67/1097 ,  H04L67/16

摘要： A system and method for propagating a network topology model of a binary tree topology network through the network. The network includes a plurality of nodes, including a root node and at least one leaf node, operatively networked together. Each leaf node provides a propagate network topology model message to the parent node docked uptree of and with the providing leaf node. Each of the plurality of nodes that receives the propagate network topology model message forms a network topology model representing one or more paths from the receiving node to nodes downtree of the receiving node, stores the model in a memory accessible to the receiving node, and provides a propagate network topology model message containing the network topology model to the parent node docked uptree of and with the receiving node. A network topology model is thereby propagated through the network.

摘要翻译： 一种用于通过网络传播二叉树拓扑网络的网络拓扑模型的系统和方法。 该网络包括多个节点，其包括可操作地联网在一起的根节点和至少一个叶节点。 每个叶子节点向父节点提供传播网络拓扑模型消息，停靠在提供叶节点上。 接收传播网络拓扑模型消息的多个节点中的每一个形成表示从接收节点到接收节点的节点下降的一个或多个路径的网络拓扑模型，将模型存储在接收节点可访问的存储器中，并提供 传播网络拓扑模型消息，其包含网络拓扑模型到父节点，停靠在接收节点上并与接收节点对齐。 因此，网络拓扑模型通过网络传播。

公开(公告)号：US07895324B2

公开(公告)日：2011-02-22

申请号：US12467877

申请日：2009-05-18

申请人： Mike O'Neal ,  John P. Talton

发明人： Mike O'Neal ,  John P. Talton

IPC分类号： G06F15/173

CPC分类号： H04L41/12 ,  H04L12/1854 ,  H04L65/4076 ,  H04L67/06 ,  H04L67/104 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1089 ,  H04L67/1091 ,  H04L67/1095 ,  H04L67/1097 ,  H04L67/16

摘要： Methods for propagating a network topology model of a binary tree topology network through a network, the network including a root node and leaf nodes, networked together to provide a communications path for data, each of the nodes except the root node being docked downtree of a parent node, and each of the nodes docked uptree of a first child node and a second child node, each of the at least one leaf nodes having none of the plurality of nodes docked downtree of and therewith. Each of the leaf nodes provides a propagate network topology model message containing the address of the providing leaf node to the parent node docked uptree of and with the providing leaf node. Each node receiving the message forms a network topology model representing a path from the receiving node to each one of the plurality of nodes downtree of the receiving node.

摘要翻译： 通过网络传播二叉树拓扑网络的网络拓扑模型的方法，网络包括根节点和叶节点，联网在一起以提供数据的通信路径，除了根节点之外的每个节点被停靠在一个 父节点，并且每个节点停靠在第一子节点和第二子节点的上游，至少一个叶节点中的每一个节点都不具有多个节点中的任一个停靠在其上。 每个叶节点提供传播网络拓扑模型消息，其包含提供叶节点的地址到父节点，停靠在提供叶节点上。 接收消息的每个节点形成表示从接收节点到接收节点的多个节点中的每一个的路径的网络拓扑模型。

公开(公告)号：US07512676B2

公开(公告)日：2009-03-31

申请号：US11176956

申请日：2005-07-07

申请人： Mike O'Neal ,  John P. Talton

发明人： Mike O'Neal ,  John P. Talton

IPC分类号： G06F15/173

CPC分类号： H04L67/104 ,  H04L12/1854 ,  H04L12/44 ,  H04L45/02 ,  H04L45/48 ,  H04L65/4076 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1089 ,  H04L67/1091

摘要： Methods for reconfiguring binary tree topology networks upon the departure of a departing node are described. A register message is sent from a child node to a parent node, the register message requesting that the parent node dock uptree of the child node. In response, a register accept is sent from the parent node to the child node, thus docking the parent node uptree of the child node. A priority join message is sent from a second child node to the first child node requesting that the first child node dock uptree of the second child node. A disconnect propagate message is sent from the first child node to a grandchild node upon receiving a priority join message from the second child node. A join accept is sent from the first child node to the second child node, thus docking the first child node uptree of the second child node.

摘要翻译： 描述了在离开节点离开时重新配置二叉树拓扑网络的方法。 寄存器消息从子节点发送到父节点，该寄存器消息请求父节点停靠子节点。 作为响应，寄存器接受从父节点发送到子节点，从而对接子节点的父节点。 从第二子节点向第一子节点发送优先级加入消息，请求第一子节点停靠在第二子节点上。 在从第二子节点接收到优先级加入消息时，从第一子节点发送到连接传播消息到孙子节点。 从第一子节点向第二子节点发送连接接受，从而对接第二子节点的第一子节点。

公开(公告)号：US08873432B2

公开(公告)日：2014-10-28

申请号：US12844550

申请日：2010-07-27

申请人： Mike O'Neal ,  John P. Talton

发明人： Mike O'Neal ,  John P. Talton

IPC分类号： H04L12/28 ,  H04L12/753 ,  H04L29/08 ,  H04L12/44 ,  H04L12/751 ,  H04L12/18 ,  H04L29/06

CPC分类号： H04L67/104 ,  H04L12/1854 ,  H04L12/44 ,  H04L45/02 ,  H04L45/48 ,  H04L65/4076 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1089 ,  H04L67/1091

摘要： 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.

公开(公告)号：US20100153534A1

公开(公告)日：2010-06-17

申请号：US12645245

申请日：2009-12-22

申请人： Mika O'Neal ,  John P. Talton

发明人： Mika O'Neal ,  John P. Talton

IPC分类号： G06F15/173 ,  H04L9/32

CPC分类号： H04L12/1854 ,  H04L29/12009 ,  H04L61/00 ,  H04L65/4076 ,  H04L67/04 ,  H04L67/104 ,  H04L67/1044 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1089 ,  H04L67/1091 ,  H04L67/1095

摘要： 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.

公开(公告)号：US20090016241A1

公开(公告)日：2009-01-15

申请号：US12016120

申请日：2008-01-17

申请人： Mike O'Neal ,  John P. Talton

发明人： Mike O'Neal ,  John P. Talton

IPC分类号： H04L12/28

CPC分类号： H04L67/104 ,  H04L12/1854 ,  H04L12/44 ,  H04L45/02 ,  H04L45/48 ,  H04L65/4076 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1089 ,  H04L67/1091

摘要： A system and method for preventing reconfiguring a binary tree topology network. The network includes a plurality of nodes, a root node and a first set of nodes, operatively networked together to provide a downtree communication path for data. A first node is docked downtree of, and with a parent node, and uptree of, and with a first and second child node. The first node, and the first and second child node, are each one of the first set of nodes, and the plurality of nodes includes each of the first set of nodes and the parent node. A please stand by message is sent from the first node to the first and second child nodes. The first and second child nodes are inhibited from reporting an issue with the performance of the first node for at least a predetermined period after the please stand by message is received.

摘要翻译： 一种用于防止重新配置二叉树拓扑网络的系统和方法。 网络包括多个节点，根节点和第一组节点，可操作地联网在一起以提供用于数据的下行通信路径。 第一个节点被停靠在父节点的下游，并且与第一个和第二个子节点一起起伏，并且与第一个和第二个子节点相关联。 第一节点以及第一和第二子节点是第一组节点中的每个节点，并且多个节点包括第一组节点和父节点中的每一个。 请等待消息从第一个节点发送到第一个和第二个子节点。 在接收到等待消息之后，禁止第一和第二子节点在至少预定时间段内报告具有第一节点的性能的问题。

公开(公告)号：US07925726B2

公开(公告)日：2011-04-12

申请号：US12016136

申请日：2008-01-17

申请人： Mike O'Neal ,  John P. Talton

发明人： Mike O'Neal ,  John P. Talton

IPC分类号： G06F15/177 ,  G06F15/16 ,  H04L12/28 ,  H04L12/56

CPC分类号： H04L67/104 ,  H04L12/1854 ,  H04L12/44 ,  H04L45/02 ,  H04L45/48 ,  H04L65/4076 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1089 ,  H04L67/1091

摘要： 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).

摘要翻译： 本发明的各种实施例涉及一种用于通过计算机网络分发数据（例如，内容数据）的系统和在计算机网络中布置接收机节点的方法，使得服务器的容量被有效地增加（例如， 服务器可能会有效地倍增倍数倍;服务器的容量可能有效地按指数增长）。

公开(公告)号：US20110019591A1

公开(公告)日：2011-01-27

申请号：US12844550

申请日：2010-07-27

申请人： Mike O'Neal ,  John P. Talton

发明人： Mike O'Neal ,  John P. Talton

IPC分类号： H04L12/28

CPC分类号： H04L67/104 ,  H04L12/1854 ,  H04L12/44 ,  H04L45/02 ,  H04L45/48 ,  H04L65/4076 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1089 ,  H04L67/1091

摘要： 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.

公开(公告)号：US07664840B2

公开(公告)日：2010-02-16

申请号：US11179063

申请日：2005-07-11

申请人： Mike O'Neal ,  John P. Talton

发明人： Mike O'Neal ,  John P. Talton

IPC分类号： G06F15/173

CPC分类号： H04L12/1854 ,  H04L29/12009 ,  H04L61/00 ,  H04L65/4076 ,  H04L67/04 ,  H04L67/104 ,  H04L67/1044 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1089 ,  H04L67/1091 ,  H04L67/1095

摘要： 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.

公开(公告)号：US08219659B2

公开(公告)日：2012-07-10

申请号：US12645245

申请日：2009-12-22

申请人： Mike O'Neal ,  John P. Talton

发明人： Mike O'Neal ,  John P. Talton

IPC分类号： G06F15/173

CPC分类号： H04L12/1854 ,  H04L29/12009 ,  H04L61/00 ,  H04L65/4076 ,  H04L67/04 ,  H04L67/104 ,  H04L67/1044 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1089 ,  H04L67/1091 ,  H04L67/1095

摘要： Various embodiments of the present invention relate to a super-node formed from a plurality of nodes in a binary tree topology network. The super-node includes a multitasking computing system having a memory, and nodes running the computing system. Each of the nodes are adapted to be docked downtree of and with another node, and are adapted to be docked uptree of and with two other nodes. A first node in the plurality of nodes is 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 is docked downtree of and with another one of the plurality of nodes. In this manner, a super-node is formed having more than two sockets available for connection with nodes not running on the multitasking computing system.

摘要翻译： 本发明的各种实施例涉及从二叉树拓扑网络中的多个节点形成的超节点。 超级节点包括具有存储器的多任务计算系统和运行计算系统的节点。 每个节点适合于与另一个节点对接，并适用于与两个其他节点对接。 多个节点中的第一节点被停靠在第一单独的计算系统上运行的父节点的停顿处。 除了第一节点之外的多个节点中的每个节点被对接在多个节点中的另一个节点上。 以这种方式，形成了具有多于两个可用于与不在多任务计算系统上运行的节点连接的插座的超级节点。