Patents Assigned to Network Foundation Technologies, LLC
  • Publication number: 20150295814
    Abstract: 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.
    Type: Application
    Filed: November 18, 2014
    Publication date: October 15, 2015
    Applicant: Network Foundation Technologies, LLC
    Inventors: Mike O'Neal, Joel Francis, Tara Johnson, Ben Stroud, Landon Wright
  • Patent number: 8892770
    Abstract: 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.
    Type: Grant
    Filed: January 23, 2012
    Date of Patent: November 18, 2014
    Assignee: Network Foundation Technologies, LLC
    Inventors: Mike O'Neal, Joel Francis, Tara Johnson, Ben Stroud, Landon Wright
  • Patent number: 8873432
    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.
    Type: Grant
    Filed: July 27, 2010
    Date of Patent: October 28, 2014
    Assignee: Network Foundation Technologies, LLC
    Inventors: Mike O'Neal, John P. Talton
  • Patent number: 8219659
    Abstract: 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.
    Type: Grant
    Filed: December 22, 2009
    Date of Patent: July 10, 2012
    Assignee: Network Foundation Technologies, LLC
    Inventors: Mike O'Neal, John P. Talton
  • Patent number: 8103750
    Abstract: 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.
    Type: Grant
    Filed: September 14, 2009
    Date of Patent: January 24, 2012
    Assignee: Network Foundation Technologies, LLC
    Inventors: Mike O'Neal, Joel Francis, Tara Johnson, Ben Stroud, Landon Wright
  • Patent number: 7925726
    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).
    Type: Grant
    Filed: January 17, 2008
    Date of Patent: April 12, 2011
    Assignee: Network Foundation Technologies, LLC
    Inventors: Mike O'Neal, John P. Talton
  • Patent number: 7895324
    Abstract: 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.
    Type: Grant
    Filed: May 18, 2009
    Date of Patent: February 22, 2011
    Assignee: Network Foundation Technologies, LLC
    Inventors: Mike O'Neal, John P. Talton
  • Patent number: 7843855
    Abstract: A system and method is provided for broadcasting content in two streams to a plurality of nodes using two tree networks. The two tree networks have a plurality of nodes where each node is a repeater node or a leaf node. The first data stream is retransmitted down the first tree network by each repeater node in the first tree network. The second data stream is retransmitted down the second tree network by each repeater node in the second tree network. At least one of the nodes acting as a repeater in the first tree network acts as a leaf node in the second tree network, and at least one of the nodes acting as a leaf in the first tree network acts as a repeater node in the second tree network.
    Type: Grant
    Filed: May 9, 2007
    Date of Patent: November 30, 2010
    Assignee: Network Foundation Technologies, LLC
    Inventor: Michael O'Neal
  • Patent number: 7818407
    Abstract: 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.
    Type: Grant
    Filed: January 17, 2008
    Date of Patent: October 19, 2010
    Assignee: Network Foundation Technologies, LLC
    Inventors: Mike O'Neal, John P. Talton
  • Patent number: 7664840
    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.
    Type: Grant
    Filed: July 11, 2005
    Date of Patent: February 16, 2010
    Assignee: Network Foundation Technologies, LLC
    Inventors: Mike O'Neal, John P. Talton
  • Patent number: 7543074
    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.
    Type: Grant
    Filed: September 22, 2005
    Date of Patent: June 2, 2009
    Assignee: Network Foundation Technologies, LLC
    Inventors: Michael O'Neal, Joshua Kleinpeter
  • Patent number: 7536472
    Abstract: 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.
    Type: Grant
    Filed: July 11, 2005
    Date of Patent: May 19, 2009
    Assignee: Network Foundation Technologies, LLC
    Inventors: Mike O'Neal, John P. Talton
  • Patent number: 7512676
    Abstract: 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.
    Type: Grant
    Filed: July 7, 2005
    Date of Patent: March 31, 2009
    Assignee: Network Foundation Technologies, LLC
    Inventors: Mike O'Neal, John P. Talton
  • Publication number: 20060259607
    Abstract: A system and method are provided for delivery of broadcast data over an augmented tree network that includes a content server, a tree server, an augmentation server and at least one node. The content server streams a fraction of the broadcast data to the tree server, and streams a complement to the fraction of the broadcast data to the augmentation server. A node connects to the tree server, thereby receiving the fraction of the broadcast data, the fraction having a positive value less than one. The node connects to the augmentation server, thereby receiving the complement to the fraction of the broadcast data from the augmentation server. The node assembles the fraction of the broadcast data with the complement to the fraction of the broadcast data to reassemble the broadcast data, whereby broadcast data is delivered to the node.
    Type: Application
    Filed: April 21, 2006
    Publication date: November 16, 2006
    Applicant: Network Foundation Technologies, LLC
    Inventors: Michael O'Neal, John Talton, Ben Stroud, Charles Norman, Joel Francis