Abstract: Embodiments of the present disclosure generally relate to the field of electronic data communications, and more specifically to transport methods for hierarchical data networks in relation to providing “address-less data transport” of data packets. An order is introduced or associated with nodes to establish relationships, and the order may be stored in the form of a tree topology in a data structure. The order of nodes is thus known, and logic and/or other data sets, data payloads, etc., may be transmitted across the nodes, wherein the steps to execute the transmission are more efficient due to the properties of the ordered nodes. Each node in the plurality of nodes is comprised of a plurality of network interfaces, which through pairwise joining, forms a data network of a tree topology.