公开(公告)号：US07818407B2

公开(公告)日：2010-10-19

申请号：US12016120

申请日：2008-01-17

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

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

IPC分类号： G06F15/177

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.

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

公开(公告)号：US20080212498A1

公开(公告)日：2008-09-04

申请号：US12016136

申请日：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

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

公开(公告)号：US20050283526A1

公开(公告)日：2005-12-22

申请号：US11179063

申请日：2005-07-11

申请人： Mike O'Neal ,  John Talton

发明人： Mike O'Neal ,  John Talton

IPC分类号： G06F15/16 ,  G06F15/173 ,  H04L12/18 ,  H04L29/08 ,  H04L29/12

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.

公开(公告)号：US20050283525A1

公开(公告)日：2005-12-22

申请号：US11176956

申请日：2005-07-07

申请人： Mike O'Neal ,  John Talton

发明人： Mike O'Neal ,  John Talton

IPC分类号： G06F15/16 ,  G06F15/173 ,  H04L29/08

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. 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.

公开(公告)号：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.

公开(公告)号：US20090307348A1

公开(公告)日：2009-12-10

申请号：US12467877

申请日：2009-05-18

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

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

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

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

公开(公告)号：US20050283530A1

公开(公告)日：2005-12-22

申请号：US11179041

申请日：2005-07-11

申请人： Mike O'Neal ,  John Talton

发明人： Mike O'Neal ,  John Talton

IPC分类号： G06F15/173 ,  H04L29/08

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

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