Dynamic Network Topology for Energy Efficient Routers

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Computer networks, especially large ones like data centers, consume significant energy due to redundant routers, even during low usage periods, leading to unnecessary energy waste as routers operate continuously.

Innovation Solution

A protocol-independent algorithm dynamically determines minimal network topologies by identifying and powering down unnecessary routers while maintaining performance standards, ensuring that edge nodes remain active to support baseline bandwidth requirements.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If routers are kept running continuously to maintain network redundancy and performance, then network reliability is improved, but energy consumption increases

Engineering Contradiction:
Improvenetwork reliabilityVSAvoidrouter energy consumption
Core Design Contradiction:
ReliabilityVSUse of energy by stationary object

Solution Approach 1:

The patent applies dynamics by transitioning the network topology from static to dynamic, allowing routers to be powered on or off based on real-time traffic conditions. The system continuously monitors network usage and adjusts the active router set accordingly, making the network configuration adaptable to changing demands while maintaining reliability during low-usage periods through selective router activation.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the operational state parameter of routers from always-on to conditionally-active based on network usage thresholds. By monitoring traffic parameters and adjusting router power states accordingly, the system reduces energy consumption during low-usage periods while ensuring network reliability is maintained when traffic demands increase.

Inventive Principle:
Principle #35Parameter changes

2Speed

If network topology includes high coupling and redundancy between routers, then data transfer speed and recovery rates are improved, but energy consumption increases

Engineering Contradiction:
Improvedata transfer speedVSAvoidrouter energy consumption
Core Design Contradiction:
SpeedVSUse of energy by stationary object

Solution Approach 1:

The patent applies partial action by maintaining full network redundancy and routing capabilities only when necessary, rather than continuously. During low-usage periods, the system activates only the minimum necessary subset of routers to handle current traffic demands, while keeping redundant paths available but inactive, thus reducing energy consumption without sacrificing the ability to provide fast data transfer and recovery when needed.

Inventive Principle:
Principle #16Partial or excessive action

3Reliability

If routers operate continuously to ensure performance quality, then network performance is maintained, but energy waste occurs during low usage periods

Engineering Contradiction:
Improveperformance qualityVSAvoidenergy waste
Core Design Contradiction:
ReliabilityVSLoss of energy

Solution Approach 1:

The patent implements periodic action by continuously monitoring network usage patterns and dynamically adjusting router operational states in response to changing traffic conditions. The system periodically evaluates whether current traffic levels warrant keeping all routers active or if energy savings can be achieved by powering down unnecessary routers, thereby eliminating energy waste during low-usage periods while maintaining performance quality when needed.

Inventive Principle:
Principle #19Periodic action

Data Source

PatentUS9124449B2Network topologies for energy efficient networks
Publication Date: 2015.09.01 CISCO TECHNOLOGY INC
  • US9124449B2 patent drawing
  • US9124449B2 patent drawing
  • US9124449B2 patent drawing

AI summary

One embodiment receives at a first node in at least a portion of a network a routing table, the portion of the network comprising the first node and one or more second nodes, the routing table specifying the immediate neighbor that provides each of the best paths in the portion of the network based on a total cost; using the routing table, determines at the first node every second node that is necessary for the first node to reach all edges of the network, the second nodes that are necessary for the first node to reach all edges of the network comprising an active set for the first node; and sends a message from the first node to every second node to facilitate determining whether to shut down the second node.