Throughput Maximization of Queueing Networks with Simultaneous Minimization of Service Rates and Buffers

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="692593.fig.0013a" src="https://static.hindawi.com/articles/mpe/volume-2012/692593/figures/692593.fig.0013a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Initial population</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="692593.fig.0013b" src="https://static.hindawi.com/articles/mpe/volume-2012/692593/figures/692593.fig.0013b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>After 10 generations</td></tr></table></td></tr><tr class="fig-image" id="c"><td><img alt="692593.fig.0013c" src="https://static.hindawi.com/articles/mpe/volume-2012/692593/figures/692593.fig.0013c.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(c) </b>After 100 generations</td></tr></table></td></tr><tr class="fig-image" id="d"><td><img alt="692593.fig.0013d" src="https://static.hindawi.com/articles/mpe/volume-2012/692593/figures/692593.fig.0013d.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(d) </b>Final result after 4,000 generations</td></tr></table></td></tr></table>

<table>Population evolution of a 3-node network.</table>

Mathematical Problems in Engineering

fig13

Figure 13

Figure 13: Throughput Maximization of Queueing Networks with Simultaneous Minimization of Service Rates and Buffers 