1. A method, comprising: selecting, by a node N within a computer network utilizing directed acyclic graph (DAG) routing, a parent node P within the DAG; in response to P not being a root of the DAG, determining, by N, a grandparent node GP as a parent node to the parent node P; selecting, by N, an alternate parent node P′ that has connectivity to GP and N; and informing, from N, P and P′ about prefixes reachable via N and also about P′ as an alternate parent node to P to reach the prefixes reachable via N.