# US 2013/0159550 A1 · Assisted intelligent routing for minimalistic connected object networks > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2013/0159550 A1 - Document ID: US20130159550A1 - Status: Published application - Kind: A1 - Application number: 13/331,686 - Filed: 2011-12-20 - Published: 2013-06-20 - Earliest claimed: 2011-12-20 - Assignees: Cisco Technology, Inc. - Inventors: Jean-Philippe Vasseur - Web page: https://patentgrep.com/patent/US20130159550A1 ## CPC - H04L 45/42: Centralised routing - H04L 41/0823: characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability (for optimising operational conditions of wireless networks H04W24/02) - H04L 41/12: Discovery or management of network topologies - H04L 41/5019: Ensuring fulfilment of SLA - H04L 45/00: Routing or path finding of packets in data switching networks (routing or path finding in wireless networks H04W40/00) - H04L 45/02: Topology update or discovery - H04L 45/021: Ensuring consistency of routing table updates, e.g. by using epoch numbers - H04L 45/12: Shortest path evaluation - H04L 45/126: {minimising geographical or physical path length} - H04L 45/14: {Routing performance; Theoretical aspects} - H04L 45/20: {Hop count for routing purposes, e.g. TTL} - H04L 45/44: Distributed routing - H04L 45/70: {Routing based on monitoring results} - H04W 40/248: {Connectivity information update} - Y04S 40/00: Systems for electrical power generation, transmission, distribution or end-user application management characterised by the use of communication or information technologies, or communication or information technology specific aspects supporting them - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) - Y04S: SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS ## Abstract In one embodiment, a distributed intelligence agent (DIA) collects 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, where one or more of the MCOs are configured to select their next-hop without any self-optimization. The DIA may then analyze a current routing topology, which is the combined result of the selected next-hops, in comparison to a computed optimal routing topology, and (optionally) in light of required service level agreement (SLA), to determine whether to optimize the current routing topology. In response to determining that the current routing topology should be optimized, the DIA may transmit a unicast routing instruction to one or more individual MCOs to instruct those individual MCOs how to optimize the current routing topology, accordingly. ## Claims ### Claim 1 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; analyzing, by the DIA, a current routing topology, which is the combined result of the selected next-hops, in comparison to a computed optimal routing topology to determine whether to optimize the current routing topology; and in response to determining that the current 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 routing topology. ### Claim 2 (depends on 1) The method as in claim 1, further comprising: receiving updated local state information from the MCOs at the DIA; analyzing a corresponding updated current routing topology; and transmitting additional unicast routing instructions in response to determining that the updated current routing topology should be further optimized. ### Claim 3 (depends on 1) The method as in claim 1, further comprising: computing the optimal routing topology based on one or more constraints. ### Claim 4 (depends on 1) The method as in claim 1, further comprising: computing the optimal routing topology based on meeting one or more required service level agreements (SLAs). ### Claim 5 (depends on 1) The method as in claim 1, wherein determining whether to optimize the current routing topology is based on at least one factor selected from a group consisting of: a total cost differential between the current routing topology and the optimized routing topology; a maximum path cost difference between the current routing topology and the optimized routing topology; a path within the current routing topology not meeting one or more required service level agreements (SLAs); and a number of changes required to optimize the current routing topology. ### Claim 6 (depends on 1) The method as in claim 1, wherein the transmitted routing instruction comprises a new next-hop selection for the respective individual MCO. ### Claim 7 (depends on 1) The method as in claim 1, wherein the local state information comprises at least one of local link cost, local link reliability, local link delay, local link expected transmission count (ETX), and a link-based received signal strength indication (RSSI). ### Claim 8 An apparatus, comprising: one or more network interfaces to communicate in a computer network; a processor coupled to the network interfaces and adapted to execute one or more processes; and a memory configured to store a process executable by the processor, the process when executed operable to: collect 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; analyze a current routing topology, which is the combined result of the selected next-hops, in comparison to a computed optimal routing topology to determine whether to optimize the current routing topology; and in response to determining that the current routing topology should be optimized, transmit a unicast routing instruction to one or more individual MCOs to instruct those individual MCOs how to optimize the current routing topology. ### Claim 9 (depends on 8) The apparatus as in claim 8, wherein the process when executed is further operable to: receive updated local state information from the MCOs; analyze a corresponding updated current routing topology; and transmit additional unicast routing instructions in response to determining that the updated current routing topology should be further optimized. ### Claim 10 A method, comprising: participating, by a minimalistic connected object (MCO) with a plurality of MCOs in a computer network, in a build of a current routing topology without any self-optimization, an initial instance of the current routing topology having loop prevention, but having no objective function, no mechanisms for local repair, and no propagating advertisement messages; transmitting, from the MCO to a distributed intelligence agent (DIA), local state information comprising a corresponding neighbor list and a selected next-hop for the MCO for the current routing topology; receiving a unicast routing instruction from the DIA at the MCO that instructs the MCO how to optimize the current routing topology; and re-selecting a next-hop for an updated current routing topology according to the routing instruction from the DIA. ### Claim 11 (depends on 10) The method as in claim 10, further comprising: transmitting updated local state information from the MCO to the DIA in response to the updated local state information being a significant change from the previously transmitted local state information. ### Claim 12 (depends on 10) The method as in claim 10, wherein the local state information comprises at least one of local link cost, local link reliability, local link delay, local link expected transmission count (ETX), and a link-based received signal strength indication (RSSI). ### Claim 13 An apparatus, comprising: one or more network interfaces to communicate in a computer network; a processor coupled to the network interfaces and adapted to execute one or more processes; and a memory configured to store a process executable by the processor, the process when executed operable to: participate, with a plurality of minimalistic connected objects (MCOs) in a computer network, in a build of a current routing topology without any self-optimization, an initial instance of the current routing topology having loop prevention, but having no objective function, no mechanisms for local repair, and no propagating advertisement messages; transmit, to a distributed intelligence agent (DIA), local state information comprising a corresponding neighbor list and a selected next-hop for the apparatus for the current routing topology; receive a unicast routing instruction from the DIA that instructs the apparatus how to optimize the current routing topology; and re-select a next-hop for an updated current routing topology according to the routing instruction from the DIA. ### Claim 14 A system, comprising: a plurality of minimalistic connected objects (MCOs) in a computer network, the MCOs configured to select their respective next-hop in a current routing topology without any self-optimization, the MCOs further configured to transmit, to a distributed intelligence agent (DIA), local state information comprising a corresponding neighbor list and the respective selected next-hop; and a DIA configured to analyze the current routing topology, which is the combined result of the selected next-hops, in comparison to a computed optimal routing topology to determine whether to optimize the current routing topology, and also to transmit, in response to determining that the current routing topology should be optimized, a unicast routing instruction to one or more individual MCOs to instruct those individual MCOs how to optimize the current routing topology; wherein those individual MCOs are further configured to receive the unicast routing instruction from the DIA, and to re-select a next-hop for an updated current routing topology according to the routing instruction from the DIA. ### Claim 15 (depends on 14) The system as in claim 14, wherein the DIA is further configured to: receive updated local state information from the MCOs at the DIA; analyze a corresponding updated current routing topology; and transmit additional unicast routing instructions in response to determining that the updated current routing topology should be further optimized. ### Claim 16 (depends on 14) The system as in claim 14, wherein the DIA is further configured to compute the optimal routing topology based on at least one of the following: one or more constraints; and meeting one or more required service level agreements (SLAs). ### Claim 17 (depends on 14) The system as in claim 14, wherein determining whether to optimize the current routing topology is based on at least one factor selected from a group consisting of: a total cost differential between the current routing topology and the optimized routing topology; a maximum path cost difference between the current routing topology and the optimized routing topology; a path within the current routing topology not meeting one or more required service level agreements (SLAs); and a number of changes required to optimize the current routing topology. ### Claim 18 (depends on 14) The system as in claim 14, wherein the transmitted routing instruction comprises a new next-hop selection for the respective individual MCO. ### Claim 19 (depends on 14) The system as in claim 14, wherein the local state information comprises at least one of local link cost, local link reliability, local link delay, local link expected transmission count (ETX), and a link-based received signal strength indication (RSSI). ### Claim 20 (depends on 14) The system as in claim 14, wherein the MCOs are further configured to: participate in a build of a current routing topology without any self-optimization, an initial instance of the current routing topology having loop prevention, but having no objective function, no mechanisms for local repair, and no propagating advertisement messages. ### Claim 21 (depends on 14) The system as in claim 14, wherein the MCOs are further configured to: transmit updated local state information to the DIA in response to the updated local state information being a significant change from the previously transmitted local state information.