Abstract: A communication network comprising a plurality of network nodes is provided, wherein the network nodes are logically arranged to form a plurality of concentric rings, all rings except the outermost ring being with high probability fully constructed; the number of nodes on each fully constructed ring being dD, wherein d denotes the base of an integer having D digits, D?1, and wherein D also denotes the ring number, D starting with the value 1 for the innermost ring; each node being identified by an identification number unique in the network, said identification number having D digits, D?1, and D denoting the ring number on which the node is located, and the value of each digit being between 0 and d?1; and each node of a given fully constructed ring is allowed to route data packets to one node in the next inner ring, to d nodes in the next outer ring, if the next outer ring is fully constructed, and to at least d nodes on the same ring.

Abstract: A communication network comprising a plurality of network nodes is provided, wherein the network nodes are logically arranged to form a plurality of concentric rings, all rings except the outermost ring being with high probability fully constructed; the number of nodes on each fully constructed ring being dD, wherein d denotes the base of an integer having D digits, D?1, and wherein D also denotes the ring number, D starting with the value 1 for the innermost ring; each node being identified by an identification number unique in the network, said identification number having D digits, D?1, and D denoting the ring number on which the node is located, and the value of each digit being between 0 and d?1; and each node of a given fully constructed ring is allowed to route data packets to one node in the next inner ring, to d nodes in the next outer ring, if the next outer ring is fully constructed, and to at least d nodes on the same ring.