ROUTING OF DIGITAL CONTENT IN A PEER-TO-PEER DYNAMIC CONNECTION STRUCTURE

摘要

Dynamic Connection Structures (DCS) utilizing many topologies and routing means and methods for transferring data files to pluralities of computers or nodes on a network are provided. Many types of meshes, graphs, rings, and ordered binary tree algorithms are provided which are configured to adapt and change their topologies and routing schemes in peer-to-peer architectures, depending upon a number of significant attributes of the nodes, including their relative positions, capacities, content status, and their respective relationships to other nodes in the DCS. At least one traffic cop node is arranged and enabled for overseeing, adapting and maintaining the topology of the DCS. Advantageously, nodes of the invention are adapted for simultaneously sending and receiving chunks of a file set transmitted over the DCS. Additions and removals of nodes can be achieved at any time by contacting affected nodes, and modifying their connections to reflect the changes determined by the algorithm. Thus, nodes of the invention are adapted for efficiently changing their topologies and for routing content between and among the nodes of the DCS.