A method, comprising: collecting, by a distributed intelligence agent, DIA, local state information from a plurality of minimalistic connected objects, MCOs, in a computer network, the local state information for each MCO comprising a corresponding neighbor list and a selected next-hop for the respective MCO, wherein one or more of the MCOs are configured to select their next-hop without any self-optimization to build a current minimal routing topology, an initial instance of the current minimal routing topology having loop prevention, but having no objective function, the objective function specifying a list of metrics and constraints used to build the current minimal routing topology, no mechanism for local repair, and no propagating advertisement messages; and wherein the DIA is configured to provide an edge to the computer network for the MCOs; analyzing, by the DIA, the current minimal routing topology, which is the combined result of the selected next-hops, and comparing the current minimal routing topology to a computed optimal routing topology to determine whether to optimize the current minimal routing topology; and in response to determining that the current minimal routing topology should be optimized, transmitting a unicast routing instruction from the DIA to one or more individual MCOs to instruct those individual MCOs how to optimize the current minimal routing topology. collecting, by a distributed intelligence agent, DIA, local state information from a plurality of minimalistic connected objects, MCOs, in a computer network, the local state information for each MCO comprising a corresponding neighbor list and a selected next-hop for the respective MCO, wherein one or more of the MCOs are configured to select their next-hop without any self-optimization to build a current minimal routing topology, an initial instance of the current minimal routing topology having loop prevention, but having no objective function, the objective function specifying a list of metrics and constraints used to build the current minimal routing topology, no mechanism for local repair, and no propagating advertisement messages; and wherein the DIA is configured to provide an edge to the computer network for the MCOs; wherein one or more of the MCOs are configured to select their next-hop without any self-optimization to build a current minimal routing topology, an initial instance of the current minimal routing topology having loop prevention, but having no objective function, the objective function specifying a list of metrics and constraints used to build the current minimal routing topology, no mechanism for local repair, and no propagating advertisement messages; and wherein the DIA is configured to provide an edge to the computer network for the MCOs; analyzing, by the DIA, the current minimal routing topology, which is the combined result of the selected next-hops, and comparing the current minimal routing topology to a computed optimal routing topology to determine whether to optimize the current minimal routing topology; and in response to determining that the current minimal routing topology should be optimized, transmitting a unicast routing instruction from the DIA to one or more individual MCOs to instruct those individual MCOs how to optimize the current minimal routing topology.