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

公开(公告)号：US20120215940A1

公开(公告)日：2012-08-23

申请号：US13356423

申请日：2012-01-23

申请人： Mike O'Neal ,  Joel Francis ,  Tara Johnson ,  Ben Stroud ,  Landon Wright

发明人： Mike O'Neal ,  Joel Francis ,  Tara Johnson ,  Ben Stroud ,  Landon Wright

IPC分类号： G06F15/16

CPC分类号： H04L45/125 ,  H04L12/1854 ,  H04L45/02 ,  H04L45/16 ,  H04L45/48 ,  H04L65/4076 ,  H04L67/10

摘要： Described is a method for improving both the bandwidth efficiency and bit rate of data streams flowing through binary tree networks. In an embodiment, the invention provides a method for efficiently utilizing end-consumer computers possessing a variety of upstream bandwidth capabilities to deliver online streaming video in a distributed manner.

摘要翻译： 描述了一种用于改善流经二叉树网络的数据流的带宽效率和比特率两者的方法。 在一个实施例中，本发明提供了一种用于有效利用具有各种上行带宽能力的终端消费者计算机以分布式方式提供在线流式视频的方法。

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

公开(公告)号：US20100077104A1

公开(公告)日：2010-03-25

申请号：US12559290

申请日：2009-09-14

申请人： Mike O'Neal ,  Joel Francis ,  Tara Johnson ,  Ben Stroud ,  Landon Wright

发明人： Mike O'Neal ,  Joel Francis ,  Tara Johnson ,  Ben Stroud ,  Landon Wright

IPC分类号： G06F15/16

CPC分类号： H04L45/125 ,  H04L12/1854 ,  H04L45/02 ,  H04L45/16 ,  H04L45/48 ,  H04L65/4076 ,  H04L67/10

摘要： Described is a method for improving both the bandwidth efficiency and bit rate of data streams flowing through binary tree networks. In an embodiment, the invention provides a method for efficiently utilizing end-consumer computers possessing a variety of upstream bandwidth capabilities to deliver online streaming video in a distributed manner.

摘要翻译： 描述了一种用于改善流经二叉树网络的数据流的带宽效率和比特率两者的方法。 在一个实施例中，本发明提供了一种用于有效利用具有各种上行带宽能力的终端消费者计算机以分布式方式提供在线流式视频的方法。

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