A multi-stage software router overcomes scalability issues related to a single, PC-based, software router by introducing parallel forwarding paths. However, since the architecture includes different internal components, energy inefficiency at low loads may arise if the multi-stage internal architecture does not adapt to currently offered traffic. This paper presents an energy-saving scheme to improve energy efficiency of the multi-stage router architecture by focusing on the back-end stage and sizing it to the offered load to reduce energy needs. The problem is defined as a mixed integer linear programming model, shown to be NP-hard. We tackle the scalability issues of the optimal problem by defining a twostep heuristic which takes advantage of existing BIN PACKING algorithms. Our results shows that the two-step solution is within 10% relative error with respect to the optimal solution for different realistic scenarios
Energy saving in distributed router architectures / Bianco, Andrea; Debele, FIKRU GETACHEW; Giraudo, Luca. - STAMPA. - (2012), pp. 2951-2955. (Intervento presentato al convegno IEEE ICC 2012 tenutosi a Ottawa, Canada nel June 2012) [10.1109/ICC.2012.6364157].
Energy saving in distributed router architectures
BIANCO, ANDREA;DEBELE, FIKRU GETACHEW;GIRAUDO, LUCA
2012
Abstract
A multi-stage software router overcomes scalability issues related to a single, PC-based, software router by introducing parallel forwarding paths. However, since the architecture includes different internal components, energy inefficiency at low loads may arise if the multi-stage internal architecture does not adapt to currently offered traffic. This paper presents an energy-saving scheme to improve energy efficiency of the multi-stage router architecture by focusing on the back-end stage and sizing it to the offered load to reduce energy needs. The problem is defined as a mixed integer linear programming model, shown to be NP-hard. We tackle the scalability issues of the optimal problem by defining a twostep heuristic which takes advantage of existing BIN PACKING algorithms. Our results shows that the two-step solution is within 10% relative error with respect to the optimal solution for different realistic scenariosFile | Dimensione | Formato | |
---|---|---|---|
camera_ready.pdf
accesso aperto
Tipologia:
2. Post-print / Author's Accepted Manuscript
Licenza:
Pubblico - Tutti i diritti riservati
Dimensione
209.18 kB
Formato
Adobe PDF
|
209.18 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2506025
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo