A method comprising: creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc being a double ended reversible path comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination network node via any one of the first or second ends of the routing arc, the loop-free routing topology providing first and second non-congruent paths, a non-congruent path being a network path that does not share any part of its path with any other network path; and forwarding bicasting data, comprising a data packet in a first direction from the third network node and a bicasted copy of the data packet in a second direction from the third network node, concurrently to the destination network node respectively via the first and second non-congruent paths, wherein the creating includes: associating first-hop nodes, that are one hop from the destination network node, as belonging to one of the first non-congruent path or the second non-congruent path; and propagating the association of each first-hop node along the corresponding routing arc that includes the first-hop node toward one of the corresponding third network node in the corresponding routing arc, or a junction node in the corresponding routing arc, the junction node providing a junction to a buttressing routing arc (BA1.13, BA2.13, BA3.13), wherein at least one of the routing arcs is a root arc having the corresponding first network node as the first-hop node belonging to the first non-congruent path and the corresponding second network node as the corresponding first-hop node belonging to the second non-congruent path, the third network node of the at least one routing arc having possession of an arc cursor for controlling the network traffic along the corresponding at least one routing arc via the respective first or second non-congruent paths of the corresponding routing arc. creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc being a double ended reversible path comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination network node via any one of the first or second ends of the routing arc, the loop-free routing topology providing first and second non-congruent paths, a non-congruent path being a network path that does not share any part of its path with any other network path; and forwarding bicasting data, comprising a data packet in a first direction from the third network node and a bicasted copy of the data packet in a second direction from the third network node, concurrently to the destination network node respectively via the first and second non-congruent paths, wherein the creating includes: associating first-hop nodes, that are one hop from the destination network node, as belonging to one of the first non-congruent path or the second non-congruent path; and propagating the association of each first-hop node along the corresponding routing arc that includes the first-hop node toward one of the corresponding third network node in the corresponding routing arc, or a junction node in the corresponding routing arc, the junction node providing a junction to a buttressing routing arc (BA1.13, BA2.13, BA3.13), wherein at least one of the routing arcs is a root arc having the corresponding first network node as the first-hop node belonging to the first non-congruent path and the corresponding second network node as the corresponding first-hop node belonging to the second non-congruent path, the third network node of the at least one routing arc having possession of an arc cursor for controlling the network traffic along the corresponding at least one routing arc via the respective first or second non-congruent paths of the corresponding routing arc. associating first-hop nodes, that are one hop from the destination network node, as belonging to one of the first non-congruent path or the second non-congruent path; and propagating the association of each first-hop node along the corresponding routing arc that includes the first-hop node toward one of the corresponding third network node in the corresponding routing arc, or a junction node in the corresponding routing arc, the junction node providing a junction to a buttressing routing arc (BA1.13, BA2.13, BA3.13), wherein at least one of the routing arcs is a root arc having the corresponding first network node as the first-hop node belonging to the first non-congruent path and the corresponding second network node as the corresponding first-hop node belonging to the second non-congruent path, the third network node of the at least one routing arc having possession of an arc cursor for controlling the network traffic along the corresponding at least one routing arc via the respective first or second non-congruent paths of the corresponding routing arc.