Energy-delay tradeoffs in a load-balanced router

Abstract

Abstract-The Load-Balanced Router architecture has received a lot of attention because it does not require centralized scheduling at the internal switch fabrics. In this paper we reexamine the architecture, motivated by its potential to turn off multiple components and thereby conserve energy in the presence of low traffic.We perform a detailed analysis of the queue and delay performance of a Load-Balanced Router under a simple random routing algorithm. We calculate probabilistic bounds for queue size and delay, and show that the probabilities drop exponentially with increasing queue size or delay. We also demonstrate a tradeoff in energy consumption against the queue and delay performance.

Analysis & Minimization of the Effect of Delay on Load Balancing for Efficient Web Server Queueing Model

“…No centralized scheduling is required by the load-balanced router architecture at the internal switch fabrics. Andrews & Zhang (2012) reconsidered the architecture with the motive of increasing potential without using manifold components. As a result the energy has conserved in the presence of small traffic and showed a thorough analysis of the queue.…”

“…A load-balanced router under a simple random routing algorithm has shown the delay performance. The probabilistic bounds for queue size and delay showed that the probabilities drop exponentially with increasing queue size or time delay (Andrews & Zhang, 2012). Now-a-days, distributed virtual environments (DVEs) are widely adopted in recent years because of rapid growth of applications like massive multiplayer online games.…”